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=Theory of Computing Systems AND YEAR=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A Kleene theorem for weighted tree automata
Manfred Droste
,
Christian Pech
,
Heiko Vogler
Theory of Computing Systems
38
(1), 2005, pp. 1-38
Decidable first-order theories of one-step rewriting in trace monoids
Dietrich Kuske
,
Markus Lohrey
Theory of Computing Systems
38
(1), 2005, pp. 39-81
NP
-partitions over posets with an application to reducing the set of solutions of
NP
problems
Sven Kosub
Theory of Computing Systems
38
(1), 2005, pp. 83-113
A simple optimal solution for the temporal precedence problem on pure pointer machines
Enrico Pontelli
,
Desh Ranjan
Theory of Computing Systems
38
(1), 2005, pp. 115-130
Complete classifications for the communication complexity of regular languages
Pascal Tesson
,
Denis Thérien
Theory of Computing Systems
38
(2), 2005, pp. 135-159
Commutation with ternary sets of words
Juhani Karhumäki
,
Michel Latteux
,
Ion Petre
Theory of Computing Systems
38
(2), 2005, pp. 161-169
The complexity of resolution with generalized symmetry rules
Stefan Szeider
Theory of Computing Systems
38
(2), 2005, pp. 171-188
Effective Jordan decomposition
Xizhong Zheng
,
Robert Rettinger
Theory of Computing Systems
38
(2), 2005, pp. 189-209
Some results on derandomization
Harry Buhrman
,
Lance Fortnow
,
A. Pavan
Theory of Computing Systems
38
(2), 2005, pp. 211-227
Space efficient hash tables with worst case constant access time
Dimitris Fotakis
,
Rasmus Pagh
,
Peter Sanders
,
Paul Spirakis
Theory of Computing Systems
38
(2), 2005, pp. 229-248
Bounded-degree independent sets in planar graphs
Therese Biedl
,
Dana F. Wilkinson
Theory of Computing Systems
38
(3), 2005, pp. 253-278
The clique problem in intersection graphs of ellipses and triangles
Christoph Ambühl
,
Uli Wagner
Theory of Computing Systems
38
(3), 2005, pp. 279-292
Crossing minimization for symmetries
Christoph Buchheim
,
Seok-Hee Hong
Theory of Computing Systems
38
(3), 2005, pp. 293-311
Simultaneous embedding of a planar graph and its dual on the grid
Cesim Erten
,
Stephen G. Kobourov
Theory of Computing Systems
38
(3), 2005, pp. 313-327
Approximating MIN 2-SAT and MIN 3-SAT
Adi Avidor
,
Uri Zwick
Theory of Computing Systems
38
(3), 2005, pp. 329-345
Probabilistic algorithms for the wake-up problem in single-hop radio networks
Tomasz Jurdziński
,
Grzegorz Stachowiak
Theory of Computing Systems
38
(3), 2005, pp. 347-367
Graph-modeled data clustering: Fixed-parameter algorithms for clique generation
Jens Gramm
,
Jiong Guo
,
Falk Hüffner
,
Rolf Niedermeier
Theory of Computing Systems
38
(4), 2005, pp. 373-392
Unlocking the advantages of dynamic service selection and pricing
Bala Kalyanasundaram
,
Mahe Velauthapillai
,
John Waclawsky
Theory of Computing Systems
38
(4), 2005, pp. 393-410
Efficient update strategies for geometric computing with uncertainty
Richard Bruce
,
Michael Hoffmann
,
Danny Krizanc
,
Rajeev Raman
Theory of Computing Systems
38
(4), 2005, pp. 411-423
The impact of network structure on the stability of greedy protocols
Dimitrios Koukopoulos
,
Marios Mavronicolas
,
Sotiris Nikoletseas
,
Paul Spirakis
Theory of Computing Systems
38
(4), 2005, pp. 425-460
On-line stream merging with max span and min coverage
Wun-Tat Chan
,
Tak-Wah Lam
,
Hing-Fung Ting
,
Prudence W.H. Wong
Theory of Computing Systems
38
(4), 2005, pp. 461-479
XOR-based schemes for fast parallel IP lookups
Giancarlo Bongiovanni
,
Paolo Penna
Theory of Computing Systems
38
(4), 2005, pp. 481-501
Efficient data storage in large nanoarrays
Lee-Ad J. Gottlieb
,
John E. Savage
,
Arkady Yerukhimovich
Theory of Computing Systems
38
(4), 2005, pp. 503-536
The effect of synchronicity on the behavior of autonomous mobile robots
Giuseppe Prencipe
Theory of Computing Systems
38
(5), 2005, pp. 539-558
Correspondence principles for effective dimensions
John M. Hitchcock
Theory of Computing Systems
38
(5), 2005, pp. 559-571
Seiten 1
2
>