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=562
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Independent dominating set problem revisited
Ching-Hao Liu
,
Sheung-Hung Poon
,
Jin-Yong Lin
Theoretical Computer Science
562
, 2014, pp. 1-22
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
Optimistic fair exchange in the enhanced chosen-key model
Yang Wang
,
Man Ho Au
,
Willy Susilo
Theoretical Computer Science
562
, 2014, pp. 57-74
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
On the complexity of the traveling umpire problem
Lucas de Oliveira
,
Cid C. de Souza
,
Tallys Yunes
Theoretical Computer Science
562
, 2014, pp. 101-111
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
One-to-one disjoint path covers on alternating group graphs
Lantao You
,
Jianxi Fan
,
Yuejuan Han
,
Xiaohua Jia
Theoretical Computer Science
562
, 2014, pp. 146-164
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
Concurrent signature without random oracles
Xiao Tan
,
Qiong Huang
,
Duncan S. Wong
Theoretical Computer Science
562
, 2014, pp. 194-212
Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach
Chenchen Wu
,
Donglei Du
,
Dachuan Xu
Theoretical Computer Science
562
, 2014, pp. 213-226
Dynamic algorithms for monotonic interval scheduling problem
Alexander Gavruskin
,
Bakhadyr Khoussainov
,
Mikhail Kokho
,
Jiamou Liu
Theoretical Computer Science
562
, 2014, pp. 227-242
Solution to a conjecture on words that are bad and 2-isometric
Jianxin Wei
,
Heping Zhang
Theoretical Computer Science
562
, 2014, pp. 243-251
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
Succinct representation of labeled trees
Dekel Tsur
Theoretical Computer Science
562
, 2014, pp. 320-329
Combinatorics for smaller kernels: The differential of a graph
Sergio Bermudo
,
Henning Fernau
Theoretical Computer Science
562
, 2014, pp. 330-345
Overdetermined Weierstrass iteration and the nearest consistent system
Olivier Ruatta
,
Mark Sciabica
,
Agnes Szanto
Theoretical Computer Science
562
, 2014, pp. 346-364
Seiten 1
2
>