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
[2]
Hilfe
Suche: Series=LNCS AND YEAR=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of stochastic Rabin and Streett games
Krishnendu Chatterjee
,
Luca de Alfaro
,
Thomas A. Henzinger
Lecture Notes in Computer Science
3580
, 2005, pp. 878-890
How well can primal-dual and local-ratio algorithms perform?
Allan Borodin
,
David Cashman
,
Avner Magen
Lecture Notes in Computer Science
3580
, 2005, pp. 943-955
Lower bounds for circuits with few modular and symmetric gates
Arkadev Chattopadhyay
,
Kristoffer Arnsfelt Hansen
Lecture Notes in Computer Science
3580
, 2005, pp. 994-1005
Noisy Turing machines
Eugene Asarin
,
Pieter Collins
Lecture Notes in Computer Science
3580
, 2005, pp. 1031-1042
Decidability and complexity results for timed automata via channel machines
Parosh Aziz Abdulla
,
Johann Deneux
,
Joël Ouaknine
,
James Worrell
Lecture Notes in Computer Science
3580
, 2005, pp. 1089-1101
Congruences for visibly pushdown languages
Rajeev Alur
,
Viraj Kumar
,
P. Madhusudan
,
Mahesh Viswanathan
Lecture Notes in Computer Science
3580
, 2005, pp. 1102-1114
An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks
Christoph Ambühl
Lecture Notes in Computer Science
3580
, 2005, pp. 1139-1150
Lower bounds for Lovász-Schrijver systems and beyond follow from multiparty communication complexity
Paul Beame
,
Toniann Pitassi
,
Nathan Segerlind
Lecture Notes in Computer Science
3580
, 2005, pp. 1176-1188
A fully abstract encoding of the
\pi
-calculus with data terms
Michael Baldamus
,
Joachim Parrow
,
Björn Victor
Lecture Notes in Computer Science
3580
, 2005, pp. 1202-1213
Basic observables for a calculus for global computing
Rocco De Nicola
,
Daniele Gorla
,
Rosario Pugliese
Lecture Notes in Computer Science
3580
, 2005, pp. 1226-1238
Compositional verification of asynchronous processes via constraint solving
Giorgio Delzanno
,
Maurizio Gabbrielli
Lecture Notes in Computer Science
3580
, 2005, pp. 1239-1250
Semantic-based code obfuscation by abstract interpretation
Mila Dalla Preda
,
Roberto Giacobazzi
Lecture Notes in Computer Science
3580
, 2005, pp. 1325-1336
The polyranking principle
Aaron R. Bradley
,
Zohar Manna
,
Henny B. Sipma
Lecture Notes in Computer Science
3580
, 2005, pp. 1349-1361
Dynamic diffusion load balancing
Petra Berenbrink
,
Tom Friedetzky
,
Russell Martin
Lecture Notes in Computer Science
3580
, 2005, pp. 1386-1398
On the hardness of embeddings between two finite metrics
Matthew Cary
,
Atri Rudra
,
Ashish Sabharwal
Lecture Notes in Computer Science
3580
, 2005, pp. 1412-1423
Preservation under extensions on well-behaved finite structures
Albert Atserias
,
Anuj Dawar
,
Martin Grohe
Lecture Notes in Computer Science
3580
, 2005, pp. 1437-1449
Sharper upper and lower bounds for an approximation scheme for CONSENSUS-PATTERN
Bron̑a Brejová
,
Daniel G. Brown
,
Ian M. Harrower
,
Alejandro López-Ortiz
,
Tomás̑ Vinaȓ
Lecture Notes in Computer Science
3537
, 2005, pp. 1-10
Faster algorithms for
\delta,\gamma
-matching and related problems
Peter Clifford
,
Raphaël Clifford
,
Costas Iliopoulos
Lecture Notes in Computer Science
3537
, 2005, pp. 68-78
Approximate matching in the
L_1
metric
Amihood Amir
,
Ohad Lipsky
,
Ely Porat
,
Julia Umanski
Lecture Notes in Computer Science
3537
, 2005, pp. 91-103
DNA compression challenge revisited: A dynamic programming approach
Behshad Behzadi
,
Fabrice Le Fessant
Lecture Notes in Computer Science
3537
, 2005, pp. 190-200
An optimal algorithm for online square detection
Gen-Huey Chen
,
Jin-Ju Hong
,
Hsueh-I Lu
Lecture Notes in Computer Science
3537
, 2005, pp. 280-287
Regular expression constrained sequence alignment
Abdullah N. Arslan
Lecture Notes in Computer Science
3537
, 2005, pp. 322-333
A polynomial time matching algorithm of ordered tree patterns having height-constrained variables
Kazuhide Aikou
,
Yusuke Suzuki
,
Takayoshi Shoudai
,
Tomoyuki Uchida
,
Tetsuhiro Miyahara
Lecture Notes in Computer Science
3537
, 2005, pp. 346-357
Assessing the significance of sets of words
Valentina Boeva
,
Julien Clément
,
Mireille Régnier
,
Mathias Vandenbogaert
Lecture Notes in Computer Science
3537
, 2005, pp. 358-370
Inferring a graph from path frequency
Tatsuya Akutsu
,
Daiji Fukagawa
Lecture Notes in Computer Science
3537
, 2005, pp. 371-382
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>