default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDActa Informatica, Volume 22
Volume 22, Number 1, 1985
- Michael Bechtold, Guy Pujolle, Otto Spaniol:
Throughput of a Satellite Channel Communication. 1-14 - Jeffrey H. Kingston:
Analysis of Tree Algorithms for the Simulation Event List. 15-33 - Fred B. Schneider, Richard Conway, Dale Skeen:
Thrifty Execution of Task Pipelines. 35-45 - Ali Mili, Jules Desharnais, Jean-Raymond Gagné:
Strongest Invariant Functions: Their Use in the Systematic Analysis of While Statements. 47-66 - Dean Jacobs, David Gries
:
General Correctness: A Unification of Partial and Total Correctness. 67-83 - Thomas Ottmann, Michael Schrapp, Derick Wood:
Purely Top-Down Updating Algorithms for Stratified Search Trees. 85-100 - Donald W. Loveland:
Performance Bounds for Binary Testing with Arbitrary Weights. 101-114 - Burkhard Monien, Ewald Speckenmeyer:
Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem. 115-123
Volume 22, Number 2, 1985
- Carlo Meghini, Costantino Thanos:
Querying Fragmented Relations in a Distributed Database. 125-138 - John L. Bruno:
On Scheduling Tasks with Exponential Service Times and In-Tree Precedence Constraints. 139-148 - Jim Cunningham, A. J. J. Dick:
Rewrite Systems on a Lattice of Types. 149-169 - Jörg-Rüdiger Sack, Thomas Strothotte:
An Algorithm for Merging Heaps. 171-186 - Norishige Chiba, Kazunori Onoguchi, Takao Nishizeki:
Drawing Plane Graphs Nicely. 187-201 - Tsutomu Kamimura:
An Effectively Given Initial Semigroup. 203-227 - Paul E. S. Dunne:
A 2.5n Lower Bound on the Monotone Network Complexity of T_3^n. 229-240
Volume 22, Number 3, 1985
- Bogdan Rembowski:
A Priority Queue With Interruptions of Service Permitted After a Time Quantum. 241-251 - Balakrishnan Krishnamurthy:
Short Proofs for Tricky Formulas. 253-275 - Jakob Gonczarowski:
Decidable Properties of Monadic Recursive Schemas With a Depth Parameter. 277-310 - Piotr Rudnicki, Wlodzimierz Drabent:
Proving Properties of Pascal Programs in MIZAR 2. 311-331 - John L. Bruno, Peter J. Downey:
Probabilistic Bounds for Dual Bin-Packing. 333-345
Volume 22, Number 4, 1985
- A. J. Kfoury, Pawel Urzyczyn:
Necessary and Sufficient Conditions for the Universality of Programming Formalisms. 347-377 - Moon-Jung Chung, Michael Evangelist, Ivan Hal Sudborough:
Complete Problems for Space Bounded Subclasses of NP. 379-395 - Michael Sonnenschein:
Global Storage Cells for Attributes in an Attribute Grammar. 397-420 - Dung T. Huynh:
Complexity of the Word Problem for Commutative Semigroups of Fixed Dimension. 421-432 - Meurig Beynon:
Replaceability and Computational Equivalence for Monotone Boolean Functions. 433-449 - Errol L. Lloyd, Michael C. Loui:
On the Worst Case Performance of Buddy Systems. 451-473
Volume 22, Number 5, 1985
- Masahiro Miyakawa:
Optimum Decision Trees - An Optimal Variable Theorem and its Related Applications. 475-498 - Stephan Heilbrunner:
Truly Prefix-Correct Chain-Free LR (1) Parsers. 499-536 - Bernhard Möller:
On the Algebraic Specification of Infinite Objects - Ordered and Continuous Models of Algebraic Types. 537-578 - Michel Latteux, B. Leguy, B. Ratoandromanana:
The Family of One-Counter Languages is Closed Under Quotient. 579-588 - Juraj Hromkovic:
Fooling a Two-Way Nondeterministic Multihead Automaton with Reversal Number Restriction. 589-594
Volume 22, Number 6, 1986
- Paul Caspi, Nicolas Halbwachs:
A Functional Model for Describing and Reasoning About Time Behaviour of Computing Systems. 595-627 - Tobias Nipkow:
Non-deterministic Data Types: Models and Implementations. 629-661 - Bernd Reusch, Wolfgang Merzenich:
Minimal Coverings for Incompletely Specified Sequential Machines. 663-678 - Volker Diekert:
Investigations on Hotz Groups for Arbitrary Grammars. 679-698 - Piotr Rudnicki, Wlodzimierz Drabent:
Erratum: Proving Properties of Pascal Programs in MIZAR 2. 699-707
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-05-20 23:13 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:
