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 YEAR=2010
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Learning and generalization with the information bottleneck
Ohad Shamir
,
Sivan Sabato
,
Naftali Tishby
Theoretical Computer Science
411
(29-30), 2010, pp. 2696-2711
Active learning in heteroscedastic noise
András Antos
,
Varun Grover
,
Csaba Szepesvári
Theoretical Computer Science
411
(29-30), 2010, pp. 2712-2728
Optimally learning social networks with activations and suppressions
Dana Angluin
,
James Aspnes
,
Lev Reyzin
Theoretical Computer Science
411
(29-30), 2010, pp. 2729-2740
Iterative learning of simple external contextual languages
Leonor Becerra-Bonache
,
John Case
,
Sanjay Jain
,
Frank Stephan
Theoretical Computer Science
411
(29-30), 2010, pp. 2741-2756
Incremental learning with temporary memory
Sanjay Jain
,
Steffen Lange
,
Samuel E. Moelius III
,
Sandra Zilles
Theoretical Computer Science
411
(29-30), 2010, pp. 2757-2772
Approximability and inapproximability of the minimum certificate dispersal problem
Tomoko Izumi
,
Taisuke Izumi
,
Hirotaka Ono
,
Koichi Wada
Theoretical Computer Science
411
(31-33), 2010, pp. 2773-2783
Efficient frequent connected subgraph mining in graphs of bounded tree-width
Tamás̑ Horváth
,
Jan Ramon
Theoretical Computer Science
411
(31-33), 2010, pp. 2784-2797
Window-games between TCP flows
Pavlos S. Efraimidis
,
Lazaros Tsavlidis
,
George B. Mertzios
Theoretical Computer Science
411
(31-33), 2010, pp. 2798-2817
Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems
Jiao-fen Li
,
Xi-yan Hu
,
Lei Zhang
Theoretical Computer Science
411
(31-33), 2010, pp. 2818-2826
Factors of characteristic words: Location and decompositions
Wai-Fong Chuan
,
Hui-Ling Ho
Theoretical Computer Science
411
(31-33), 2010, pp. 2827-2846
Cooperative TSP
Amitai Armon
,
Adi Avidor
,
Oded Schwartz
Theoretical Computer Science
411
(31-33), 2010, pp. 2847-2863
An upper bound for the circuit complexity of existentially quantified Boolean formulas
H. Kleine Büning
,
A. Remshagen
Theoretical Computer Science
411
(31-33), 2010, pp. 2864-2870
The bridge-connectivity augmentation problem with a partition constraint
Yen-Chiu Chen
,
Hsin-Wen Wei
,
Pei-Chi Huang
,
Wei-Kuan Shih
,
Tsan-sheng Hsu
Theoretical Computer Science
411
(31-33), 2010, pp. 2878-2889
Online scheduling with reassignment on two uniform machines
Qian Cao
,
Zhaohui Liu
Theoretical Computer Science
411
(31-33), 2010, pp. 2890-2898
Two-dimensional online bin packing with rotation
Leah Epstein
Theoretical Computer Science
411
(31-33), 2010, pp. 2899-2911
A class of hierarchical graphs as topologies for interconnection networks
Pao-Lien Lai
,
Hong-Chun Hsu
,
Chang-Hsiung Tsai
,
Iain A. Stewart
Theoretical Computer Science
411
(31-33), 2010, pp. 2912-2924
Move-to-Front, Distance Coding, and Inversion Frequencies revisited
Travis Gagie
,
Giovanni Manzini
Theoretical Computer Science
411
(31-33), 2010, pp. 2925-2944
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
Samuel Alexandre Vidal
Theoretical Computer Science
411
(31-33), 2010, pp. 2945-2967
Exact leaf powers
Andreas Brandstädt
,
Van Bang Le
,
Dieter Rautenbach
Theoretical Computer Science
411
(31-33), 2010, pp. 2968-2977
A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
Q.Q. Nong
,
T.C.E. Cheng
,
C.T. Ng
Theoretical Computer Science
411
(31-33), 2010, pp. 2978-2986
Succinctness of regular expressions with interleaving, intersection and counting
Wouter Gelade
Theoretical Computer Science
411
(31-33), 2010, pp. 2987-2998
Erratum to ``Entropy of Turing machines with moving head''
Petr Kůrka
Theoretical Computer Science
411
(31-33), 2010, pp. 2999-3000
An efficient counting network
Costas Busch
,
Marios Mavronicolas
Theoretical Computer Science
411
(34-36), 2010, pp. 3001-3030
Continuous consensus with ambiguous failures
Tal Mizrahi
,
Yoram Moses
Theoretical Computer Science
411
(34-36), 2010, pp. 3031-3041
The frequent items problem, under polynomial decay, in the streaming model
Guy Feigenblat
,
Ofra Itzhaki
,
Ely Porat
Theoretical Computer Science
411
(34-36), 2010, pp. 3048-3054
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>