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: Series=Proceedings in Informatics AND YEAR=2000
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the distribution of the number of roots of polynomials and explicit logspace extractors
T. Hartmam
,
R. Raz
Proceedings in Informatics
8
, 2000, pp. 3-22
Optimal approximation of uniform distributions with a biased coin
Ferdinando Cicalese
,
Luisa Gargano
,
Ugo Vaccaro
Proceedings in Informatics
8
, 2000, pp. 23-37
Derandomization of a parallel randomized algorithm for finding a maximal independent set in a linear hypergraph
Edyta Szymańska
Proceedings in Informatics
8
, 2000, pp. 39-52
Dispersing hash functions
Rasmus Pagh
Proceedings in Informatics
8
, 2000, pp. 53-67
Worst-case time bounds for MAX-
k
-SAT w.r.t. the number of variables using local search
Edward A. Hirsch
Proceedings in Informatics
8
, 2000, pp. 69-76
On pseudorandomness with respect to deterministic observers
O. Goldreich
,
A. Wigderson
Proceedings in Informatics
8
, 2000, pp. 77-84
Two-coloring random hypergraphs
Dimitris Achlioptas
,
Jeong Han Kim
,
Michael Krivelevich
,
Prasad Tetali
Proceedings in Informatics
8
, 2000, pp. 85-96
Routing trees for random graphs
C. Àlvarez
,
R. Cases
,
J. Díaz
,
J. Petit
,
M. Serna
Proceedings in Informatics
8
, 2000, pp. 99-110
Experimental evaluation of approximation algorithms for the minimum cost multiple-source unsplittable flow problem
Yasuhito Asano
Proceedings in Informatics
8
, 2000, pp. 111-121
A note on parallel read operations on large public databases
Giancarlo Bongiovanni
,
Andrea E.F. Clementi
,
Paolo Penna
Proceedings in Informatics
8
, 2000, pp. 123-133
Conversion of coloring algorithms into maximum weight independent set algorithms
T. Erlebach
,
K. Jansen
Proceedings in Informatics
8
, 2000, pp. 135-145
Distributive online channel assignment for hexagonal cellular networks with constraints
Shannon Fitzpatrick
,
Jeannette Janssen
,
Richard Nowakowski
Proceedings in Informatics
8
, 2000, pp. 147-154
Coloring circular arcs with applications to WDM routing
L. Gargano
,
A.A. Rescigno
Proceedings in Informatics
8
, 2000, pp. 155-166
The complexity of base station positioning in cellular networks
Christian Glasser
,
Steffen Reith
,
Heribert Vollmer
Proceedings in Informatics
8
, 2000, pp. 167-177
Parallel machine scheduling problems with controllable processing times
Klaus Jansen
,
M. Mastrolilli
Proceedings in Informatics
8
, 2000, pp. 179-189
Efficient automatic simulation of parallel computation on network of workstations
Christos Kaklamanis
,
Danny Krizanc
,
Manuela Montangero
,
Pino Persiano
Proceedings in Informatics
8
, 2000, pp. 191-201
Wavelength routing of uniform instances in optical rings
L. Narayanan
,
J. Opatrny
Proceedings in Informatics
8
, 2000, pp. 203-213
Efficient communication establishment in adverse communication environments
S. Nikoletseas
,
P. Spirakis
Proceedings in Informatics
8
, 2000, pp. 215-226
On complexity of regular
(1,+k)
-branching programs
Farid Ablayev
Proceedings in Informatics
8
, 2000, pp. 229-240
Quantum communication complexity
Hartmut Klauck
Proceedings in Informatics
8
, 2000, pp. 241-252
On the Shannon function for partially defined Boolean functions
Peter Bro Miltersen
Proceedings in Informatics
8
, 2000, pp. 253-257
Restricted branching programs with parity-type augmentations - Lower bonds and algorithms
Detlef Sieling
Proceedings in Informatics
8
, 2000, pp. 259-262
Intersection types and properties of lambda terms
Mariangiola Dezani-Ciancaglini
Proceedings in Informatics
8
, 2000, pp. 267-267
An intrinsic semantics of intersection types
John C. Reynolds
Proceedings in Informatics
8
, 2000, pp. 269-269
Conjunctive types and useless-code elimination
F. Damiani
Proceedings in Informatics
8
, 2000, pp. 271-285
Seiten 1
2
3
>