Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 107
Volume 107, Number 1, 1993
- Carme Àlvarez, Birgit Jenner:
A Very Hard log-Space Counting Class. 3-30 - François Bédard, François Lemieux, Pierre McKenzie:
Extensions to Barrington's M-Program Model. 31-61 - Rafi Heiman, Ilan Newman, Avi Wigderson:
On Read-Once Threshold Formulae and Their Randomized Decision in Tree Complexity. 63-76 - Klaus-Jörn Lange:
Unambiguity of Circuits. 77-94 - Jack H. Lutz, William J. Schmidt:
Circuit Size Relative to Pseudorandom Oracles. 95-120 - Yishay Mansour, Noam Nisan, Prasoon Tiwari:
The Computational Complexity of Universal Hashing. 121-133 - Noam Nisan:
On Read-Once vs. Multiple Access to Randomness in Logspace. 135-144 - Alessandro Panconesi, Desh Ranjan:
Quantifiers and Approximation. 145-163
Volume 107, Number 2, 1993
- Bart Jacobs:
Comprehension Categories and the Semantics of Type Dependency. 169-207 - Marco Bellia, M. Eugenia Occhiuto:
C-Expressions: A Variable-Free Calculus for Equational Logic Programming. 209-252 - Sachio Hirokawa
:
Principal Types of BCK-lambda-Terms. 253-276 - Agostino Cortesi, Gilberto Filé:
Graph Properties for Normal Logic Programs. 277-303 - Michael G. Main, David L. Black:
Semantic Models for Total Correctness and Fairness. 305-332 - Vugranam C. Sreedhar, Kazem Taghva:
Capturing Strong Reduction in Director String Calculus. 333-347 - Gilles Dowek:
The Undecidability of Pattern Matching in Calculi Where Primitive Recursive Functions are Representable. 349-356 - Robin Milner, Faron Moller:
Unique Decomposition of Processes. 357-363
a service of 
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-04-22 20:02 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:
