default search action
Information and Computation, Volume 124
Volume 124, Number 1, 10 January 1996
- Lance Fortnow, Nick Reingold:
PP is Closed Under Truth-Table Reductions. 1-6 - Andreas Gruchalski:
Computability on dI-Domains. 7-19 - Gérard Cécé, Alain Finkel, S. Purushothaman Iyer:
Unreliable Channels are Easier to Verify Than Perfect Channels. 20-31 - Delia Kesner, Laurence Puel, Val Tannen:
A Typed Pattern Calculus. 32-61 - Christian Haack:
A Decomposition Theorem for Domains. 62-67 - James H. Anderson, Jae-Heon Yang:
Time/Contention Trade-Offs for Multiprocessor Synchronization. 68-84 - Piotr Kosiuczenko, Karl Meinke:
On the Power of Higher-Order Algebraic Specification Methods. 85-101
Volume 124, Number 2, 1 February 1996
- Douglas J. Howe
:
Proving Congruence of Bisimulation in Functional Programming Languages. 103-112 - Chun-Kuen Ho:
Beyond Recursive Real Functions. 113-126 - Rachel Ben-Eliyahu, Menachem Magidor:
A Temporal Logic for Proving Properties of Topologically General Executions. 127-144 - Campbell Fraser, Robert W. Irving, Martin Middendorf:
Maximal Common Subsequences and Minimal Common Supersequences. 145-153 - Alexander Moshe Rabinovich
On Schematological Equivalence of Dataflow Networks. 154-167 - Hsu-Chun Yen:
On the Regularity of Petri Net Languages. 168-181 - Abbas Edalat:
Power Domains and Iterated Function Systems. 182-197
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:03 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: