default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 105
Volume 105, Number 1, 1993
- John C. Reynolds, Gordon D. Plotkin:
On Functors Expressible in the Polymorphic Typed Lambda Calculus. 1-29 - L. S. van Benthem Jutting:
Typing in Pure Type Systems. 30-41 - Raymond Hoofman:
Continuous Information Systems. 42-71 - William I. Gasarch, Lane A. Hemachandra
, Albrecht Hoene:
On Checking Versus Evaluation of Multiple Queries. 72-93 - Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis:
Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays. 94-104 - Eric Sven Ristad:
The Anaphora Problem. 105-131 - Soma Chaudhuri:
More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. 132-158
Volume 105, Number 2, 1993
- Samson Abramsky, C.-H. Luke Ong:
Full Abstraction in the Lazy Lambda Calculus. 159-267 - Leslie Ann Goldberg:
Automating Pólya Theory: The Computational Complexity of the Cycle Index Polynomial. 268-288
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-08 10:05 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:
