


default search action
Information and Computation, Volume 123
Volume 123, Number 1, November 15, 1995
- Ryszard Janicki, Maciej Koutny:
Semantics of Inhibitor Nets. 1-16 - Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener:
Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. 17-28 - Martin Farach
, Mikkel Thorup:
Fast Comparison of Evolutionary Trees. 29-37 - Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows
:
On the Structure of Parameterized Problems in NP. 38-49 - Jan C. Bioch, Toshihide Ibaraki:
Complexity of Identification and Dualization of Positive Boolean Functions. 50-63 - Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the Intrinsic Complexity of Learning. 64-71 - Hannah Bast, Torben Hagerup:
Fast Parallel Space Allocation, Estimation and Integer Sorting. 72-110 - Fabrizio Luccio, Linda Pagli
:
Approximate Matching for Two Families of Trees. 111-120 - Lance Fortnow, Sophie Laplante:
Circuit Lower Bounds à la Kolmogorov. 121-126 - Omer Berkman, Costas S. Iliopoulos, Kunsoo Park:
The Subtree Max Gap Problem with Application to Parallel String Covering. 127-137 - Yuji Takada:
A Hierarchy of Language Families Learnable by Regular Language Learning. 138-145 - Nader H. Bshouty:
Exact Learning Boolean Function via the Monotone Theory. 146-153
Volume 123, Number 2, 1995
- Hagit Attiya
, Shlomi Dolev
, Jennifer L. Welch:
Connection Management Without Retaining Information. 155-171 - Anuj Dawar
, Lauri Hella
:
The expressive Power of Finitely Many Generalized Quantifiers. 172-184 - Bernd Becker
, Rolf Drechsler
, Ralph Werchner:
On the Relation between BDDs and FDDs. 185-197 - Jens Palsberg:
Efficient Inference of Object Types. 198-209 - David Peleg, Avishai Wool
:
The Availability of Quorum Systems. 210-223 - Efim B. Kinber, Frank Stephan
:
Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity. 224-241

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.