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=2014
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Competitive analysis of maintaining frequent items of a stream
Yiannis Giannakopoulos
,
Elias Koutsoupias
Theoretical Computer Science
562
, 2014, pp. 23-32
A PTAS for the Square Tiling Problem
Amihood Amir
,
Alberto Apostolico
,
Gad M. Landau
,
Ely Porat
,
Oren Sar Shalom
Theoretical Computer Science
562
, 2014, pp. 33-45
On
t
-extensions of the Hankel determinants of certain automatic sequences
Hao Fu
,
Guo-Niu Han
Theoretical Computer Science
562
, 2014, pp. 46-56
Design of fault-tolerant on-board networks with variable switch sizes
O. Delmas
,
F. Havet
,
M. Montassier
,
S. Pérennes
Theoretical Computer Science
562
, 2014, pp. 75-89
The ring design game with fair cost allocation
Angelo Fanelli
,
Dariusz Leniowski
,
Gianpiero Monaco
,
Piotr Sankowski
Theoretical Computer Science
562
, 2014, pp. 90-100
Efficient algorithms for secure outsourcing of bilinear pairings
Xiaofeng Chen
,
Willy Susilo
,
Jin Li
,
Duncan S. Wong
,
Jianfeng Ma
,
Shaohua Tang
,
Qiang Tang
Theoretical Computer Science
562
, 2014, pp. 112-121
Computing on binary strings
Tian-Ming Bu
,
Chen Yuan
,
Peng Zhang
Theoretical Computer Science
562
, 2014, pp. 122-128
Memoryless computation: New results, constructions, and extensions
Maximilien Gadouleau
,
Sren Riis
Theoretical Computer Science
562
, 2014, pp. 129-145
Exact algorithms for Kayles
Hans L. Bodlaender
,
Dieter Kratsch
,
Sjoerd T. Timmer
Theoretical Computer Science
562
, 2014, pp. 165-176
Ambiguous optimistic fair exchange: Definition and constructions
Qiong Huang
,
Guomin Yang
,
Duncan S. Wong
,
Willy Susilo
Theoretical Computer Science
562
, 2014, pp. 177-193
Dynamic algorithms for monotonic interval scheduling problem
Alexander Gavruskin
,
Bakhadyr Khoussainov
,
Mikhail Kokho
,
Jiamou Liu
Theoretical Computer Science
562
, 2014, pp. 227-242
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs
Pinar Heggernes
,
Pim van 't Hof
,
Daniel Meister
,
Yngve Villanger
Theoretical Computer Science
562
, 2014, pp. 252-269
Voronoi game on graphs
Sayan Bandyapadhyay
,
Aritra Banik
,
Sandip Das
,
Hirak Sarkar
Theoretical Computer Science
562
, 2014, pp. 270-282
Finding a subdivision of a digraph
Jrgen Bang-Jensen
,
Frédéric Havet
,
A. Karolinna Maia
Theoretical Computer Science
562
, 2014, pp. 283-303
On the commutative equivalence of bounded context-free and regular languages: The code case
Flavio D'Alessandro
,
Benedetto Intrigila
Theoretical Computer Science
562
, 2014, pp. 304-319
Combinatorics for smaller kernels: The differential of a graph
Sergio Bermudo
,
Henning Fernau
Theoretical Computer Science
562
, 2014, pp. 330-345
Approximation algorithms for digraph width parameters
Shiva Kintali
,
Nishad Kothari
,
Akash Kumar
Theoretical Computer Science
562
, 2014, pp. 365-376
Randomized algorithms for online knapsack problems
Xin Han
,
Yasushi Kawase
,
Kazuhisa Makino
Theoretical Computer Science
562
, 2014, pp. 395-405
Bounding the payment of approximate truthful mechanisms
Gruia Calinescu
Theoretical Computer Science
562
, 2014, pp. 419-435
Inapproximability of dominating set on power law graphs
Mikael Gast
,
Mathias Hauptmann
,
Marek Karpinski
Theoretical Computer Science
562
, 2014, pp. 436-452
Data gathering and personalized broadcasting in radio grids with interference
Jean-Claude Bermond
,
Bi Li
,
Nicolas Nisse
,
Hervé Rivano
,
Min-Li Yu
Theoretical Computer Science
562
, 2014, pp. 453-475
On the commutative equivalence of semi-linear sets of
\mathbb N^k
Flavio D'Alessandro
,
Benedetto Intrigila
Theoretical Computer Science
562
, 2014, pp. 476-495
Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
Jianer Chen
,
Jia-Hao Fan
,
Sing-Hoi Sze
Theoretical Computer Science
562
, 2014, pp. 496-512
The benefit of adaptivity in stochastic packing problems with probing
Asaf Levin
,
Aleksander Vainer
Theoretical Computer Science
562
, 2014, pp. 513-523
Improving the
H_k
-bound on the price of stability in undirected Shapley network design games
Yann Disser
,
Andreas Emil Feldmann
,
Max Klimm
,
Matús̑ Mihalák
Theoretical Computer Science
562
, 2014, pp. 557-564
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>