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=411
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Covering the edges of bipartite graphs using
K_{2,2}
graphs
Dorit S. Hochbaum
,
Asaf Levin
Theoretical Computer Science
411
(1), 2010, pp. 1-9
NP
-hard and linear variants of hypergraph partitioning
Laurent Lyaudet
Theoretical Computer Science
411
(1), 2010, pp. 10-21
Theory of one-tape linear-time turing machines
Kohtaro Tadaki
,
Tomoyuki Yamakami
,
Jack C.H. Lin
Theoretical Computer Science
411
(1), 2010, pp. 22-43
Maximizing the minimum load for selfish agents
Leah Epstein
,
Rob van Stee
Theoretical Computer Science
411
(1), 2010, pp. 44-57
Narrowing power vs. efficiency in synchronous set agreement: Relationship, algorithms and lower bound
Achour Mostéfaoui
,
Michel Raynal
,
Corentin Travers
Theoretical Computer Science
411
(1), 2010, pp. 58-69
A graph theoretic approach to general Euler diagram drawing
Gem Stapleton
,
John Howse
,
Peter Rodgers
Theoretical Computer Science
411
(1), 2010, pp. 91-112
Stationary algorithmic probability
Markus Müller
Theoretical Computer Science
411
(1), 2010, pp. 113-130
Three results on frequency assignment in linear cellular networks
Marek Chrobak
,
Jiȓí Sgall
Theoretical Computer Science
411
(1), 2010, pp. 131-137
Maximal width learning of binary functions
Martin Anthony
,
Joel Ratsaby
Theoretical Computer Science
411
(1), 2010, pp. 138-147
The relevant prefixes of coloured Motzkin walks: An average case analysis
D. Merlini
,
R. Sprugnoli
Theoretical Computer Science
411
(1), 2010, pp. 148-163
New algorithms for approximate Nash equilibria in bimatrix games
Hartwig Bosse
,
Jaroslaw Byrka
,
Evangelos Markakis
Theoretical Computer Science
411
(1), 2010, pp. 164-173
Mechanism design for set cover games with selfish element agents
Xiang-Yang Li
,
Zheng Sun
,
WeiZhao Wang
,
Xiaowen Chu
,
ShaoJie Tang
,
Ping Xu
Theoretical Computer Science
411
(1), 2010, pp. 174-187
Maximum likelihood analysis of algorithms and data structures
Ulrich Laube
,
Markus E. Nebel
Theoretical Computer Science
411
(1), 2010, pp. 188-212
Variations on a theme by Akl and Taylor: Security and tradeoffs
Paolo D'Arco
,
Alfredo De Santis
,
Anna Lisa Ferrara
,
Barbara Masucci
Theoretical Computer Science
411
(1), 2010, pp. 213-227
Compositions of maximal codes
Yun Liu
Theoretical Computer Science
411
(1), 2010, pp. 228-238
Priority algorithms for graph optimization problems
Allan Borodin
,
Joan Boyar
,
Kim S. Larsen
,
Nazanin Mirmohammadi
Theoretical Computer Science
411
(1), 2010, pp. 239-258
Itineraries of rigid rotations and diffeomorphisms of the circle
David Richeson
,
Paul Winkler
,
Jim Wiseman
Theoretical Computer Science
411
(1), 2010, pp. 259-265
Simulation of one-way cellular automata by Boolean circuits
Véronique Terrier
Theoretical Computer Science
411
(1), 2010, pp. 266-276
On Lazy Bin Covering and Packing Problems
Mingen Lin
,
Yang Yang
,
Jinhui Xu
Theoretical Computer Science
411
(1), 2010, pp. 277-284
A comprehensive analysis of degree based condition for Hamiltonian cycles
Md. Kamrul Hasan
,
Mohammad Kaykobad
,
Young-Koo Lee
,
Sungyoung Lee
Theoretical Computer Science
411
(1), 2010, pp. 285-287
Fixed points of the RSA encryption algorithm
Andrzej Chmielowiec
Theoretical Computer Science
411
(1), 2010, pp. 288-292
Path auctions with multiple edge ownership
Ye Du
,
Rahul Sami
,
Yaoyun Shi
Theoretical Computer Science
411
(1), 2010, pp. 293-300
On the complexities of consistency checking for restricted UML class diagrams
Ken Kaneiwa
,
Ken Satoh
Theoretical Computer Science
411
(2), 2010, pp. 301-323
CPS-translation as adjoint
Ken-etsu Fujita
Theoretical Computer Science
411
(2), 2010, pp. 324-340
A Mezei-Wright theorem for categorical algebras
S.L. Bloom
,
Z. Ésik
Theoretical Computer Science
411
(2), 2010, pp. 341-359
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>