default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDActa Informatica, Volume 18
Volume 18, 1982
- Robert B. K. Dewar, Susan M. Merritt, Micha Sharir:
Some Modified Algorithms for Dijkstra's Longest Upsequence Problem. 1-15 - Raúl J. Ramírez, Frank Wm. Tompa
, J. Ian Munro:
Optimum Reorganization Points for Arbitrary Database Costs. 17-30 - Timothy A. Budd, Dana Angluin:
Two Notions of Correctness and Their Relation to Testing. 31-45 - Manfred Broy, Martin Wirsing:
Partial Abstract Types. 47-64 - Jeannine Leguy:
Langages saturés et cones décroissants Langages et cones bifidèles. 65-78 - Hans Langmaack:
On Termination Problems for Finitely Interpreted ALGOL-like Programs. 79-108 - Christiane Frougny, Jacques Sakarovitch, Erich Valkema:
On the Hotz Group of a Context-Free Grammar. 109-115 - Wolfgang Reisig:
Deterministic Buffer Synchronization of Sequential Processes. 117-134 - Lynn Robert Carter:
Further Analysis of Code Generation for a Single Register Machine. 135-147 - George W. Ernst, Jainendra K. Navlakha, William F. Ogden:
Verification of Programs with Procedure-Type Parameter. 149-169 - Narao Nakatsu, Yahiko Kambayashi, Shuzo Yajima:
A Longest Common Subsequence Algorithm Suitable for Similar Text Strings. 171-179 - Alberto Pettorossi, Rod M. Burstall:
Deriving very Efficient Algorithms for Evaluating Linear Recurrence Relations Using the Program Transformation Technique. 181-206 - Donna J. Brown, Brenda S. Baker, Howard P. Katseff:
Lower Bounds for On-Line Two-Dimensional Packing Algorithms. 207-225 - Jean-Marie Nicolas:
Logic for Improving Integrity Checking in Relational Data Bases. 227-253 - Brian Allen:
On the Costs of Optimal and Near-Optimal Binary Search Trees. 255-263 - Flemming Nielson:
A Denotational Framework for Data Flow Analysis. 265-287 - Stuart Oliver Anderson, Roland Carl Backhouse:
An Alternative Implementation of an Insertion-Only Recovery Technique. 289-298 - Karl Winklmann:
On the Complexity of Some Problems Concerning the Use of Procedures I. 299-318 - Ashok K. Agrawala, Satish K. Tripathi:
On an Exponential Server with General Cyclic Arrivals. 319-334 - Karel Culík II, Jozef Gruska, Arto Salomaa:
Systolic Automata for VLSI on Balanced Trees. 335-344 - Jan van Leeuwen, Mark H. Overmars:
Stratified Balanced Search Trees. 345-359 - Ole Eriksen, Jørgen Staunstrup:
Concurrent Algorithms for Root Searching. 361-376 - Kenneth J. Supowit, Edward M. Reingold:
The Complexity of Drawing Trees Nicely. 377-392 - Giora Slutzki:
Finite State Relational Programs. 393-409 - Karl Winklmann:
On the Complexity of some Problems Concerning the Use of Procedures II. 411-430 - Jean-Pierre Banâtre, Patrice Frison, Patrice Quinton:
A Network for the Detection of Words in Continuous Speech. 431-448 - Philippe Nain:
Partage de tâches entre processeurs homogenes. 449-466
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-01-23 00:53 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:
