default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 9
Volume 9, Number 1, 20 July 1979
- Hamish I. E. Gunn, Ronald Morrison:
On the Implementation of Constants. 1-4 - Paulo A. S. Veloso:
Characterizing the Regular Prefix Codes and Right Power-Bounded Languages. 5-7 - John C. Cherniavsky, John Keohane, Peter B. Henderson:
A Note Concerning Top Down Program Development and Restricted Exit Control Structures. 8-12 - Daniel M. Berry, Richard L. Schwartz:
United and Discriminated Record Types in Strongly Typed Languages. 13-18 - Patricia J. Eberlein:
A Note on Medium Selection and Spider Production. 19-22 - Alex Bykat:
On Polygon Similarity. 23-25 - H. B. M. Jonkers:
A Fast Garbage Compaction Algorithm. 26-30 - Glenn K. Manacher, Albert L. Zobrist:
Neither the Greedy Nor the Delaunay Triangulation of a Planar Point Set Approximates the Optimal Triangulation. 31-34 - Richard A. DeMillo, Raymond E. Miller:
Implicit Computation of Synchronization Primitives. 35-38 - Marek J. Lao:
A New Data Structure for the UNION-FIND Problem. 39-45 - Dario Bini, Milvio Capovani:
Lower Bounds of the Complexity of Linear Algebras. 46-47 - Andrew Chi-Chih Yao:
A Note on a Conjecture of Kam and Ullman Concerning Statistical Databases. 48-50 - Anton Nijholt
:
From Left-Regular to Greibach Normal Form Grammars. 51-55
Volume 9, Number 2, 17 August 1979
- Mark R. Brown:
Some Observations on Random 2-3 Trees. 57-59 - Jan Grabowski:
The Unsolvability of Some Petri Net Language Problems. 60-63 - F. N. Teskey:
Document Retrieval Using Associative Processors. 64-67 - F. Frances Yao:
Graph 2-Isomorphism is NP-Complete. 68-72 - Akihiro Nozaki:
A Note on the Complexity of Approximative Evaluation of Polynomials. 73-75 - Richard L. Schwartz:
Aliasing Among Pointers in EUCLID. 76-79 - W. S. Luk:
'Possible' Membership of a Multivalued Dependency in a Relational Database. 80-83 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
An Observation on Scattered Grammars. 84-85 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Finding a Homomorphism Between Two Words is NP-Complete. 86-88 - B. Srinivasan, V. Rajaraman:
On the Normalization of Relational Databases. 89-92 - Abhijit Sengupta, Subir Bandyopadhyay, Pradip K. Srimani:
On Identification of CR Property in File Organisation. 93-96 - John Grant:
Partial Values in a Tabular Database Model. 97-99 - Boguslaw L. Jackowski, Ryszard Kubiak, Stefan Sokolowski:
Complexity of Sorting by Distributive Partitioning. 100
Volume 9, Number 3, 5 October 1979
- Eike Best:
A Note on the Proof of a Concurrent Program. 103-104 - Alain Fournier, Zvi M. Kedem:
Comments on the All Nearest-Neighbor Problem for Convex Polygons. Inf. Process. Lett. 9(3): 105-107 (1979) - Charles J. Colbourn:
The Complexity of Symmetrizing Matrices. 108-109 - Sandra L. Mitchell, Stephen T. Hedetniemi:
Linear Algorithms for Edge-Coloring Trees and Unicyclic Graphs. 110-112 - R. K. Arora, S. P. Rana:
On Module Assignment in Two-Processor Distributed Systems. 113-117 - Alon Itai:
A Randomized Algorithm for Checking Equivalence of Circular Lists. 118-121 - M. Howard Williams, A. R. Bulmer:
A Transportable Code Generator System. 122-125 - Marco Ferrari, Giovanni Guida:
DB: A LISP-Type Data Base System. 126-134 - Amiram Yehudai:
A Note on the Pumping Lemma for Regular Languages. 135-136 - Kozo Itano:
Reduction of Page Swaps on the Two Dimensional Transforms in a Paging Environment. 137-140 - Ferenc Dévai, Tibor Szendrényi:
Comments on Convex Hull of a Finite Set of Points in Two Dimensions. 141-142 - Gianfranco Prini:
Stack Implementation of Shallow Binding in Languages with Mixed Scoping. 143-154 - Hans Langmaack, Wolfram-Manfred Lippe, Franz Wagner:
The Formal Termination Problem for Programs with Finite ALGOL 68-Modes. 155-159
Volume 9, Number 4, 20 November 1979
- Wm. Randolph Franklin:
Padded Lists: Set Operations in Expected Theta(log log N) Time. 161-166 - Joseph Y.-T. Leung:
Bounds on List Scheduling of UET Tasks with Restricted Resource Constraints. 167-170 - Ernest J. Cockayne, Frank Ruskey, Andrew G. Thomason:
An Algorithm for the Most Economic Link Addition in a Tree Communication Network. 171-175 - J Strother Moore:
A Mechanical Proof of the Termination of Takeuchi's Function. 176-181 - Alkiviadis G. Akritas:
On the Solution of Polynomial Equations Using Continued Fractions. 182-184 - K. Mani Chandy, Jayadev Misra:
Deadlock Absence Proofs for Networks of Communicating Processes. 185-189 - D. T. Lee, C. C. Yang:
Location of Multiple Points in a Planar Subdivision. 190-193
Volume 9, Number 5, 16 December 1979
- Jayme Luiz Szwarcfiter:
Systems of Distinct Representatives for k Families of Sets. 195-196 - Joseph M. Morris:
Traversing Binary Trees Simply and Cheaply. 197-200 - Duncan McCallum, David Avis:
A Linear Algorithm for Finding the Convex Hull of a Simple Polygon. 201-206 - G. Oulsnam:
Cyclomatic Numbers Do Not Measure Complexity of Unstructured Programs. 207-211 - Nachum Dershowitz:
A Note on Simplification Orderings. 212-215 - Alex M. Andrew:
Another Efficient Algorithm for Convex Hulls in Two Dimensions. 216-219 - J. M. Robson:
The Emptiness of Complement Problem for Semi Extended Regular Expressions Requires cn Space. 220-222 - Kevin Q. Brown:
Voronoi Diagrams from Convex Hulls. 223-228 - Sandra L. Mitchell:
Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs. 229-232 - Roman Slowinski:
Cost-Minimal Preemptive Scheduling of Independent Jobs With Release and Due Dates on Open Shop Under Resource Constraints. 233-237
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 2025-02-24 21:20 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:
