default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 100
Volume 100, Number 1, 1992
- Jerry L. Trahan
, Michael C. Loui, Vijaya Ramachandran:
Multiplication, Division and Shift Instructions in Parallel Random Access Machines. 1-44 - Andreas Goerdt:
Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions. 45-66 - Aldo de Luca, Stefano Varricchio:
On Noncounting Regular Classes. 67-104 - Robert Holte, Louis E. Rosier, Igor Tulchinsky, Donald A. Varvel:
Pinwheel Scheduling with Two Distinct Numbers. 105-135 - Daniel Benninger, Jürg Schmid:
Effective Subdirect Decomposition: A Case Study. 137-156 - Raymond A. Board, Leonard Pitt:
On the Necessity of Occam Algorithms. 157-184 - Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney:
A Distributed Selection Algorithm and its Expected Communication Complexity. 185-204 - Seinosuke Toda, Osamu Watanabe:
Polynomial Time 1-Turing Reductions from #PH to #P. 205-221 - Paul Erdös, D. Frank Hsu:
Distributed Loop Network with Minimum Transmission Delay. 223-241 - Helmut Prodinger:
Hypothetical Analyses: Approximate Counting in the Style of Knuth, Path Length in the Style of Flajolet. 243-251 - Paul Beame, Erik Brisson, Richard E. Ladner:
The Complexity of Computing Symmetric Functions Using Threshold Circuits. 253-265
Volume 100, Number 2, 1992
- Lawrence S. Moss, José Meseguer, Joseph A. Goguen:
Final Algebras, Cosemicomputable Algebras and Degrees of Unsolvability. 267-302 - Mariangiola Dezani-Ciancaglini, J. Roger Hindley:
Intersection Types for Combinatory Logic. 303-324 - Miklós Bartha:
Foundations of a Theory of Synchronous Systems. 325-346 - Ke Wang:
On Characterizing Boundedness of Database Schemes with Bounded Dependencies. 347-364 - Ralph-Johan Back, Joakim von Wright:
Combining Angles, Demons and Miracles in Program Specifications. 365-383 - Karl Meinke:
Universal Algebra in Higher Types. 385-417
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 2026-09-02 23:18 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
