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 YEAR=2004
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The query complexity of order-finding
Richard Cleve
Information and Computation
192
(2), 2004, pp. 162-171
The language intersection problem for non-recursive context-free grammars
Mark-Jan Nederhof
,
Giorgio Satta
Information and Computation
192
(2), 2004, pp. 172-184
Learning all subfunctions of a function
Sanjay Jain
,
Efim Kinber
,
Rolf Wiehagen
Information and Computation
192
(2), 2004, pp. 185-215
Reasoning about common knowledge with infinitely many agents
Joseph Y. Halpern
,
Richard A. Shore
Information and Computation
191
(1), 2004, pp. 1-40
Higher-order subtyping and its decidability
Adriana Compagnoni
Information and Computation
191
(1), 2004, pp. 41-103
Bisimulation on speed: Worst-case efficiency
Gerald Lüttgen
,
Walter Vogler
Information and Computation
191
(2), 2004, pp. 105-144
Strong normalisation in the
\pi
-calculus
Nobuko Yoshida
,
Martin Berger
,
Kohei Honda
Information and Computation
191
(2), 2004, pp. 145-202
Nested semantics over finite trees are equationally hard
Luca Aceto
,
Wan Fokkink
,
Rob van Glabbeek
,
Anna Ingólfsdóttir
Information and Computation
191
(2), 2004, pp. 203-232
Average-case intractability vs. worst-case intractability
Johannes Köbler
,
Rainer Schuler
Information and Computation
190
(1), 2004, pp. 1-17
Process semantics of general inhibitor nets
H.C.M. Kleijn
,
M. Koutny
Information and Computation
190
(1), 2004, pp. 18-69
Bounds for the DOL language equivalence problem
Juha Honkala
Information and Computation
190
(1), 2004, pp. 70-80
Classes with easily learnable subclasses
Sanjay Jain
,
Wolfram Menzel
,
Frank Stephan
Information and Computation
190
(1), 2004, pp. 81-99
The submatrices character count problem: An efficient solution using separable values
Amihood Amir
,
Kenneth W. Church
,
Emanuel Dar
Information and Computation
190
(1), 2004, pp. 100-116
Tight bounds for FEC-based reliable multicast
Hagit Attiya
,
Hadas Shachnai
Information and Computation
190
(2), 2004, pp. 117-135
Models for name-passing processes: Interleaving and causal
Gian Luca Cattani
,
Peter Sewell
Information and Computation
190
(2), 2004, pp. 136-178
Automata theory based on quantum logic: Some characterizations
Daowen Qiu
Information and Computation
190
(2), 2004, pp. 179-195
The most nonelementary theory
Sergei Vorobyov
Information and Computation
190
(2), 2004, pp. 196-219
Combinatorial sharpness criterion and phase transition classification for Random CSPs
Nadia Creignou
,
Hervé Daudé
Information and Computation
190
(2), 2004, pp. 220-238
Counting and sampling
H
-colourings
Martin Dyer
,
Leslie Ann Goldberg
,
Mark Jerrum
Information and Computation
189
(1), 2004, pp. 1-16
Intersection types for explicit substitutions
Stéphane Lengrand
,
Pierre Lescanne
,
Dan Dougherty
,
Mariangiola Dezani-Ciancaglini
,
Steffen van Bakel
Information and Computation
189
(1), 2004, pp. 17-42
Sensitivity, block sensitivity, and
l
-block sensitivity of Boolean functions
Claire Kenyon
,
Samuel Kutin
Information and Computation
189
(1), 2004, pp. 43-53
Type inference for record concatenation and subtyping
Jens Palsberg
,
Tian Zhao
Information and Computation
189
(1), 2004, pp. 54-86
Parametric parameter passing
\lambda
-calculus
Luca Paolini
,
Simona Ronchi Della Rocca
Information and Computation
189
(1), 2004, pp. 87-106
On the strength of comparisons in property testing
Eldar Fischer
Information and Computation
189
(1), 2004, pp. 107-116
The complexity of planarity testing
Eric Allender
,
Meena Mahajan
Information and Computation
189
(1), 2004, pp. 117-134
Seiten
<
1
2
3
>