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=2001
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Probabilistic quorum systems
Dahlia Malkhi
,
Michael K. Reiter
,
Avishai Wool
,
Rebecca N. Wright
Information and Computation
170
(2), 2001, pp. 184-206
Functorial models for Petri nets
Roberto Bruni
,
José Meseguer
,
Ugo Montanari
,
Vladimiro Sassone
Information and Computation
170
(2), 2001, pp. 207-236
Dependent types with subtyping and late-bound overloading
Giuseppe Castagna
,
Gang Chen
Information and Computation
168
(1), 2001, pp. 1-67
Static analysis for the
\pi
-calculus with applications to security
Chiara Bodei
,
Pierpaolo Degano
,
Flemming Nielson
,
Hanne Riis Nielson
Information and Computation
168
(1), 2001, pp. 68-92
The complexity of the
K_{n,n}
-problem for node replacement graph languages
Konstantin Skodinis
Information and Computation
168
(2), 2001, pp. 95-112
Circuit and decision tree complexity of some number theoretic problems
Anna Bernasconi
,
Carsten Damm
,
Igor Shparlinski
Information and Computation
168
(2), 2001, pp. 113-124
Iterated function systems and control languages
Henning Fernau
,
Ludwig Staiger
Information and Computation
168
(2), 2001, pp. 125-143
On some Schützenberger conjectures
Clelia de Felice
Information and Computation
168
(2), 2001, pp. 144-155
Adding for-loops to first-order logic
Frank Neven
,
Martin Otto
,
Jurek Tyszkiewicz
,
Jan van den Bussche
Information and Computation
168
(2), 2001, pp. 156-186
Lower bounds for merging networks
Shigeki Iwata
Information and Computation
168
(2), 2001, pp. 187-195
On privacy and partition arguments
Benny Chor
,
Yuval Ishai
Information and Computation
167
(1), 2001, pp. 2-9
On weighted vs unweighted versions of combinatorial optimization problems
Pierluigi Crescenzi
,
Riccardo Silvestri
,
Luca Trevisan
Information and Computation
167
(1), 2001, pp. 10-26
On the decisional complexity of problems over the reals
Moni Naor
,
Sitvanit Ruah
Information and Computation
167
(1), 2001, pp. 27-45
Synchronization languages and rewriting systems
M. Clerbout
,
Y. Roos
,
I. Ryl
Information and Computation
167
(1), 2001, pp. 46-69
Computation of approximate polynomial GCDs and an extension
Victor Y. Pan
Information and Computation
167
(2), 2001, pp. 71-85
Reduction algorithms for graphs of small treewidth
Hans L. Bodlaender
,
Babette van Antwerpen-de Fluiter
Information and Computation
167
(2), 2001, pp. 86-119
An algebra of discrete channels that involve combinations of three basic error types
Stavros Konstantinidis
Information and Computation
167
(2), 2001, pp. 120-131
Overcoming heterogeneity and autonomy in multidatabase systems
Sharad Mehrotra
,
Rajeev Rastogi
,
Yuri Breitbart
,
Henry F. Korth
,
Abraham Silberschatz
Information and Computation
167
(2), 2001, pp. 132-172
On fairness notions in distributed systems: I. A characterization of implementability
Yuh-Jzer Joung
Information and Computation
166
(1), 2001, pp. 1-34
On fairness notions in distributed systems: II. Equivalence-completions and their hierarchies
Yuh-Jzer Joung
Information and Computation
166
(1), 2001, pp. 35-60
On the descriptive and algorithmic power of parity ordered binary decision diagrams
Stephan Waack
Information and Computation
166
(1), 2001, pp. 61-70
Commutative queries
Richard Beigel
,
Richard Chang
Information and Computation
166
(1), 2001, pp. 71-91
Star-free sets of words on ordinals
Nicolas Bedon
Information and Computation
166
(2), 2001, pp. 93-111
Languages defined with modular counting quantifiers
Howard Straubing
Information and Computation
166
(2), 2001, pp. 112-132
Improved lower bounds for learning from noisy examples: An information-theoretic approach
Claudio Gentile
,
David P. Helmbold
Information and Computation
166
(2), 2001, pp. 133-155
Seiten
<
1
2
3
>