


default search action
Information and Computation, Volume 186
Volume 186, Number 1, 10 October 2003
- Steffen Reith, Heribert Vollmer

:
Optimal satisfiability for propositional calculi and constraint satisfaction problems. 1-19 - Nader H. Bshouty:

The monotone theory for the PAC-model. 20-35 - Ulrich Schmid, Klaus Schossmaier:

Interval-based clock synchronization with optimal precision. 36-77 - Farid M. Ablayev

, Marek Karpinski:
A lower bound for integer multiplication on randomized ordered read-once branching programs. 78-89 - Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers:

Inverting onto functions. 90-103 - Amihood Amir, Richard Beigel, William I. Gasarch:

Some connections between bounded query classes and non-uniform complexity. 104-139 - Lucian Ilie

, Sheng Yu:
Follow automata. 140-162
Volume 186, Number 2, 1 November 2003
- Naoki Kobayashi

, Benjamin C. Pierce:
Information and Computation special issue from TACS 2001. 163-164 - Andrew M. Pitts

:
Nominal logic, a first order theory of names and binding. 165-193 - Luís Caires, Luca Cardelli

:
A spatial logic for concurrency (part I). 194-235 - Mizuhito Ogawa:

A linear time algorithm for monadic querying of indefinite data over linearly ordered domains. 236-259 - Philip Wadler:

The Girard-Reynolds isomorphism. 260-284 - Marcello M. Bonsangue

, Joost N. Kok:
Infinite intersection types. 285-318 - Joachim Niehren, Tim Priesnitz:

Non-structural subtype entailment in automata theory. 319-354 - Javier Esparza

, Antonín Kucera
, Stefan Schwoon:
Model checking LTL with regular valuations for pushdown systems. 355-376

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














