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=110
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Polylog depth circuits for integer factoring and discrete logarithms
Jonathan Sorenson
Information and Computation
110
(1), 1994, April, pp. 1-18
Finding compact scheme forests in nested normal form is NP-hard
P. Thanisch
,
G. Loizou
,
J. Nummenmaa
Information and Computation
110
(1), 1994, April, pp. 19-41
Stable semantics for probabilistic deductive databases
Raymond Ng
,
V.S. Subrahmanian
Information and Computation
110
(1), 1994, April, pp. 42-83
On learning monotone DNF formulae under uniform distributions
Ludek Kucera
,
Alberto Marchetti-Spaccamela
,
Marco Protasi
Information and Computation
110
(1), 1994, April, pp. 84-95
Parallel random access machines with both multiplication and shifts
Jerry L. Trahan
,
Vijaya Ramachandran
,
Michael C. Loui
Information and Computation
110
(1), 1994, April, pp. 96-118
Immunity of complete problems
Steven Homer
,
Jie Wang
Information and Computation
110
(1), 1994, April, pp. 119-129
Concatenable structures for decomposable problems
Marc J. van Kreveld
,
Mark H. Overmars
Information and Computation
110
(1), 1994, April, pp. 130-148
Characteristic formulae for processes with divergence
Bernhard Steffen
,
Anna Ingólfsdóttir
Information and Computation
110
(1), 1994, April, pp. 149-163
On confluent semi-commutations: Decidability and complexity results
Volker Diekert
,
Edward Ochmański
,
Klaus Reinhardt
Information and Computation
110
(1), 1994, April, pp. 164-182
Time bounds for real time process control in the presence of timing uncertainty
Hagit Attiya
,
Nancy A. Lynch
Information and Computation
110
(1), 1994, April, pp. 183-232
A representation of
SFP
Guo-Qiang Zhang
Information and Computation
110
(1), 1994, April, pp. 233-263
Sequentiality in an extensional framework
Antonio Bucciarelli
,
Thomas Ehrhard
Information and Computation
110
(2), 1994, May, pp. 265-296
An analysis of Ramsey's theorem
Thierry Coquand
Information and Computation
110
(2), 1994, May, pp. 297-304
A partial approach to model checking
Patrice Godefroid
,
Pierre Wolper
Information and Computation
110
(2), 1994, May, pp. 305-326
Logic programming in a fragment of intuitionistic linear logic
Joshua S. Hodas
,
Dale Miller
Information and Computation
110
(2), 1994, May, pp. 327-365
A completeness theorem for Kleene algebras and the algebra of regular events
Dexter Kozen
Information and Computation
110
(2), 1994, May, pp. 366-390
A foundational delineation of poly-time
Daniel Leivant
Information and Computation
110
(2), 1994, May, pp. 391-420