default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 102
Volume 102, Number 1, 1993
- Stephen L. Bloom, Zoltán Ésik, Dirk Taubner:
Iteration Theories of Synchronization Trees. 1-55 - Eric Shade, K. T. Narayana:
Real-Time Semantics for Shared-Variable Concurrency. 56-82 - A. J. Kfoury, Jerzy Tiuryn
, Pawel Urzyczyn:
The Undecidability of the Semi-unification Problem. 83-101 - Gerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes:
Using Inductive Counting to Simulate Nondeterministic Computation. 102-117 - Sanjay Jain, Arun Sharma:
Learning with the Knowledge of an Upper Bound on Program Size. 118-166
Volume 102, Number 2, 1993
- A. Prasad Sistla, Lenore D. Zuck:
Reasoning in a Restricted Temporal Logic. 167-195 - Martin Dietzfelbinger, Friedhelm Meyer auf der Heide:
An Optimal Parallel Dictionary. 196-217 - Michael Kaufmann, Gerhard Klär:
Routing in Polygons without Rectilinear Visible Corners. 218-262 - Rudolf Fleischer, Bhabani P. Sinha, Christian Uhrig:
A Lower Bound for the Worst Case of Bottom-Up-Heapsort. 263-279 - Niall Graham, Frank Harary, Marilynn Livingston, Quentin F. Stout:
Subcube Fault-Tolerance in Hypercubes. 280-314
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 2024-12-19 22:16 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:
