Volume 120, Number 1, July 1995
- Koichi Yamazaki:
A Normal Form Problem for Unlabeled Boundary NLC Graph Languages.
1-10
- Shai Ben-David, Gyora M. Benedek, Yishay Mansour:
A Parametrization Scheme for Classifying Models of PAC Learnability.
11-21
- Vwani P. Roychowdhury, Kai-Yeung Siu, Alon Orlitsky, Thomas Kailath:
Vector Analysis of Threshold Functions.
22-31
- Abbas Edalat:
Dynamical Systems, Measures and Fractals via Domain Theory.
32-48
- Ronald V. Book, Jack H. Lutz, David M. Martin Jr.:
The Global Power of Additional Queries to Random Oracles.
49-54
- Mitsunori Ogihara:
Equivalence of NC^k and AC^k-1 closures of NP and Other Classes.
55-58
- Martin Kummer, Frank Stephan:
Recursion Theoretic Properties of Frequency Computation and Bounded Queries.
59-77
- Ronald Fagin, Larry J. Stockmeyer, Moshe Y. Vardi:
On Monadic NP vs. Monadic co-NP.
78-92
- Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda:
Optimal Amortized Distributed Consensus.
93-100
- Guozhu Dong, Jianwen Su:
Incremental and Decremental Evaluation of Transitive Closure by First-Order Queries.
101-106
- Peter W. O'Hearn, Jon G. Riecke:
Kripke Logical Relations and PCF.
107-116
- Danièle Beauquier, Damian Niwinski:
Automata on Infinite Trees with Counting Constraints.
117-125
- Jean Neraud:
Algorithms for Detecting Morphic Images of a Word.
126-148
- Shih Ping Tung:
The Bounds of Skolem Functions and Their Applications.
149-154
Volume 120, Number 2, August 1, 1995
- Thomas Zeugmann, Steffen Lange, Shyam Kapur:
Characterizations of Monotonic and Dual Monotonic Language Learning.
155-173
- Joachim Parrow, Davide Sangiorgi:
Algebraic Theories for Name-Passing Calculi.
174-197
- Heribert Vollmer, Klaus W. Wagner:
Complexity Classes of Optimization Functions.
198-219
- Jan Van den Bussche, Jan Paredaens:
The Expressive Power of Complex Values in Object-Based Data Models.
220-236
- Victor Y. Pan, Isdor Sobze, Antoine Atinkpahoun:
On Parallel Computations with Banded Matrices.
237-250
- A. John Power:
Why Tricategories?
251-262
- Alessandra Di Pierro, Maurizio Martelli, Catuscia Palamidessi:
Negation as Instantiation.
263-278
- Michele Boreale, Rocco De Nicola:
Testing Equivalence for Mobile Processes.
279-303
- Richard Beigel, Martin Kummer, Frank Stephan:
Approximable Sets.
304-314
- Shih Ping Tung:
Computational Complexity of Arithmetical Sentences.
315-325
- Jonathan F. Buss, Martin Tompa:
Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five.
326-329
Last update Sat May 25 16:03:48 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
