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: Series=LNCS AND YEAR=2003
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Residual languages and probabilistic automata
François Denis
,
Yann Esposito
Lecture Notes in Computer Science
2719
, 2003, pp. 452-463
Convergence time to Nash equilibria
Eyal Even-Dar
,
Alex Kesselman
,
Yishay Mansour
Lecture Notes in Computer Science
2719
, 2003, pp. 502-513
Nashification and the coordination ratio for a selfish routing game
Rainer Feldmann
,
Martin Gairing
,
Thomas Lücking
,
Burkhard Monien
,
Manuel Rode
Lecture Notes in Computer Science
2719
, 2003, pp. 514-526
Stable marriages with multiple partners: Efficient search for an optimal solution
Vipul Bansal
,
Aseem Agrawal
,
Varun S. Malhotra
Lecture Notes in Computer Science
2719
, 2003, pp. 527-542
An intersection inequality for discrete distributions and related generation problems
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
,
Leonid Khachiyan
,
Kazuhisa Makino
Lecture Notes in Computer Science
2719
, 2003, pp. 543-555
Higher order pushdown automata, the Caucal hierarchy of graphs and parity games
Thierry Cachat
Lecture Notes in Computer Science
2719
, 2003, pp. 556-569
On equivalent representations of infinite structures
Arnaud Carayol
,
Thomas Colcombet
Lecture Notes in Computer Science
2719
, 2003, pp. 599-610
On the competitive ratio for online facility location
Dimitris Fotakis
Lecture Notes in Computer Science
2719
, 2003, pp. 637-652
A study of integrated document and connection caching
Susanne Albers
,
Rob van Stee
Lecture Notes in Computer Science
2719
, 2003, pp. 653-667
Degree distribution of the FKP network model
Noam Berger
,
Béla Bollobás
,
Christian Borgs
,
Jennifer Chayes
,
Oliver Riordan
Lecture Notes in Computer Science
2719
, 2003, pp. 725-738
Similarity matrices for pairs of graphs
Vincent D. Blondel
,
Paul Van Dooren
Lecture Notes in Computer Science
2719
, 2003, pp. 739-750
Algorithmic aspects of bandwidth trading
Randeep Bhatia
,
Julia Chuzhoy
,
Ari Freund
,
Joseph (Seffi) Naor
Lecture Notes in Computer Science
2719
, 2003, pp. 751-766
The computational complexity of the role assignment problem
Jiȓí Fiala
,
Daniël Paulusma
Lecture Notes in Computer Science
2719
, 2003, pp. 817-828
Fixed-parameter algorithms for the
(k,r)
-center in planar graphs and map graphs
Erik D. Demaine
,
Fedor V. Fomin
,
Mohammad Taghi Hajiaghayi
,
Dimitrios M. Thilikos
Lecture Notes in Computer Science
2719
, 2003, pp. 829-844
Genus characterizes the complexity of graph problems: Some tight results
Jianer Chen
,
Iyad A. Kanj
,
Ljubomir Perkovic
,
Eric Sedgwick
,
Ge Xia
Lecture Notes in Computer Science
2719
, 2003, pp. 845-856
The definition of a temporal clock operator
Cindy Eisner
,
Dana Fisman
,
John Havlicek
,
Anthony McIsaac
,
David Van Campenhout
Lecture Notes in Computer Science
2719
, 2003, pp. 857-870
Minimal classical logic and control operators
Zena M. Ariola
,
Hugo Herbelin
Lecture Notes in Computer Science
2719
, 2003, pp. 871-885
Function matching: Algorithms, applications, and a lower bound
Amihood Amir
,
Yonatan Aumann
,
Richard Cole
,
Moshe Lewenstein
,
Ely Porat
Lecture Notes in Computer Science
2719
, 2003, pp. 929-942
Secrecy in untrusted networks
Michele Bugliesi
,
Silvia Crafa
,
Amela Prelic
,
Vladimiro Sassone
Lecture Notes in Computer Science
2719
, 2003, pp. 969-983
Locally commutative categories
Arkadev Chattopadhyay
,
Denis Thérien
Lecture Notes in Computer Science
2719
, 2003, pp. 984-995
Semi-pullbacks and bisimulations in categories of stochastic relations
Ernst-Erich Doberkat
Lecture Notes in Computer Science
2719
, 2003, pp. 996-1007
Generating labeled planar graphs uniformly at random
Manuel Bodirsky
,
Clemens Gröpl
,
Mihyun Kang
Lecture Notes in Computer Science
2719
, 2003, pp. 1095-1107
Online load balancing made simple: Greedy strikes back
Pilu Crescenzi
,
Giorgio Gambosi
,
Gaia Nicosia
,
Paolo Penna
,
Walter Unger
Lecture Notes in Computer Science
2719
, 2003, pp. 1108-1122
Improved approximation algorithms for minimum-space advertisement scheduling
Brian C. Dean
,
Michel X. Goemans
Lecture Notes in Computer Science
2719
, 2003, pp. 1138-1152
Anycasting in adversarial systems: Routing and admission control
Baruch Awerbuch
,
André Brinkmann
,
Christian Scheideler
Lecture Notes in Computer Science
2719
, 2003, pp. 1153-1168
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>