Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Vol. 3
Volume 3, Number 1, July 1974
- Jack Minker, Gordon J. van der Brug:
The Earley Algorithm as a Problem Representation. 1-7 - Kohei Noshita:
Median Selection of 9 Elements in 14 Comparisons. 8-12 - Robert Endre Tarjan:
A New Algorithm for Finding Weak Components. 13-15 - Lee W. Cooprider, F. Heymans, Pierre-Jacques Courtois, David Lorge Parnas:
Information Streams Sharing a Finite Buffer: Other Solutions. 16-21 - Jan van Leeuwen, Carl H. Smith:
An Improved Bound for Detecting Looping Configurations in Deterministic DPA's. 22-24 - Oscar H. Ibarra:
A Note on Semilinear Sets and Bounded-Reversal Multihead Pushdown Automata. 25-28 - David A. Fisher:
Bounded Workspace Garbage Collection in an Address-Order Preserving List Processing Environment. 29-32 - Antonije D. Jovanovich:
Note on a Modification of the Fundamental Cycles Finding Algorithm. 33
Volume 3, Number 2, November 1974
- Tadao Takaoka:
A Note on the Ambiguity of Context-Free Grammars. 35-36 - John A. Campbell:
Optimal Use of Storage in a Simple Model of Garbage Collection. 37-38 - Marvin V. Zelkowitz:
Structured Operating System Organization. 39-42 - Lionel E. Deimel:
Remark on the Computational Power of a Turing Machine Variant. 43-45 - Stefan Arnborg:
Abstract Computation Model Used for a Production Compiler. 46-50 - Robert Endre Tarjan:
A Good Algorithm for Edge-Disjoint Branching. 51-53 - Kojiro Kobayashi:
A Note on Extending Equivalence Theories of Algorithms. 54-56 - N. S. Sridharan:
Computer Generation of Vertex Graphs. 57-63 - Donald E. Knuth, Jayme Luiz Szwarcfiter:
Erratum: A Structured Program to Generate all Topological Sorting Arrangements. 64
Volume 3, Number 3, January 1975
- Richard J. Lipton, Robert W. Tuttle:
A Synchronization Anomaly. 65-66 - Chiharu Hosono:
On the Cardinality of Some Lattices. 67-68 - Sebastiaan H. von Solms:
On T0L Languages over Terminals. 69-70 - Subrata Dasgupta, John Tartar:
On the Minimization of Control Memories. 71-74 - Tiko Kameda:
On the Vector Representation of the Reachability in Planar Directed Graphs. 75-77 - Stefano Crespi-Reghizzi, Dino Mandrioli:
A Decidability Theorem for a Class of Vector-Addition Systems. 78-80 - Paolo M. Camerini, Francesco Maffioli:
Bounds for 3-Matroid Intersection Problems. 81-83 - John F. Reiser, Donald E. Knuth:
Evading the Drift in Floating-Point Addition. 84-87 - Ivan Dal Bono, Mauro Diligenti, Concetta Mosca, Antonio Ricci, Antonio Villani:
A Simple FORTRAN Support for Computer-Assisted Instruction. 88-90 - Klaus Weihrauch:
Program Schemata with Polynomial Bounded Counters. 91-96
Volume 3, Number 4, March 1975
- S. Galand, G. Loncour:
Structured Implementation of Symbolic Execution: A First Part in a Program Verifier. 97-103 - Jacques Cohen:
Interpretation of Non-Deterministic Algorithms in Higher-Level Languages. 104-109 - Fanica Gavril:
An Algorithm for Testing Chordality of Graphs. 110-112 - Gideon Yuval:
Finding Near Neighbors in K-Dimensional Space. 113-114 - Ibrahim Cahit, R. Cahit:
On the Graceful Numbering of Spanning Trees. 115-118 - Ben Wegbreit:
Retrieval from Context Trees. 119-120 - S. De Wolf, G. De Mey:
Numerical Methods for Solving Integral Equations of Potential Problems. 121-124 - J. M. Robson:
A Simple Solution to the Interleaved Memory Bandwidth Problem. 125-126
Volume 3, Number 5, May 1975
- Constantine Lazos:
A Comparison of Simulation Results and a Mathematical Model of a Multiprogramming System. 127-134 - Josef Kittler:
On the Divergence and the Joshi Dependence Measure in Feature Selection. 135-137 - Jan van Leeuwen:
The Membership Question for ET0L-Languages is Polynomially Complete. 138-143 - Franco P. Preparata, David E. Muller:
The Time Required to Evaluate Division-Free Arithmetic Expressions. 144-146 - H. Asai, S. C. Lee:
Design of Queuing Buffer Register Size. 147-152 - Antony Stevens:
An Elementary Computer Algorithm for the Calculation of the Coefficient of Inbreeding. 153-163 - John F. Reiser, Donald E. Knuth:
Erratum: Evading the Drift in Floating-Point Addition. Inf. Process. Lett. 3(5): 164 (1975) - N. S. Sridharan:
Erratum: Computer Generation of Vertex Graphs. Inf. Process. Lett. 3(5): 164 (1975) - Stefano Crespi-Reghizzi, Dino Mandrioli:
Erratum: A Decidability Theorem for a Class of Vector-Addition Systems. Inf. Process. Lett. 3(5): 164 (1975)
Volume 3, Number 6, July 1975
- Per Brinch Hansen:
Universal Types in Concurrent Pascal. 165-166 - Derek A. Zave:
A Fast Compacting Garbage Collector. 167-169 - Jon Louis Bentley, Donald F. Stanat:
Analysis of Range Searches in Quad Trees. 170-173 - Carlo Ghezzi:
LL(1) Grammars Supporting an Efficient Error Handling. 174-176 - Hans F. de Groote:
On the Complexity of Quaternion Multiplication. 177-179 - Stefan Pleszczynski:
On the Generation of Permutations. 180-183 - Martin Rem:
On the Programming of Elastic Stores. 184-187 - Roy A. Keir:
Should the Stable Rounding Rule be Radix-Dependent? 188-189
a service of 
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-04-26 18:22 CEST 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:
