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=412
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Combined data structure for previous- and next-smaller-values
Johannes Fischer
Theoretical Computer Science
412
(22), 2011, pp. 2451-2456
On the red/blue spanning tree problem
Sergey Bereg
,
Minghui Jiang
,
Boting Yang
,
Binhai Zhu
Theoretical Computer Science
412
(23), 2011, pp. 2459-2467
A computational proof of complexity of some restricted counting problems
Jin-Yi Cai
,
Pinyan Lu
,
Mingji Xia
Theoretical Computer Science
412
(23), 2011, pp. 2468-2485
Co-evolution and information signals in biological sequences
A. Carbone
,
L. Dib
Theoretical Computer Science
412
(23), 2011, pp. 2486-2495
Block-graph width
Maw-Shang Chang
,
Ling-Ju Hung
,
Ton Kloks
,
Sheng-Lung Peng
Theoretical Computer Science
412
(23), 2011, pp. 2496-2502
Improved deterministic algorithms for weighted matching and packing problems
Jianer Chen
,
Qilong Feng
,
Yang Liu
,
Songjian Lu
,
Jianxin Wang
Theoretical Computer Science
412
(23), 2011, pp. 2503-2512
Parameterized complexity of coloring problems: Treewidth versus vertex cover
Jiȓí Fiala
,
Petr A. Golovach
,
Jan Kratochvíl
Theoretical Computer Science
412
(23), 2011, pp. 2513-2523
Best-order streaming model
Atish Das Sarma
,
Richard J. Lipton
,
Danupon Nanongkai
Theoretical Computer Science
412
(23), 2011, pp. 2544-2555
Sorting and selection on dynamic data
Aris Anagnostopoulos
,
Ravi Kumar
,
Mohammad Mahdian
,
Eli Upfal
Theoretical Computer Science
412
(24), 2011, pp. 2564-2576
Maximum bipartite flow in networks with adaptive channel width
Yossi Azar
,
Aleksander Ma̧dry
,
Thomas Moscibroda
,
Debmalya Panigrahi
,
Aravind Srinivasan
Theoretical Computer Science
412
(24), 2011, pp. 2577-2587
Towards optimal range medians
Gerth Stlting Brodal
,
Beat Gfeller
,
Allan Grnlund Jrgensen
,
Peter Sanders
Theoretical Computer Science
412
(24), 2011, pp. 2588-2601
Rumor spreading in social networks
Flavio Chierichetti
,
Silvio Lattanzi
,
Alessandro Panconesi
Theoretical Computer Science
412
(24), 2011, pp. 2602-2610
Partition arguments in multiparty communication complexity
Jan Draisma
,
Eyal Kushilevitz
,
Enav Weinreb
Theoretical Computer Science
412
(24), 2011, pp. 2611-2622
Tight bounds for the cover time of multiple random walks
Robert Elsässer
,
Thomas Sauerwald
Theoretical Computer Science
412
(24), 2011, pp. 2623-2641
Online computation with advice
Yuval Emek
,
Pierre Fraigniaud
,
Amos Korman
,
Adi Rosén
Theoretical Computer Science
412
(24), 2011, pp. 2642-2656
Improved algorithms for latency minimization in wireless networks
Alexander Fanghänel
,
Thomas Kesselheim
,
Berthold Vöcking
Theoretical Computer Science
412
(24), 2011, pp. 2657-2667
Succinct representation of dynamic trees
Arash Farzan
,
J. Ian Munro
Theoretical Computer Science
412
(24), 2011, pp. 2668-2678
Canonical extensions and canonicity via dcpo presentations
Mai Gehrke
,
Jacob Vosmaer
Theoretical Computer Science
412
(25), 2011, pp. 2714-2723
Logical classification of distributed algorithms (Bakery algorithms as an example)
Uri Abraham
Theoretical Computer Science
412
(25), 2011, pp. 2724-2745
Metric structures and probabilistic computation
Wesley Calvert
Theoretical Computer Science
412
(25), 2011, pp. 2766-2775
Quasi-interpretations a way to control resources
G. Bonfante
,
J.-Y. Marion
,
J.-Y. Moyen
Theoretical Computer Science
412
(25), 2011, pp. 2776-2796
An algorithmic framework for network reconstruction
Markus Durzinsky
,
Annegret Wagler
,
Robert Weismantel
Theoretical Computer Science
412
(26), 2011, pp. 2800-2815
Parameter estimation for Boolean models of biological networks
Elena Dimitrova
,
Luis David García-Puente
,
Franziska Hinkelmann
,
Abdul S. Jarrah
,
Reinhard Laubenbacher
,
Brandilyn Stigler
,
Michael Stillman
,
Paola Vera-Licona
Theoretical Computer Science
412
(26), 2011, pp. 2816-2826
Infinite permutations of lowest maximal pattern complexity
S.V. Avgustinovich
,
A. Frid
,
T. Kamae
,
P. Salimov
Theoretical Computer Science
412
(27), 2011, pp. 2911-2921
Equations on palindromes and circular words
A. Blondin Massé
,
S. Brlek
,
A. Garon
,
S. Labbé
Theoretical Computer Science
412
(27), 2011, pp. 2922-2930
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>