Volume 97, Number 1, 1992
- Sang Cho, Dung T. Huynh:
The Parallel Complexity of Finite-State Automata Problems.
- Yasubumi Sakakibara:
Efficient Learning of Context-Free Grammars from Positive Structural Examples.
- Brian A. Coan, Jennifer L. Welch:
Modular Construction of a Byzantine Agreement Protocol with Optimal Message Bit Complexity.
- Ingo Wegener:
The Worst Case Complexity of McDiarmid and Reed's Variant of BOTTOM-UP HEAPSORT is less than nlog n + 1.1n.
- Miklós Bartha:
An Algebraic Model of Synchronous Systems.
Volume 97, Number 2, 1992
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
- Raymond Greenlaw:
A Model Classifying Algorithms as Inherently Sequential with Applications to Graph Searching.
- Dan E. Willard:
A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst-Case Time.
- Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, H. Raymond Strong:
Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement.
- Tao Jiang:
The Synchronization of Nonuniform Networks of Finite Automata.
- Shih Ping Tung:
Polynomial Time Algorithms for Sentences over Number Fields.