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=Theor.~Comput.~Sci. AND Volume=384
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Learning juntas in the presence of noise
Jan Arpe
,
RĂ¼diger Reischuk
Theoretical Computer Science
384
(1), 2007, pp. 2-21
Valiant's Holant Theorem and matchgate tensors
Jin-Yi Cai
,
Vinay Choudhary
Theoretical Computer Science
384
(1), 2007, pp. 22-32
On universal prediction and Bayesian confirmation
Marcus Hutter
Theoretical Computer Science
384
(1), 2007, pp. 33-48
Invertible classes
Sanjay Jain
,
Jochen Nessel
,
Frank Stephan
Theoretical Computer Science
384
(1), 2007, pp. 49-65
On PAC learning algorithms for rich Boolean function classes
Lisa Hellerstein
,
Rocco A. Servedio
Theoretical Computer Science
384
(1), 2007, pp. 66-76
Non-reducible descriptions for conditional Kolmogorov complexity
Andrej Muchnik
,
Alexander Shen
,
Mikhail Ustinov
,
Nikolai Vereshchagin
,
Michael Vyugin
Theoretical Computer Science
384
(1), 2007, pp. 77-86
Block sensitivity of weakly symmetric functions
Xiaoming Sun
Theoretical Computer Science
384
(1), 2007, pp. 87-91
A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
Xuehou Tan
Theoretical Computer Science
384
(1), 2007, pp. 92-103
Width versus size in resolution proofs
Alasdair Urquhart
Theoretical Computer Science
384
(1), 2007, pp. 104-110
Computational complexity of counting problems on 3-regular planar graphs
Mingji Xia
,
Peng Zhang
,
Wenbo Zhao
Theoretical Computer Science
384
(1), 2007, pp. 111-125
A new approximation algorithm for the
k
-facility location problem
Peng Zhang
Theoretical Computer Science
384
(1), 2007, pp. 126-135
Traffic grooming on the path
Jean-Claude Bermond
,
Laurent Braud
,
David Coudert
Theoretical Computer Science
384
(2-3), 2007, pp. 139-151
A tight bound for online colouring of disk graphs
Ioannis Caragiannis
,
Aleksei V. Fishkin
,
Christos Kaklamanis
,
Evi Papaioannou
Theoretical Computer Science
384
(2-3), 2007, pp. 152-160
On the bounded-hop MST problem on random Euclidean instances
Andrea E.F. Clementi
,
Miriam Di Ianni
,
Massimo Lauria
,
Angelo Monti
,
Gianluca Rossi
,
Riccardo Silvestri
Theoretical Computer Science
384
(2-3), 2007, pp. 161-167
Two absolute bounds for distributed bit complexity
Yefim Dinitz
,
Noam Solomon
Theoretical Computer Science
384
(2-3), 2007, pp. 168-183
Communications in unknown networks: Preserving the secret of topology
Markus Hinkelmann
,
Andreas Jakoby
Theoretical Computer Science
384
(2-3), 2007, pp. 184-200
Hardness and approximation results for Black Hole Search in arbitrary networks
Ralf Klasing
,
Euripides Markou
,
Tomasz Radzik
,
Fabiano Sarracco
Theoretical Computer Science
384
(2-3), 2007, pp. 201-221
Impossibility of gathering by a set of autonomous mobile robots
Giuseppe Prencipe
Theoretical Computer Science
384
(2-3), 2007, pp. 222-231
Agreement in synchronous networks with ubiquitous faults
Nicola Santoro
,
Peter Widmayer
Theoretical Computer Science
384
(2-3), 2007, pp. 232-249
Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem
Mordechai Shalom
,
Shmuel Zaks
Theoretical Computer Science
384
(2-3), 2007, pp. 250-262
Optimal gossiping in square 2D meshes
Rui Wang
,
Francis C.M. Lau
Theoretical Computer Science
384
(2-3), 2007, pp. 263-286