default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 97
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
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-12-02 23:29 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:
