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: Journal=J. ACM AND Volume=56
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs
Dimitris Achlioptas
,
Aaron Clauset
,
David Kempe
,
Cristopher Moore
Journal of the ACM
56
(4), 2009, pp. 21: 1-28
Adding nesting structure to words
Rajeev Alur
,
P. Madhusudan
Journal of the ACM
56
(3), 2009, pp. 16: 1-43
A unified approach to scheduling on unrelated parallel machines
V.S. Anil Kumar
,
Madhav V. Marathe
,
Srinivasan Parthasarathy
,
Aravind Srinivasan
Journal of the ACM
56
(5), 2009, pp. 28: 1-31
Expander flows, geometric embeddings and graph partitioning
Sanjeev Arora
,
Satish Rao
,
Umesh Vazirani
Journal of the ACM
56
(2), 2009, pp. 5: 1-37
The gene evolution model and computing its associated probabilities
Lars Arvestad
,
Jens Lagergren
,
Bengt Sennblad
Journal of the ACM
56
(2), 2009, pp. 7: 1-44
The complexity of obstruction-free implementations
Hagit Attiya
,
Rachid Guerraoui
,
Danny Hendler
,
Petr Kuznetsov
Journal of the ACM
56
(4), 2009, pp. 24: 1-33
Single-value combinatorial auctions and algorithmic implementation in undominated strategies
Moshe Babaioff
,
Ron Lavi
,
Elan Pavlov
Journal of the ACM
56
(1), 2009, pp. 4: 1-32
On approximating the ideal random access machine by physical machines
Gianfranco Bilardi
,
Kattamuri Ekanadham
,
Pratap Pattnaik
Journal of the ACM
56
(5), 2009, pp. 27: 1-57
Two-variable logic on data trees and XML reasoning
Mikoaj Bojańczyk
,
Anca Muscholl
,
Thomas Schwentick
,
Luc Segoufin
Journal of the ACM
56
(3), 2009, pp. 13: 1-48
An
O(n\log n)
algorithm for maximum
st
-flow in a directed planar graph
Glencora Borradaile
,
Philip Klein
Journal of the ACM
56
(2), 2009, pp. 9: 1-30
On the expressiveness and complexity of randomization in finite state monitors
Rohit Chadha
,
A. Prasad Sistla
,
Mahesh Viswanathan
Journal of the ACM
56
(5), 2009, pp. 26: 1-44
Settling the complexity of computing two-player Nash equilibria
Xi Chen
,
Xiaotie Deng
,
Shang-Hua Teng
Journal of the ACM
56
(3), 2009, pp. 14: 1-57
Polynomial flow-cut gaps and hardness of directed cut problems
Julia Chuzhoy
,
Sanjeev Khanna
Journal of the ACM
56
(2), 2009, pp. 6: 1-28
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Kousha Etessami
,
Mihalis Yannakakis
Journal of the ACM
56
(1), 2009, pp. 1: 1-66
A measure & conquer approach for the analysis of exact algorithms
Fedor V. Fomin
,
Fabrizio Grandoni
,
Dieter Kratsch
Journal of the ACM
56
(5), 2009, pp. 25: 1-32
Generalized hypertree decompositions:
NP
-hardness and tractable variants
Georg Gottlob
,
Zoltán Miklós
,
Thomas Schwentick
Journal of the ACM
56
(6), 2009, pp. 30: 1-32
Lower bounds for processing data with few random accesses to external memory
Martin Grohe
,
André Hernich
,
Nicole Schweikardt
Journal of the ACM
56
(3), 2009, pp. 12: 1-58
Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
Venkatesan Guruswami
,
Christopher Umans
,
Salil Vadhan
Journal of the ACM
56
(4), 2009, pp. 20: 1-34
A property of quantum relative entropy with an application to privacy in quantum communication
Rahul Jain
,
Jaikumar Radhakrishnan
,
Pranab Sen
Journal of the ACM
56
(6), 2009, pp. 33: 1-32
Graph partitioning using single commodity flows
Rohit Khandekar
,
Satish Rao
,
Umesh Vazirani
Journal of the ACM
56
(4), 2009, pp. 19: 1-15
Triangulation and embedding using small sets of beacons
Jon Kleinberg
,
Aleksandrs Slivkins
,
Tom Wexler
Journal of the ACM
56
(6), 2009, pp. 32: 1-37
Empirical hardness models: Methodology and a case study on combinatorial auctions
Kevin Leyton-Brown
,
Eugene Nudelman
,
Yoav Shoham
Journal of the ACM
56
(4), 2009, pp. 22: 1-52
Improved bounds on the average length of longest common subsequences
George S. Lueker
Journal of the ACM
56
(3), 2009, pp. 17: 1-38
The complexity of online memory checking
Moni Naor
,
Guy N. Rothblum
Journal of the ACM
56
(1), 2009, pp. 2: 1-46
Permuting streaming data using RAMs
Markus Püschel
,
Peter A. Milder
,
James C. Hoe
Journal of the ACM
56
(2), 2009, pp. 10: 1-34
Seiten 1
2
>