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.
The complexity of fully proportional representation for single-crossing electorates
Piotr Skowron
,
Lan Yu
,
Piotr Faliszewski
,
Edith Elkind
Theoretical Computer Science
569
, 2015, pp. 43-57
Pseudorandom generators from regular one-way functions: New constructions with improved parameters
Yu Yu
,
Xiangxue Li
,
Jian Weng
Theoretical Computer Science
569
, 2015, pp. 58-69
A note on the complexity of minimum latency data aggregation scheduling with uniform power in physical interference model
Nhat X. Lam
,
Tien Tran
,
Min Kyung An
,
Dung T. Huynh
Theoretical Computer Science
569
, 2015, pp. 70-73
Interactive proofs with quantum finite automata
Harumichi Nishimura
,
Tomoyuki Yamakami
Theoretical Computer Science
568
, 2015, pp. 1-18
General design of reversible sequential machines based on reversible logic elements
Ming-Xiao Tang
,
Jia Lee
,
Kenichi Morita
Theoretical Computer Science
568
, 2015, pp. 19-27
Relative interval analysis of paging algorithms on access graphs
Joan Boyar
,
Sushmita Gupta
,
Kim S. Larsen
Theoretical Computer Science
568
, 2015, pp. 28-48
Identification of biological regulatory networks from Process Hitting models
Maxime Folschette
,
Loïc Paulevé
,
Katsumi Inoue
,
Morgan Magnin
,
Olivier Roux
Theoretical Computer Science
568
, 2015, pp. 49-71
Fixed-parameter algorithms for scaffold filling
Laurent Bulteau
,
Anna Paola Carrieri
,
Riccardo Dondi
Theoretical Computer Science
568
, 2015, pp. 72-83
On the self-stabilization of mobile oblivious robots in uniform rings
Fukuhito Ooshita
,
Sébastien Tixeuil
Theoretical Computer Science
568
, 2015, pp. 84-96
Characterizing and recognizing probe block graphs
Van Bang Le
,
Sheng-Lung Peng
Theoretical Computer Science
568
, 2015, pp. 97-102
Three small universal spiking neural P systems
Turlough Neary
Theoretical Computer Science
567
, 2015, pp. 2-20
Category theory of symbolic dynamics
Ville Salo
,
Ilkka Tōrmä
Theoretical Computer Science
567
, 2015, pp. 21-45
A framework for co-optimization algorithm performance and its application to worst-case optimization
Elena Popovici
,
Ezra Winston
Theoretical Computer Science
567
, 2015, pp. 46-73
Computational efficiency and universality of timed P systems with active membranes
Bosheng Song
,
Linqiang Pan
Theoretical Computer Science
567
, 2015, pp. 74-86
From black-box complexity to designing new genetic algorithms
Benjamin Doerr
,
Carola Doerr
,
Franziska Ebel
Theoretical Computer Science
567
, 2015, pp. 87-104
Descriptional complexity of unambiguous input-driven pushdown automata
Alexander Okhotin
,
Kai Salomaa
Theoretical Computer Science
566
, 2015, pp. 1-11
The fault-tolerant capacitated
K
-center problem
Shiri Chechik
,
David Peleg
Theoretical Computer Science
566
, 2015, pp. 12-25
Abelian properties of Parry words
Ondȓej Turek
Theoretical Computer Science
566
, 2015, pp. 26-38
Complexity of conflict-free colorings of graphs
Luisa Gargano
,
Adele A. Rescigno
Theoretical Computer Science
566
, 2015, pp. 39-49
Some sufficient conditions for 1-planar graphs to be Class 1
Wenwen Zhang
,
Jian-Liang Wu
Theoretical Computer Science
566
, 2015, pp. 50-58
On the proper orientation number of bipartite graphs
Julio Araujo
,
Nathann Cohen
,
Susanna F. de Rezende
,
Frédéric Havet
,
Phablo F.S. Moura
Theoretical Computer Science
566
, 2015, pp. 59-75
On the parameterized complexity of vertex cover and edge cover with connectivity constraints
Henning Fernau
,
Fedor V. Fomin
,
Geevarghese Philip
,
Saket Saurabh
Theoretical Computer Science
565
, 2015, pp. 1-15
On the Cartesian skeleton and the factorization of the strong product of digraphs
Marc Hellmuth
,
Tilen Marc
Theoretical Computer Science
565
, 2015, pp. 16-29
Visual cryptograms of random grids for threshold access structures
Shyong Jian Shyu
Theoretical Computer Science
565
, 2015, pp. 30-49
A family of sand automata
Nicholas Faulkner
,
Reem Yassawi
Theoretical Computer Science
565
, 2015, pp. 50-62
Seiten
<
1
2
3
4
5
6
7
8
9
>