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=2015
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the complexity of finding a largest common subtree of bounded degree
Tatsuya Akutsu
,
Takeyuki Tamura
,
Avraham A. Melkman
,
Atsuhiro Takasu
Theoretical Computer Science
590
, 2015, pp. 2-16
Cancellation-free circuits in unbounded and bounded depth
Joan Boyar
,
Magnus Gausdal Find
Theoretical Computer Science
590
, 2015, pp. 17-26
On the expressivity of time-varying graphs
Arnaud Casteigts
,
Paola Flocchini
,
Emmanuel Godard
,
Nicola Santoro
,
Masafumi Yamashita
Theoretical Computer Science
590
, 2015, pp. 27-37
On the isomorphism problem for decision trees and decision lists
V. Arvind
,
Johannes Köbler
,
Sebastian Kuhnert
,
Gaurav Rattan
,
Yadu Vasudev
Theoretical Computer Science
590
, 2015, pp. 38-54
Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae
Evangelos Kranakis
,
Fraser MacQuarrie
,
Oscar Morales Ponce
Theoretical Computer Science
590
, 2015, pp. 55-72
New sequential and parallel algorithms for computing the
\beta
-spectrum
Mirosƚaw Kowaluk
,
Gabriela Majewska
Theoretical Computer Science
590
, 2015, pp. 73-85
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
Steven Chaplick
,
Jiȓí Fiala
,
Pim van 't Hof
,
Daniël Paulusma
,
Marek Tesaȓ
Theoretical Computer Science
590
, 2015, pp. 86-95
On the structure of equilibria in basic network formation
S. Nikoletseas
,
P. Panagopoulou
,
C. Raptopoulos
,
P.G. Spirakis
Theoretical Computer Science
590
, 2015, pp. 96-105
Efficient sampling of non-strict turnstile data streams
Neta Barkay
,
Ely Porat
,
Bar Shalem
Theoretical Computer Science
590
, 2015, pp. 106-117
Improved approximation algorithms for constrained fault-tolerant resource allocation
Kewen Liao
,
Hong Shen
,
Longkun Guo
Theoretical Computer Science
590
, 2015, pp. 118-128
Online parallel scheduling of non-uniform tasks: Trading failures for energy
Antonio Fernández Anta
,
Chryssis Georgiou
,
Dariusz R. Kowalski
,
Elli Zavou
Theoretical Computer Science
590
, 2015, pp. 129-146
Random reals as measures of natural open sets
Claude Sureson
Theoretical Computer Science
589
, 2015, pp. 1-23
Buffer management of multi-queue QoS switches with class segregation
Toshiya Itoh
,
Seiji Yoshimoto
Theoretical Computer Science
589
, 2015, pp. 24-33
Dictionary matching with a few gaps
Amihood Amir
,
Avivit Levy
,
Ely Porat
,
B. Riva Shalom
Theoretical Computer Science
589
, 2015, pp. 34-46
Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant
Che-Nan Kuo
Theoretical Computer Science
589
, 2015, pp. 47-52
An improved 2-agent kidney exchange mechanism
Ioannis Caragiannis
,
Aris Filos-Ratsikas
,
Ariel D. Procaccia
Theoretical Computer Science
589
, 2015, pp. 53-60
A probabilistic approach to case-based inference
Martin Anthony
,
Joel Ratsaby
Theoretical Computer Science
589
, 2015, pp. 61-75
Fan-planarity: Properties and complexity
Carla Binucci
,
Emilio Di Giacomo
,
Walter Didimo
,
Fabrizio Montecchiani
,
Maurizio Patrignani
,
Antonios Symvonis
,
Ioannis G. Tollis
Theoretical Computer Science
589
, 2015, pp. 76-86
Linear rank-width and linear clique-width of trees
Isolde Adler
,
Mamadou Moustapha Kanté
Theoretical Computer Science
589
, 2015, pp. 87-98
Combinatorial voter control in elections
Laurent Bulteau
,
Jiehua Chen
,
Piotr Faliszewski
,
Rolf Niedermeier
,
Nimrod Talmon
Theoretical Computer Science
589
, 2015, pp. 99-120
Worst case compromises in matroids with applications to the allocation of indivisible goods
Laurent Gourvès
,
Jérôme Monnot
,
Lydia Tlilane
Theoretical Computer Science
589
, 2015, pp. 121-140
An almost-confluent congruential language which is not Church-Rosser congruential
Colm Ó Dúnlaing
Theoretical Computer Science
589
, 2015, pp. 141-146
On Martin-Löf (non-)convergence of Solomonoff's universal mixture
Tor Lattimore
,
Marcus Hutter
Theoretical Computer Science
588
, 2015, pp. 2-15
Any monotone property of 3-uniform hypergraphs is weakly evasive
Raghav Kulkarni
,
Youming Qiao
,
Xiaoming Sun
Theoretical Computer Science
588
, 2015, pp. 16-23
Minimax regret 1-sink location problem in dynamic path networks
Yuya Higashikawa
,
John Augustine
,
Siu-Wing Cheng
,
Mordecai J. Golin
,
Naoki Katoh
,
Guanqun Ni
,
Bing Su
,
Yinfeng Xu
Theoretical Computer Science
588
, 2015, pp. 24-36
Seiten 1
2
3
4
5
6
7
8
9
>