default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 117
Volume 117, Number 1, 1995
- Robert P. Kurshan, Kenneth L. McMillan:
A Structural Induction Theorem for Processes. 1-11 - Hans Kleine Büning, Marek Karpinski, Andreas Flögel:
Resolution for Quantified Boolean Formulas. 12-18 - Amir M. Ben-Amram, Zvi Galil:
On the Power of the Shift Instruction. 19-36 - Georg Lausen, Eljas Soisalon-Soininen:
Safety by Uninterpreted Locks. 37-49 - Rodney R. Howell, Muralidhar K. Venkatrao:
On Non-Preemptive Scheduling of Recurring Tasks Using Inserted Idle Times. 50-62 - Changwook Kim, Dong Hoon Lee:
Node Replacement Graph Languages Squeezed with Chains, Trees, and Forests. 63-77 - Ramana M. Idury, Alejandro A. Schäffer:
Multiple Matching of Rectangular Patterns. 78-90 - Oded Shmueli:
A Single Recursive Predicate is Sufficient for Pure Datalog. 91-97 - P. W. Hoogers, H. C. M. Kleijn, P. S. Thiagarajan:
A Trace Semantics for Petri Nets. 98-114 - Giuseppe Castagna, Giorgio Ghelli
, Giuseppe Longo:
A Calculus for Overloaded Functions with Subtyping. 115-135 - Marco Bellia, M. Eugenia Occhiuto:
Suprema of Open and Closed Formulas and Their Application to Resolution. 136-150 - Walter Ludwig:
A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem. 151-155
Volume 117, Number 2, 1995
- Marianne Baudinet:
On the Expressiveness of Temporal Logic Programming. 157-180 - David J. Aldous, Umesh V. Vazirani:
A Markovian Extension of Valiant's Learning Model. 181-186 - Ramamohan Paturi, Sanguthevar Rajasekaran, John H. Reif:
The Light Bulb Problem. 187-192 - Dung T. Huynh, Lu Tian:
On Deciding Readiness and Failure Equivalences for Processes. 193-205 - Hirofumi Yokouchi:
Embedding a Second Order Type System into an Intersection Type System. 206-220 - Matthew Hennessy, Tim Regan:
A Process Algebra for Timed Systems. 221-239 - Shai Ben-David, Alon Itai, Eyal Kushilevitz:
Learning by Distances. 240-250 - Francis Bossut, Max Dauchet, Bruno Warin:
A Kleene Theorem for a Class of Planar Acyclic Graphs. 251-265 - Ashok Subramanian:
The Parallel Complexity of Propagation in Boolean Circuits. 266-275 - Sally A. Goldman, Michael J. Kearns, Robert E. Schapire:
On the Sample Complexity of Weakly Learning. 276-287
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 2025-11-27 02:53 CET 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:
