default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCurrent Trends in Theoretical Computer Science 1993
- Grzegorz Rozenberg, Arto Salomaa:
Current Trends in Theoretical Computer Science - Essays and Tutorials. World Scientific Series in Computer Science 40, World Scientific 1993, ISBN 978-981-02-1462-3, pp. 1-640 - Herbert Edelsbrunner:
Computational Geometry. 1-2 - Herbert Edelsbrunner:
Computational Geometry. 3-48 - Hartmut Ehrig:
Algebraic Specification. 49-50 - Hartmut Ehrig, Peter Pepper:
On the potential Role of Algebraic Specification within Computer Science. 51-53 - Hans-Jörg Kreowski:
Some initial sections of the Algebraic Specification Tale. 54-75 - Joseph A. Goguen:
Memories of ADJ. 76-81 - Hartmut Ehrig, Ingo Claßen:
Overview of Algebraic Specification Languages, Environments and Tools, and Algebraic Specifications of Software Systems. 82-110 - Jacques Loeckx:
The Specification System Obscure: a Short Survey. 111-114 - Donald Sannella, Andrzej Tarlecki:
Algebraic specification and formal methods for program development: what are the real problems? 115-120 - Hartmut Ehrig:
ESF-Concepts Linked with Algebraic Module Specifications. 121-128 - Hartmut Ehrig, Michael A. Arbib:
Linking Schemas and Module Specifications: a Proposal. 129-132 - Hartmut Ehrig:
Concepts and Compatibility Requirements for Implementations and Transformations of Specifications. 133-148 - Hartmut Ehrig, Helmut Adametz:
New Compatibility Results for Implementations within the Initial Algebraic Approach. 149-160 - Hartmut Ehrig, Michael Baldamus, Fernando Orejas:
New Concepts for Amalgamation and Extension in the Framework of Specification Logics. 161-182 - Francesco Parisi-Presicce, Alfonso Pierantonio:
Towards the Algebraic Specification of Classes in Object Oriented Programming. 183-194 - Martin Große-Rhode, Hartmut Ehrig:
Restriction Constructions in Specification Logics. 195-201 - P. S. Subramanian:
Towards an Algebraic Specification Framework for the VLSI Design Process. 202-208 - Joseph A. Goguen, Razvan Diaconescu:
A Short Oxford Survey of Order Sorted Algebra. 209-222 - Yuri Gurevich:
Logic in Computer Science. 223-224 - Yuri Gurevich:
On Kolmogorov Machines and Related Issues. 225-234 - Yuri Gurevich:
Infinite Games. 235-244 - Yuri Gurevich:
The challenger-Solver Game: variations on the Theme of P=NP. 245-253 - Yuri Gurevich:
On the Classical Decision Problem. 254-265 - Yuri Gurevich:
Evolving Algebras: an Attempt to Discover Semantics. 266-292 - Yuri Gurevich:
Zero-One Laws. 293-309 - Andreas Blass:
Topoi and Computation. 310-317 - Kevin J. Compton:
Lower Bounds for the Complexity of Theories. 318-331 - Carl A. Gunter:
Forms of Semantic Specification. 332-353 - Kenneth Kunen:
Declarative Semantics of Logic Programming. 354-376 - Andre Scedrov:
A Brief Guide to Linear Logic. 377-394 - Juris Hartmanis:
Structural Complexity. 395-396 - Juris Hartmanis:
A Retrospective on Structural Complexity. 397-402 - Juris Hartmanis:
Sparse Complete Sets for NP and the Optimal Collapse of the Polynomial Hierarchy. 403-411 - Juris Hartmanis:
Collapsing Hierarchies. 412-422 - Juris Hartmanis, Richard Chang, Jim Kadin, Stephen G. Mitchell:
Some Observations about Relativization of Space Bounded Computations. 423-434 - Juris Hartmanis:
On the Importance of Being II2-Hard. 435-444 - Juris Hartmanis:
Gödel, von Neumann and the P =? NP Problem. 445-450 - Ronald V. Book, Osamu Watanabe:
A View of Structural Complexity Theory. 451-468 - Eric Allender, Klaus W. Wagner:
Counting Hierarchies: Polynomial Time and Constant Depth Circuits. 469-483 - Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi:
On IP = PSPACE and Theorems with Narrow Proofs. 484-493 - Richard Chang, Pankaj Rohatgi:
On Unique Satisfiability and Randomized Reductions. 494-503 - Alan L. Selman:
Complexity Classes for Partial Functions. 504-522 - Lane A. Hemachandra
, Mitsunori Ogiwara:
Is #P Closed Under Subtraction? 523-536 - Juris Hartmanis, Richard Chang, Suresh Chari, Desh Ranjan, Pankaj Rohatgi:
Relativization: a Revisionistic Retrospective. 537-548 - Arto Salomaa:
Formal Language Theory. 549-550 - Lila Kari, Solomon Marcus, Gheorghe Paun, Arto Salomaa:
In the prehistory of formal language theory: Gauss languages. 551-562 - Arto Salomaa:
What Emil said about the Post Correspondence Problem. 563-571 - Arto Salomaa:
Decidability in Finite Automata. 572-578 - Jarkko Kari:
Games played on the plane : Solitaire & Cellular Automata. 579-585 - Juhani Karhumäki:
The Impact of the DOL Problem. 586-594 - Arto Salomaa:
L codes and L Systems with immigration. 595-602 - Lila Santean:
Parallel Communicating Grammar Systems. 603-615 - Valtteri Niemi:
Density in discrete systems. 616-626
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-10-01 20:54 CEST 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:
