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: Author="Monteiro, Lu{\'{i}}s"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Password-based encryption analyzed
Martín Abadi
,
Bogdan Warinschi
Lecture Notes in Computer Science
3580
, 2005, pp. 664-676
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
Union-find with constant time deletions
Stephen Alstrup
,
Inge Li Grtz
,
Theis Rauhe
,
Mikkel Thorup
,
Uri Zwick
Lecture Notes in Computer Science
3580
, 2005, pp. 78-89
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
Noisy Turing machines
Eugene Asarin
,
Pieter Collins
Lecture Notes in Computer Science
3580
, 2005, pp. 1031-1042
Preservation under extensions on well-behaved finite structures
Albert Atserias
,
Anuj Dawar
,
Martin Grohe
Lecture Notes in Computer Science
3580
, 2005, pp. 1437-1449
On the cover time of random geometric graphs
Chen Avin
,
Gunes Ercal
Lecture Notes in Computer Science
3580
, 2005, pp. 677-689
Facility location in sublinear time
Mihai Bȃdoiu
,
Artur Czumaj
,
Piotr Indyk
,
Christian Sohler
Lecture Notes in Computer Science
3580
, 2005, pp. 866-877
Petri algebras
Eric Badouel
,
Jules Chenou
,
Goulven Guillou
Lecture Notes in Computer Science
3580
, 2005, pp. 742-754
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
Computationally sound implementations of equational theories against passive adversaries
Mathieu Baudet
,
Véronique Cortier
,
Steve Kremer
Lecture Notes in Computer Science
3580
, 2005, pp. 652-663
On the equivalence of
Z
-automata
Marie-Pierre Béal
,
Sylvain Lombardy
,
Jacques Sakarovitch
Lecture Notes in Computer Science
3580
, 2005, pp. 397-409
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
Groupoids that recognize only regular languages
Martin Beaudry
,
François Lemieux
,
Denis Thérien
Lecture Notes in Computer Science
3580
, 2005, pp. 421-433
Dynamic diffusion load balancing
Petra Berenbrink
,
Tom Friedetzky
,
Russell Martin
Lecture Notes in Computer Science
3580
, 2005, pp. 1386-1398
The tree inclusion problem: In optimal space and faster
Philip Bille
,
Inge Li Grtz
Lecture Notes in Computer Science
3580
, 2005, pp. 66-77
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
The polyranking principle
Aaron R. Bradley
,
Zohar Manna
,
Henny B. Sipma
Lecture Notes in Computer Science
3580
, 2005, pp. 1349-1361
Classification of Boolean functions of 6 variables or less with respect to some cryptographic properties
An Braeken
,
Yuri Borissov
,
Svetla Nikova
,
Bart Preneel
Lecture Notes in Computer Science
3580
, 2005, pp. 324-334
Cache-aware and cache-oblivious adaptive sorting
Gerth Stlting Brodal
,
Rolf Fagerberg
,
Gabriel Moruz
Lecture Notes in Computer Science
3580
, 2005, pp. 576-588
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
A gentle introduction to semantic subtyping
Giuseppe Castagna
,
Alain Frisch
Lecture Notes in Computer Science
3580
, 2005, pp. 30-34
Hybrid trapdoor commitments and their applications
Dario Catalano
,
Ivan Visconti
Lecture Notes in Computer Science
3580
, 2005, pp. 298-310
Dynamic bin packing of unit fractions items
Wun-Tat Chan
,
Tak-Wah Lam
,
Prudence W.H. Wong
Lecture Notes in Computer Science
3580
, 2005, pp. 614-626
Seiten 1
2
3
4
5
>