


default search action
Information and Computation, Volume 113
Volume 113, Number 1, 1994
- Martin Beaudry:
Membership Testing in Threshold One Transformation Monoids. 1-25 - Egon Wanke:
On the Decidability of Certain Integer Subgraph Problems on Context-Free Graph Languages. 26-49 - John A. Ellis, Ivan Hal Sudborough, Jonathan S. Turner:
The Vertex Separation and Search Number of a Graph. 50-79 - Baruch Schieber, Marc Snir:
Calling Names on Nameless Networks. 80-101 - Richard Gerber, Insup Lee:
A Resource-Based Prioritized Bisimulation for Real-Time Systems. 102-142 - Evelyne Contejean, Hervé Devie:
An Efficient Incremental Algorithm for Solving Systems of Linear Diophantine Equations. 143-172
Volume 113, Number 2, 1994
- Gadi Taubenfeld, Shmuel Katz, Shlomo Moran:
Impossibility Results in the Presence of Multiple Faulty Processes. 173-198 - Andrew Chin, William F. McColl:
Virtual Shared Memory: Algorithms and Complexity. 199-219 - Andrew T. Ogielski:
Minimal Samples of Positive Examples Identifying k-CNF Boolean Functions. 220-229 - Philip M. Long, Manfred K. Warmuth:
Composite Geometric Concepts and Polynomial Predictability. 230-252 - Mitchell Wand, Zheng-Yu Wang:
Conditional Lambda-Theories and the Verification of Static Properties of Programs. 253-277 - David Harel, Danny Raz:
Deciding Emptiness for Stack Automata on Infinite Trees. 278-299 - Mark Jerrum:
Simple Translation-Invariant Concepts Are Hard to Learn. 300-311 - Yehuda Afek, Yossi Matias:
Elections in Anonymous Networks. 312-330 - Jeffrey O. Shallit:
Numeration Systems, Linear Recurrences, and Regular Sets. 331-347

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.