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="Flaxman, Abraham"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
Omer Angel
,
Abraham D. Flaxman
,
David B. Wilson
Combinatorica
32
(1), 2012, pp. 1-33
On the diameter of the set of satisfying assignments in random satisfiable
k
-CNF formulas
Uriel Feige
,
Abraham D. Flaxman
,
Dan Vilenchik
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 736-749
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
Abraham D. Flaxman
,
Alan M. Frieze
,
Juan C. Vera
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 441-449
Solving medium-density subset sum problems in expected polynomial time
Abraham D. Flaxman
,
Bartosz Przydatek
Lecture Notes in Computer Science
3404
, 2005, pp. 305-314
Efficient communication in an ad-hoc network
Abraham Flaxman
,
Alan Frieze
,
Eli Upfal
Journal of Algorithms
52
(1), 2004, pp. 1-7