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: Author="Lenstra, Jan Karel"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved combinatorial approximation algorithms for the
k
-level facility location problem
Alexander Ageev
,
Yinyu Ye
,
Jiawei Zhang
Lecture Notes in Computer Science
2719
, 2003, pp. 145-156
A study of integrated document and connection caching
Susanne Albers
,
Rob van Stee
Lecture Notes in Computer Science
2719
, 2003, pp. 653-667
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
Mixin modules and computational effects
Davide Ancona
,
Sonia Fagorzi
,
Eugenio Moggi
,
Elena Zucca
Lecture Notes in Computer Science
2719
, 2003, pp. 224-238
Sophistication revisited
Luís Antunes
,
Lance Fortnow
Lecture Notes in Computer Science
2719
, 2003, pp. 267-277
Minimal classical logic and control operators
Zena M. Ariola
,
Hugo Herbelin
Lecture Notes in Computer Science
2719
, 2003, pp. 871-885
Approximation schemes for degree-restricted MST and red-blue separation problem
Sanjeev Arora
,
Kevin L. Chang
Lecture Notes in Computer Science
2719
, 2003, pp. 176-188
Anycasting in adversarial systems: Routing and admission control
Baruch Awerbuch
,
André Brinkmann
,
Christian Scheideler
Lecture Notes in Computer Science
2719
, 2003, pp. 1153-1168
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
A simple linear time algorithm for computing a
(2k-1)
-spanner of
O(n^{1+1/k})
size in weighted graphs
Surender Baswana
,
Sandeep Sen
Lecture Notes in Computer Science
2719
, 2003, pp. 384-396
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
Polarized process algebra and program equivalence
Jan A. Bergstra
,
Inge Bethke
Lecture Notes in Computer Science
2719
, 2003, pp. 1-21
Dynamic algorithms for approximating interdistances
Sergei Bespamyatnikh
,
Michael Segal
Lecture Notes in Computer Science
2719
, 2003, pp. 1169-1180
Algorithmic aspects of bandwidth trading
Randeep Bhatia
,
Julia Chuzhoy
,
Ari Freund
,
Joseph (Seffi) Naor
Lecture Notes in Computer Science
2719
, 2003, pp. 751-766
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
Markus Bläser
Lecture Notes in Computer Science
2719
, 2003, pp. 157-163
Decoding of interleaved reed Solomon codes over noisy data
Daniel Bleichenbacher
,
Aggelos Kiayias
,
Moti Yung
Lecture Notes in Computer Science
2719
, 2003, pp. 97-108
On the axiomatizability of ready traces, ready simulation, and failure traces
Stefan Blom
,
Wan Fokkink
,
Sumit Nain
Lecture Notes in Computer Science
2719
, 2003, pp. 109-118
Similarity matrices for pairs of graphs
Vincent D. Blondel
,
Paul Van Dooren
Lecture Notes in Computer Science
2719
, 2003, pp. 739-750
Generating labeled planar graphs uniformly at random
Manuel Bodirsky
,
Clemens Gröpl
,
Mihyun Kang
Lecture Notes in Computer Science
2719
, 2003, pp. 1095-1107
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
Generalized rewrite theories
Roberto Bruni
,
José Meseguer
Lecture Notes in Computer Science
2719
, 2003, pp. 252-266
Secrecy in untrusted networks
Michele Bugliesi
,
Silvia Crafa
,
Amela Prelic
,
Vladimiro Sassone
Lecture Notes in Computer Science
2719
, 2003, pp. 969-983
Replication vs. recursive definitions in channel based calculi
Nadia Busi
,
Maurizio Gabbrielli
,
Gianluigi Zavattaro
Lecture Notes in Computer Science
2719
, 2003, pp. 133-144
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
Seiten 1
2
3
4
5
>