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=412
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Linear and sublinear time algorithms for the basis of Abelian groups
Li Chen
,
Bin Fu
Theoretical Computer Science
412
(32), 2011, pp. 4110-4122
Good programming in transactional memory: Game theory meets multicore architecture
Raphael Eidenbenz
,
Roger Wattenhofer
Theoretical Computer Science
412
(32), 2011, pp. 4136-4150
Reconstructing polygons from scanner data
Therese Biedl
,
Stephane Durocher
,
Jack Snoeyink
Theoretical Computer Science
412
(32), 2011, pp. 4161-4172
Untangled monotonic chains and adaptive range search
Diego Arroyuelo
,
Francisco Claude
,
Reza Dorrigiv
,
Stephane Durocher
,
Meng He
,
Alejandro López-Ortiz
,
J. Ian Munro
,
Patrick K. Nicholson
,
Alejandro Salinger
,
Matthew Skala
Theoretical Computer Science
412
(32), 2011, pp. 4200-4211
Automated constraint-based addition of nonmasking and stabilizing fault-tolerance
F. Abujarad
,
S.S. Kulkarni
Theoretical Computer Science
412
(33), 2011, pp. 4228-4246
A self-stabilizing transformer for population protocols with covering
Joffroy Beauquier
,
Janna Burman
,
Shay Kutten
Theoretical Computer Science
412
(33), 2011, pp. 4247-4259
Consensus when all processes may be Byzantine for some time
Martin Biely
,
Martin Hutle
Theoretical Computer Science
412
(33), 2011, pp. 4260-4272
On the road to the weakest failure detector for
k
-set agreement in message-passing systems
François Bonnet
,
Michel Raynal
Theoretical Computer Science
412
(33), 2011, pp. 4273-4284
How to improve snap-stabilizing point-to-point communication space complexity?
Alain Cournier
,
Swan Dubois
,
Vincent Villain
Theoretical Computer Science
412
(33), 2011, pp. 4285-4296
Fault containment in weakly stabilizing systems
Anurag Dasgupta
,
Sukumar Ghosh
,
Xin Xiao
Theoretical Computer Science
412
(33), 2011, pp. 4297-4311
Separation of circulating tokens
K. GhoshDastidar
,
T. Herman
Theoretical Computer Science
412
(33), 2011, pp. 4312-4324
Nash equilibria in stabilizing systems
M.G. Gouda
,
H.B. Acharya
Theoretical Computer Science
412
(33), 2011, pp. 4325-4335
Constraint Markov chains
Benoît Caillaud
,
Benoît Delahaye
,
Kim G. Larsen
,
Axel Legay
,
Mikkel L. Pedersen
,
Andrzej Wa̧sowski
Theoretical Computer Science
412
(34), 2011, pp. 4373-4404
Proving weak properties of rewriting
Isabelle Gnaedig
,
Hélène Kirchner
Theoretical Computer Science
412
(34), 2011, pp. 4405-4438
Deterministic secure positioning in wireless sensor networks
Sylvie Delaët
,
Partha Sarathi Mandal
,
Mariusz A. Rokicki
,
Sébastien Tixeuil
Theoretical Computer Science
412
(35), 2011, pp. 4471-4481
A subdivision method for computing nearest gcd with certification
Guillaume Chèze
,
André Galligo
,
Bernard Mourrain
,
Jean-Claude Yakoubsohn
Theoretical Computer Science
412
(35), 2011, pp. 4493-4503
The complexity of determining the rainbow vertex-connection of a graph
Lily Chen
,
Xueliang Li
,
Yongtang Shi
Theoretical Computer Science
412
(35), 2011, pp. 4531-4535
Drawn
k
-in-a-row games
Sheng-Hao Chiang
,
I-Chen Wu
,
Ping-Hung Lin
Theoretical Computer Science
412
(35), 2011, pp. 4558-4569
Kernel bounds for disjoint cycles and disjoint paths
Hans L. Bodlaender
,
Stéphan Thomassé
,
Anders Yeo
Theoretical Computer Science
412
(35), 2011, pp. 4570-4578
Finding and enumerating Hamilton cycles in 4-regular graphs
Gebauer Heidi
Theoretical Computer Science
412
(35), 2011, pp. 4579-4591
Applying IsRewritten criterion on Buchberger algorithm
Amir Hashemi
,
Benyamin M.-Alizadeh
Theoretical Computer Science
412
(35), 2011, pp. 4592-4603
Static and expanding grid coverage with ant robots: Complexity results
Yaniv Altshuler
,
Alfred M. Bruckstein
Theoretical Computer Science
412
(35), 2011, pp. 4661-4674
Tradeoffs in process strategy games with application in the WDM reconfiguration problem
Nathann Cohen
,
David Coudert
,
Dorian Mazauric
,
Napoleão Nepomuceno
,
Nicolas Nisse
Theoretical Computer Science
412
(35), 2011, pp. 4675-4687
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem
Damian Bogdanowicz
,
Krzysztof Giaro
,
Robert Janczewski
Theoretical Computer Science
412
(35), 2011, pp. 4721-4728
Sum of digits sequences modulo
m
Thomas W. Cusick
,
Lavinia Corina Ciungu
Theoretical Computer Science
412
(35), 2011, pp. 4738-4741
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>