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=2012
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Foundational aspects of multiscale digitization
Agathe Chollet
,
Guy Wallet
,
Laurent Fuchs
,
Eric Andres
,
Gaëlle Largeteau-Skapin
Theoretical Computer Science
466
, 2012, pp. 2-19
Degree distributions of evolving alphabetic bipartite networks and their projections
Niloy Ganguly
,
Saptarshi Ghosh
,
Tyll Krueger
,
Ajitesh Srivastava
Theoretical Computer Science
466
, 2012, pp. 20-36
Fuzzy rough granular self-organizing map and fuzzy rough entropy
Avatharam Ganivada
,
Shubhra Sankar Ray
,
Sankar K. Pal
Theoretical Computer Science
466
, 2012, pp. 37-63
Robust periodic solutions and evolution from seeds in one-dimensional edge cellular automata
Janko Gravner
,
David Griffeath
Theoretical Computer Science
466
, 2012, pp. 64-86
Analytical aspects of tie breaking
Tobias Jacobs
Theoretical Computer Science
465
, 2012, pp. 1-9
Corrigendum to ``On Brlek-Reutenauer conjecture''
L'. Balková
,
E. Pelantová
,
S̑. Starosta
Theoretical Computer Science
465
, 2012, pp. 73-74
Modularity in term rewriting revisited
Bernhard Gramlich
Theoretical Computer Science
464
, 2012, pp. 3-19
From diagrammatic confluence to modularity
Jean-Pierre Jouannaud
,
Jiaxiang Liu
Theoretical Computer Science
464
, 2012, pp. 20-34
Jumping and escaping: Modular termination and the abstract path ordering
Nachum Dershowitz
Theoretical Computer Science
464
, 2012, pp. 35-47
Highlights in infinitary rewriting and lambda calculus
Jörg Endrullis
,
Dimitri Hendriks
,
Jan Willem Klop
Theoretical Computer Science
464
, 2012, pp. 48-71
Principles of proof scores in CafeOBJ
Kokichi Futatsugi
,
Daniel Gȃinȃ
,
Kazuhiro Ogata
Theoretical Computer Science
464
, 2012, pp. 90-112
Tracing where and who provenance in Linked Data: A calculus
Mariangiola Dezani-Ciancaglini
,
Ross Horne
,
Vladimiro Sassone
Theoretical Computer Science
464
, 2012, pp. 113-129
Entanglement and the complexity of directed graphs
Dietmar Berwanger
,
Erich Grädel
,
Łukasz Kaiser
,
Roman Rabinovich
Theoretical Computer Science
463
, 2012, pp. 2-25
Revolutionaries and spies: Spy-good and spy-bad graphs
Jane V. Butterfield
,
Daniel W. Cranston
,
Gregory J. Puleo
,
Douglas B. West
,
Reza Zamani
Theoretical Computer Science
463
, 2012, pp. 35-53
Locating a robber on a graph via distance queries
James Carraher
,
Ilkyoo Choi
,
Michelle Delcourt
,
Lawrence H. Erickson
,
Douglas B. West
Theoretical Computer Science
463
, 2012, pp. 54-61
Hypertree-depth and minors in hypergraphs
Isolde Adler
,
Tomás̑ Gavenc̑iak
,
Tereza Klimos̑ová
Theoretical Computer Science
463
, 2012, pp. 84-95
Approximate search strategies for weighted trees
Dariusz Dereniowski
Theoretical Computer Science
463
, 2012, pp. 96-113
Continuous monitoring in the dynamic sensor field model
C. Àlvarez
,
J. Díaz
,
D. Mitsche
,
M. Serna
Theoretical Computer Science
463
, 2012, pp. 114-122
polish
- Let us play the cleaning game
Przemysƚaw Gordinowicz
,
Richard J. Nowakowski
,
Paweƚ Praƚat
Theoretical Computer Science
463
, 2012, pp. 123-132
Some remarks on cops and drunk robbers
Athanasios Kehagias
,
Paweƚ Praƚat
Theoretical Computer Science
463
, 2012, pp. 133-147
Variable length local decoding and alignment-free sequence comparison
Gilles Didier
,
Eduardo Corel
,
Ivan Laprevotte
,
Alex Grossmann
,
Claudine Landès-Devauchelle
Theoretical Computer Science
462
, 2012, pp. 1-11
On the competitiveness of AIMD-TPC within a general network
Jeff Edmonds
Theoretical Computer Science
462
, 2012, pp. 12-22
On the max coloring problem
Leah Epstein
,
Asaf Levin
Theoretical Computer Science
462
, 2012, pp. 23-38
Chosen-ciphertext secure anonymous conditional proxy re-encryption with keyword search
Liming Fang
,
Willy Susilo
,
Chunpeng Ge
,
Jiandong Wang
Theoretical Computer Science
462
, 2012, pp. 39-58
Root finding with threshold circuits
Emil Jeȓábek
Theoretical Computer Science
462
, 2012, pp. 59-69
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>