default search action
Information Processing Letters, Volume 6
Volume 6, Number 1, February 1977
- Donald E. Knuth:
A Generalization of Dijkstra's Algorithm. 1-5 - Gideon Yuval:
Theil's Estimator. 6-7 - Eiichi Goto, Tetsuo Ida, Takao Gunji:
Parallel Hashing Algorithms. 8-13 - Narsingh Deo, Mukkai S. Krishnamoorthy, Ajit B. Pai:
Generalizations of Line Graphs and Applications. 14-17 - Francis Y. L. Chin, Kenneth Steiglitz:
A Fast Error Evaluation Algorithm for Polynomial Approximation. 18-21 - S. S. Reddi:
Alternate Solutions to the Cigarette Smokers' Problem Without Conditionals. 22-24 - Andrzej Rowicki:
A Note on Optimal Preemptive Scheduling for Two-Processor Systems. 25-28 - T. H. Merrett:
Relations as Programming Language Elements. 29-33
Volume 6, Number 2, April 1977
- Claus-Peter Schnorr, H. Klupp:
A Universally Hard Set of Formulae with Respect to Non-Deterministic Turing Acceptors. 35-37 - Andrei P. Ershov:
On the Partial Computation Principle. 38-41 - R. Zuczek:
The Universal Space for Parallel Computation. 42-45 - Arno Endres, Hans-Georg Stork:
Fifo-Optimal Placement on Pages of Independently Referenced Sectors. 46-49 - Masataka Sassa, Eiichi Goto:
"V-Tape", A Virtual Memory Oriented Data Type, and its Resource Requirements. 50-55 - Jean-Pierre Banâtre:
Producing Optimised Code for Coercions. 56-59 - M. Howard Williams:
Complete Operator Precedence Conditions. 60-62 - V. Rajaraman, O. M. Vikas:
A First-In-First-Out Buffered Cyclic Memory. 63-68 - Teruo Hikita, Eiichi Goto:
An O(N) Algorithm for Finding Periodicity of a Sequence Using Hash Coding. 69-71
Volume 6, Number 3, June 1977
- E. A. Dinic, Alexander K. Kelmans, M. A. Zaitsev:
Nonisomorphic Trees with the Same T-Polynomial. 73-76 - Josef Kittler:
A Method for Determining Class Subspaces. 77-79 - Peter van Emde Boas:
Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space. 80-82 - András Jávor:
An Adaptive Time Advancement Algorithm for Discrete Simulation. 83-86 - Harald Würges:
Comments on 'Error Resynchronisation in Producer Consumer Systems'. 87-90 - Witold Lipski Jr.:
One More Polynomial Complete Consecutive Retrieval Problem. 91-93 - Sukhamay Kundu:
Sorting Tree, Nestling Tree and Inverse Permutation. 94-96 - Kari-Jouko Räihä
, Mikko Saarinen:
An Optimization of the Alternating Semantic Evaluator. 97-100
Volume 6, Number 4, August 1977
- Jacques Cohen, Joel Katcoff:
Automatic Solution of a Certain Class of Combinatorial Problems. 101-104 - Józef Winkowski:
An Algebraic Characterization of the Behaviour of Non-Sequential Systems. 105-109 - Neil D. Jones:
A Note on Linear Time Simulation of Deterministic Two-Way Pushdown Automata. 110-112 - D. A. Turner:
Error Diagnosis and Recovery in One Pass Compilers. 113-115 - S. H. Talbert:
On the Formal Specification of the Semantics of Processed Information. 116-119 - Youichi Kobuchi:
Two Characterization Theorems of Locally Catenative Developmental Systems. 120-124 - Alexandre Brandwajn, B. Mouneix:
A Study of a Page-on-Demand System. 125-132 - Vijay V. Raghavan, Clement T. Yu:
A Note on a Multidimensional Searching Problem. 133-135 - Gaston H. Gonnet, Lawrence D. Rogers:
The Interpolation-Sequential Search Algorithm. 136-139
Volume 6, Number 5, October 1977
- Mary Shaw
Selection of Good Algorithms from a Family of Algorithms for Polynomial Derivative Evaluation. 141-145 - Leon Lukaszewicz:
Functional Grammars. 146-150 - George E. Collins, David R. Musser:
Analysis of the Pope-Stein Division Algorithm. 151-155 - John Grant:
Null Values in a Relational Data Base. 156-157 - Tien Dai Bui:
On an L-Stable Method for Stiff Differential Equations. 158-161 - Jacek Blazewicz
Simple Algorithms for Multiprocessor Scheduling to Meet Deadlines. 162-164 - Stan Matwin:
On the Completeness of a Set of Transformations Optimizing Linear Programs. 165-167 - Richard S. Bird:
Two Dimensional Pattern Matching. 168-170 - Ibrahim Cahit:
Realization of Graceful Permutation by a Shuffle-Exchange Network. 171-173 - Philip W. Grant:
Recognition of E0L Languages in Less Than Quartic Time. 174-175
Volume 6, Number 6, December 1977
- Stan Matwin:
An Experimental Investigation of Geschke's Method of Global Program Optimization. 177-179 - James M. Steckelberg, Sharad C. Seth:
On a Relation Between Algebraic Programs and Turing Machines. 180-183 - Stanley M. Selkow:
The Tree-to-Tree Editing Problem. 184-186 - Johannes Madsen:
An Experiment in Formal Definition of Operating System Facilities. 187-189 - Jürgen Albert, Hermann A. Maurer:
The Class of Context-Free Languages is not an E0L Family. 190-195 - Nissim Francez:
A Case for a Forward Predicate Transformer. 196-198 - Fanica Gavril:
Testing for Equality Between Maximum Matching and Minimum Node Covering. 199-202 - I. S. Herschberg, J. C. A. Boekhorst:
Concurrent File Access Under Unpredictability. 203-208 - Jon Louis Bentley, Donald F. Stanat, E. Hollins Williams Jr.:
The Complexity of Finding Fixed-Radius Near Neighbors. 209-212 - Ivan Hal Sudborough:
A Note on Weak Operator Precedence Grammars. 213-218 - Yehoshua Perl, Edward M. Reingold:
Understanding the Complexity of Interpolation Search. 219-222 - Lyle Ramshaw:
Binomial Coefficients with Non-Integral Lower Index. 223-226
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: