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=190
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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