default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 8
Volume 8, Number 1, 2 January 1979
- Christos H. Papadimitriou:
Efficient Search for Rationals. 1-4 - Karel Culík II:
Some Decidability Results About Regular and Pushdown Translations. 5-8 - Aviezri S. Fraenkel:
Paired Sequential Lists in a memory Interval. 9-10 - Sylvia L. Osborn:
Testing for Existence of a Covering Boyce-Codd normal Form. 11-14 - Katsushi Inoue, Itsuo Takanami:
A Note on Cyclic Closure Operations. 15-16 - Dana Angluin:
A Note on a Construction of Margulis. 17-19 - Steven Fortune, John E. Hopcroft:
A Note on Rabin's Nearest-Neighbor Algorithm. 20-23 - Yossi Shiloach:
Edge-Disjoint Branching in Directed Multigraphs. 24-27 - Adi Shamir:
Factoring Numbers in O(log n) Arithmetic Steps. 28-31 - Matthias Jantzen:
A Note on Vector Grammars. 32-33 - Katsushi Inoue, Itsuo Takanami:
A Note on Bottom-Up Pyramid Acceptors. 34-37 - Anatoliy O. Buda:
Generalized1.5 Sequential Machine Maps. 38-40 - Daniel P. Friedman, David S. Wise:
Reference Counting Can Manage the Circular Environments of Mutual Recursion. 41-45 - O. M. Makarov:
Using Duality to Compute the Pair of Matrix Products QY and YTQ Over a Commutative Ring. 46-49 - Alberto Bertoni, Giancarlo Mauri
, Mauro Torelli:
Three Efficient Algorithms for Counting Problems. 50-53
Volume 8, Number 2, 15 February 1979
- Gordon Lyon:
Batch Scheduling from Short Lists. 57-59 - Jacek Blazewicz:
Deadline Scheduling of Tasks with Ready Times and Resource Constraints. 60-63 - Dan A. Simovici, Gheorghe Grigoras:
Even Initial Feedback Vertex Set Problem is NP-Complete. 64-66 - Joep L. W. Kessels, Alain J. Martin:
Two Implementations of the Conditional Critical Region Using a Split Binary Semaphore. 67-71 - M. van der Nat:
Binary Merging by Partitioning. 72-75 - Joseph M. Morris:
A Starvation-Free Solution to the Mutual Exclusion Problem. 76-80 - Jayadev Misra:
Space-Time Trade Off in Implementing Certain Set Operations. 81-85 - Hendrik W. Lenstra Jr.:
Miller's Primality Test. 86-88 - Steven P. Reiss:
Rational Search. 89-90 - H. S. M. Kruijer:
Self-Stabilization (in Spite of Distributed Control) in Tree-Structured Systems. 91-95 - David P. Dobkin, Richard J. Lipton, Steven P. Reiss:
Linear Programming is Log-Space Hard for P. 96-97 - Tarcisio H. C. Pequeno, Carlos José Pereira de Lucena:
An Approach for Data Type Specification and Its Use in Program Verification. 98-103 - Gheorghe Paun:
On Szilard's Languages Associated to a Matrix Grammar. 104-105 - John C. Cherniavsky:
On Finding Test Data Sets for Loop Free Programs. 106-107 - Selim G. Akl:
Two Remarks on a Convex Hull Algorithm. 108-109 - Yu. G. Stoyan, V. Z. Socolovsky:
The Minimization Method for Some Permutation Functionals. 110-111 - C. C. Rick, David J. Evans:
An Improved Bisection Algorithm. 112-113
Volume 8, Number 3, 15 March 1979
- Wojciech Cellary:
A New Safety Test for Deadlock Avoidance. 115-120 - Bengt Aspvall, Michael F. Plass, Robert Endre Tarjan:
A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas. 121-123 - O. M. Vikas:
Analysis of a Periodically Inspected Buffer. 124-130 - Rudolf Mathon:
A Note on the Graph Isomorphism counting Problem. 131-132 - Jon Louis Bentley, Hermann A. Maurer:
A Note on Euclidean Near Neighbor Searching in the Plane. Inf. Process. Lett. 8(3): 133-136 (1979) - Gerard J. M. Sang Ajang, Frank Teer:
An Efficient Algorithm for Detection of Combined Occurrences. 137-140 - Sukhamay Kundu:
An Intermediate-Value Theorem for Optimum Tree Valuation. 141-145 - Yossi Shiloach:
Strong Linear Orderings of a Directed Network. 146-148 - Jan van Leeuwen:
On Compromising Statistical Data-Bases with a few Known Elements. 149-153
Volume 8, Number 4, 30 April 1979
- Maurizio A. Bonuccelli, Daniel P. Bovet:
Minimum Node Disjoint Path Covering for Circular-Arc Graphs. 159-161 - Ludwik Czaja:
A Specification of Parallel Problems. 162-167 - Martin Huits, Vipin Kumar:
The Practical Significance of Distributive Partitioning Sort. 168-169 - Wlodzimierz Dobosiewicz:
The Practical Significance of d.p.Sort Revisited. 170-172 - Alain Fournier:
Comments on Convex Hull of a Finite Set of Points in Two Dimensions. 173 - Hirosi Hitotumatu, Kohei Noshita:
A Technique for Implementing Backtrack Algorithms and its Application. 174-175 - J. Henno:
The Depth of Monotone Functions in Multivalued Logic. 176-177 - Ronald L. Rivest, Jean-Paul Van de Wiele:
An Omega(n/lg n)1/2 Lower Bound on the Number of Additions Necessary to Compute 0-1 Polynomials over the Ring of Integer Polynomials. 178-180 - Karel Culík II, Hermann A. Maurer:
Secure Information Storage and Retrieval Using New Results in Cryptography. 181-186 - Esko Ukkonen:
The Nonexistence of Some Covering Context-Free Grammars. 187-192 - C. C. Yang, D. T. Lee:
A Note on the all Nearest-Neighbor Problem for Convex Polygons. 193-194 - David Harel:
Two Results on Process Logic. 195-198 - Ján Plesník:
The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two. 199-201 - P. S. Pankov, S. L. Dolmatov:
Substantiable Evaluations by Electronic Computers and Their Application to one Problem in Combinatorial Geometry. 202-203 - Felix J. Fridman, Glenn H. Holloway, Naftaly H. Minsky, Josef Stein:
Abstract FOR-Loops Over Several Aggregates. 204-206 - Jörg R. Mühlbacher:
F-Factors of Graphs: A Generalized Matching Problem. 207-214 - Harold Abelson:
A Note on Time-Space Tradeoffs for Computing Continuous Functions. 215-217
Volume 8, Number 5, 11 June 1979
- Ysmar V. Silva Filho:
Average Case Analysis of Region Search in Balanced k-d Trees. 219-223 - Manfred Broy, Martin Wirsing, Jean-Pierre Finance, Alain Quéré, Jean-Luc Rémy:
Methodical Solution of the Problem of Ascending Subsequences of Maximum Length Within a Given Sequence. 224-229 - Timo Leipälä:
On a Generalization of Binary Search. 230-233 - Dario Bini, Milvio Capovani, Francesco Romani, Grazia Lotti:
O(n2.7799) Complexity for n*n Approximate Matrix Multiplication. 234-235 - Yossi Shiloach:
A Fast Equivalence-Checking Algorithm for Circular Lists. 236-238 - Wolfgang Reisig:
A Note on the Representation of Finite Tree Automata. 239-240 - Dirk van der Knijff, Jean-Louis Lassez:
A Clarification of the Comparison Between Some Measures of Software Science. 241-243 - Jon Louis Bentley:
Decomposable Searching Problems. 244-251 - George Loizou:
Mathematical Solution for a Data Processing System. 252-256 - Keijo Ruohonen:
The Decidability of the F0L-D0L Equivalence Problem. 257-260 - Charles N. Fischer, Kuo-Chung Tai, D. R. Milton:
Immediate Error Detection in Strong LL(1) Parsers. 261-266 - Eitan M. Gurari, Oscar H. Ibarra:
On the Space Complexity of Recursive Algorithms. 267-271 - Arnold L. Rosenberg:
A Note on Paths Embedded in Trees. 272-273 - Neelam Soundararajan:
Axiomatic Proofs of Fotal Correctness of Programs. 274-277
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 2026-03-12 01:52 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:
