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=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Exploiting regularities for Boolean function synthesis
Anna Bernasconi
,
Valentina Ciriani
,
Fabrizio Luccio
,
Linda Pagli
Theory of Computing Systems
39
(4), 2006, pp. 485-501
Superposition based on Watson-Crick-like complementarity
Paolo Bottoni
,
Anna Labella
,
Vincenzo Manca
,
Victor Mitrana
Theory of Computing Systems
39
(4), 2006, pp. 503-524
Upper and lower bounds for randomized search heuristics in black-box optimization
Stefan Droste
,
Thomas Jansen
,
Ingo Wegener
Theory of Computing Systems
39
(4), 2006, pp. 525-544
Parameterized intractability of distinguishing substring selection
Jens Gramm
,
Jiong Guo
,
Rolf Niedermeier
Theory of Computing Systems
39
(4), 2006, pp. 545-560
Clique-width for 4-vertex forbidden subgraphs
Andreas Brandstädt
,
Joost Engelfriet
,
Hoàng-Oanh Le
,
Vadim V. Lozin
Theory of Computing Systems
39
(4), 2006, pp. 561-590
Energy-efficient wireless network design
Ioannis Caragiannis
,
Christos Kaklamanis
,
Panagiotis Kanellopoulos
Theory of Computing Systems
39
(5), 2006, pp. 593-617
Useful templates and iterated template-guided DNA recombination in ciliates
Mark Daley
,
Ian McQuillan
Theory of Computing Systems
39
(5), 2006, pp. 619-633
Complexity of the exact domatic number problem and of the exact conveyor flow shop problem
Tobias Riege
,
Jörg Rothe
Theory of Computing Systems
39
(5), 2006, pp. 635-668
The complexity of finding top-Toda-equivalence-class members
Lane A. Hemaspaandra
,
Mitsunori Ogihara
,
Mohammed J. Zaki
,
Marius Zimand
Theory of Computing Systems
39
(5), 2006, pp. 669-684
Selection functions that do not preserve normality
Wolfgang Merkle
,
Jan Reimann
Theory of Computing Systems
39
(5), 2006, pp. 685-697
A note on MOD
_p
- MOD
m
circuits
Howard Straubing
,
Denis Thérien
Theory of Computing Systems
39
(5), 2006, pp. 699-706
Some results on effective randomness
Wolfgang Merkle
,
Nenad Mihailović
,
Theodore A. Slaman
Theory of Computing Systems
39
(5), 2006, pp. 707-721
Generating instances for MAX2SAT with optimal solutions
Masaki Yamamoto
Theory of Computing Systems
39
(5), 2006, pp. 723-742
A special case of a unary regular language containment
B. Litow
Theory of Computing Systems
39
(5), 2006, pp. 743-751
An infinite hierarchy in a class of polynomial-time program schemes
Richard L. Gault
,
Iain A. Stewart
Theory of Computing Systems
39
(5), 2006, pp. 753-783
Simple efficient load-balancing algorithms for peer-to-peer systems
David R. Karger
,
Matthias Ruhl
Theory of Computing Systems
39
(6), 2006, pp. 787-804
On delivery times in packet networks under adversarial traffic
Adi Rosén
,
Michael S. Tsirkin
Theory of Computing Systems
39
(6), 2006, pp. 805-827
Parallelism versus memory allocation in pipelined router forwarding engines
Fan Chung
,
Ronald Graham
,
Jia Mao
,
George Varghese
Theory of Computing Systems
39
(6), 2006, pp. 829-849
Online hierarchical cooperative caching
Xiaozhou Li
,
C. Greg Plaxton
,
Mitul Tiwari
,
Arun Venkataramani
Theory of Computing Systems
39
(6), 2006, pp. 851-874
Dynamic analysis of the arrow distributed protocol
Maurice Herlihy
,
Fabian Kuhn
,
Srikanta Tirthapura
,
Roger Wattenhofer
Theory of Computing Systems
39
(6), 2006, pp. 875-901
The effect of faults on network expansion
Amitabha Bagchi
,
Ankur Bhargava
,
Amitabh Chaudhary
,
David Eppstein
,
Christian Scheideler
Theory of Computing Systems
39
(6), 2006, pp. 903-928
Balanced graph partitioning
Konstantin Andreev
,
Harald Räcke
Theory of Computing Systems
39
(6), 2006, pp. 929-939
Seiten
<
1
2