Volume 97, Number 1, 1992
- Sang Cho, Dung T. Huynh:
The Parallel Complexity of Finite-State Automata Problems.
1-22
- Yasubumi Sakakibara:
Efficient Learning of Context-Free Grammars from Positive Structural Examples.
23-60
- Brian A. Coan, Jennifer L. Welch:
Modular Construction of a Byzantine Agreement Protocol with Optimal Message Bit Complexity.
61-85
- Ingo Wegener:
The Worst Case Complexity of McDiarmid and Reed's Variant of BOTTOM-UP HEAPSORT is less than nlog n + 1.1n.
86-96
- Miklós Bartha:
An Algebraic Model of Synchronous Systems.
97-131
Volume 97, Number 2, 1992
- Raymond Greenlaw:
A Model Classifying Algorithms as Inherently Sequential with Applications to Graph Searching.
133-149
- Dan E. Willard:
A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst-Case Time.
150-204
- Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, H. Raymond Strong:
Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement.
205-233
- Tao Jiang:
The Synchronization of Nonuniform Networks of Finite Automata.
234-261
- Shih Ping Tung:
Polynomial Time Algorithms for Sentences over Number Fields.
262-276
Last update Sat May 18 20:28:08 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
