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
[1]
Hilfe
Suche: Journal=Inf.~Comput. AND YEAR=1996
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Aperiodic languages in concurrency monoids
Manfred Droste
Information and Computation
126
(2), 1996, pp. 105-113
Lower bounds on learning decision lists and trees
Thomas Hancock
,
Tao Jiang
,
Ming Li
,
John Tromp
Information and Computation
126
(2), 1996, pp. 114-122
The Barendregt cube with definitions and generalized reduction
Roel Bloo
,
Fairouz Kamareddine
,
Rob Nederpelt
Information and Computation
126
(2), 1996, pp. 123-143
Combining decision algorithms for matching in the union of disjoint equational theories
Christophe Ringeissen
Information and Computation
126
(2), 1996, pp. 144-160
Sensitive functions and approximate problems
Shiva Chaudhuri
Information and Computation
126
(2), 1996, pp. 161-168
Complexity of generalized satisfiability counting problems
Nadia Creignou
,
Miki Hermann
Information and Computation
125
(1), 1996, pp. 1-12
Completeness and weak completeness under polynomial-size circuits
David W. Juedes
,
Jack H. Lutz
Information and Computation
125
(1), 1996, pp. 13-31
Monadic second-order logic over rectangular pictures and recognizability by tiling systems
Dora Giammarresi
,
Antonio Restivo
,
Sebastian Seibert
,
Wolfgang Thomas
Information and Computation
125
(1), 1996, pp. 32-45
The undecidability of second order multiplicative linear logic
Yves Lafont
,
Andre Scedrov
Information and Computation
125
(1), 1996, pp. 46-51
Scheduling jobs using common resources
Judit Bar-Ilan
,
David Peleg
Information and Computation
125
(1), 1996, pp. 52-61
Branching-time temporal logic and tree automata
Orna Kupferman
,
Orna Grumberg
Information and Computation
125
(1), 1996, pp. 62-69
On random hard sets for NP
Ronald V. Book
,
Osamu Watanabe
Information and Computation
125
(1), 1996, pp. 70-76
A theory of primitive objects: Untyped and first-order systems
Martín Abadi
,
Luca Cardelli
Information and Computation
125
(2), 1996, pp. 78-102
A symmetric lambda calculus for classical program extraction
Franco Barbanera
,
Stefano Berardi
Information and Computation
125
(2), 1996, pp. 103-117
Comparing syntactic and semantic action refinement
Ursula Goltz
,
Roberto Gorrieri
,
Arend Rensink
Information and Computation
125
(2), 1996, pp. 118-143
Normal proofs and their grammar
Masako Takahashi
,
Yohji Akama
,
Sachio Hirokawa
Information and Computation
125
(2), 1996, pp. 144-153
Proof lengths for equational completion
David A. Plaisted
,
Andrea Sattler-Klein
Information and Computation
125
(2), 1996, pp. 154-170
PP is closed under truth-table reductions
Lance Fortnow
,
Nick Reingold
Information and Computation
124
(1), 1996, pp. 1-6
Computability on dl-domains
Andreas Gruchalski
Information and Computation
124
(1), 1996, pp. 7-19
Unreliabable channels are easier to verify than perfect channels
Gérard Cécé
,
Alain Finkel
,
S. Purushothaman Iyer
Information and Computation
124
(1), 1996, pp. 20-31
A typed pattern calculus
Delia Kesner
,
Laurence Puel
,
Val Tannen
Information and Computation
124
(1), 1996, pp. 32-61
A decomposition theorem for domains
Christian Haack
Information and Computation
124
(1), 1996, pp. 62-67
Time/contention trade-offs for multiprocessor synchronization
James H. Anderson
,
Jae-Heon Yang
Information and Computation
124
(1), 1996, pp. 68-84
On the power of higher-order algebraic specification methods
P. Kosiuczenko
,
K. Meinke
Information and Computation
124
(1), 1996, pp. 85-101
Proving congruence of bisimulation in functional programming languages
Douglas J. Howe
Information and Computation
124
(2), 1996, pp. 103-112
Seiten
<
1
2
3
4
>