Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Inf.~Comput. AND Volume=117
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A structural induction theorem for processes
R.P. Kurshan
,
K.L. McMillan
Information and Computation
117
(1), 1995, February, pp. 1-11
Resolution for quantified Boolean formulas
Hans Kleine Büning
,
Marek Karpinski
,
Andreas Flögel
Information and Computation
117
(1), 1995, February, pp. 12-18
On the power of the shift instruction
Amir M. Ben-Amram
,
Zvi Galil
Information and Computation
117
(1), 1995, February, pp. 19-36
Safety by uninterpreted locks
Georg Lausen
,
Eljas Soisalon-Soininen
Information and Computation
117
(1), 1995, February, pp. 37-49
On non-preemptive scheduling of recurring tasks using inserted idle times
Rodney R. Howell
,
Muralidhar K. Venkatrao
Information and Computation
117
(1), 1995, February, pp. 50-62
Node replacement graph languages squeezed with chains, trees, and forests
Changwook Kim
,
Dong Hoon Lee
Information and Computation
117
(1), 1995, February, pp. 63-77
Multiple matching of rectangular patterns
Ramana M. Idury
,
Alejandro A. Schäffer
Information and Computation
117
(1), 1995, February, pp. 78-90
A single recursive predicate is sufficient for pure Datalog
Oded Shmueli
Information and Computation
117
(1), 1995, February, pp. 91-97
A trace semantics for Petri nets
P.W. Hoogers
,
H.C.M. Kleijn
,
P.S. Thiagarajan
Information and Computation
117
(1), 1995, February, pp. 98-114
A calculus for overloaded functions with subtyping
Giuseppe Castagna
,
Giorgio Ghelli
,
Giuseppe Longo
Information and Computation
117
(1), 1995, February, pp. 115-135
Suprema of open and closed formulas and their application to resolution
Marco Bellia
,
M. Eugenia Occhiuto
Information and Computation
117
(1), 1995, February, pp. 136-150
A subexponential randomized algorithm for the simple stochastic game problem
Walter Ludwig
Information and Computation
117
(1), 1995, February, pp. 151-155
On the expressiveness of temporal logic programming
Marianne Baudinet
Information and Computation
117
(2), 1995, March, pp. 157-180
A Markovian extension of Valiant's learning model
David Aldous
,
Umesh Vazirani
Information and Computation
117
(2), 1995, March, pp. 181-186
The light bulb problem
Ramamohan Paturi
,
Sanguthevar Rajasekaran
,
John Reif
Information and Computation
117
(2), 1995, March, pp. 187-192
On deciding readiness and failure equivalences for processes
Dung T. Huynh
,
Lu Tian
Information and Computation
117
(2), 1995, March, pp. 193-205
Embedding a second-order type system into an intersection type system
Hirofumi Yokouchi
Information and Computation
117
(2), 1995, March, pp. 206-220
A process algebra for timed systems
Matthew Hennessy
,
Tim Regan
Information and Computation
117
(2), 1995, March, pp. 221-239
Learning by distances
Shai Ben-David
,
Alon Itai
,
Eyal Kushilevitz
Information and Computation
117
(2), 1995, March, pp. 240-250
A Kleene theorem for a class of planar acyclic graphs
Francis Bossut
,
Max Dauchet
,
Bruno Warin
Information and Computation
117
(2), 1995, March, pp. 251-265
The parallel complexity of propagation in boolean circuits
Ashok Subramanian
Information and Computation
117
(2), 1995, March, pp. 266-275
On the sample complexity of weak learning
Sally A. Goldman
,
Michael J. Kearns
,
Robert E. Schapire
Information and Computation
117
(2), 1995, March, pp. 276-287