default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Control, Volume 66
Volume 66, Number 1-2, 1985
- Ravi Kannan:
Unraveling k-page graphs. 1-5 - William C. Rounds:
On the Relationship between Scott Domains, Synchronization Trees, and Metric Spaces. 6-28 - Michal Grabowski:
On Relative Completeness of Hoare Logics. 29-44 - Norbert Blum:
An Area-Maximum Edge Length Trade-off for VLSI Layout. 45-52 - Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou:
The Complexity of Cubical Graphs. 53-60 - Greg N. Frederickson:
Implicit Data Structures for Weighted Elements. 61-82 - Orna Grumberg, Nissim Francez, Johann A. Makowsky, Willem P. de Roever:
A Proof Rule for Fair Termination of Guarded Commands. 83-102 - Dung T. Huynh:
The Complexity of Equivalence Problems for Commutative Grammars. 103-121
Volume 66, Number 3, 1985
- Erich L. Kaltofen
:
Effective Hilbert Irreducibility. 123-137 - Takanori Adachi:
Powerposets. 138-162 - Jacques Stern:
Complexity of Some Problems from the Theory of Automata. 163-176 - Amihood Amir:
Separation in Nonlinear Time Models. 177-203
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-04 01:27 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:
