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="Goel, Ashish"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Perfect matchings in
O(n\log n)
time in regular bipartite graphs
Ashish Goel
,
Michael Kapralov
,
Sanjeev Khanna
SIAM Journal on Computing
42
(3), 2013, pp. 1392-1404
Pricing for fairness: Distributed resource allocation for multiple objectives
Sung-woo Cho
,
Ashish Goel
Algorithmica
57
(4), 2010, pp. 873-892
Perfect matchings in
O(n\log n)
time in regular bipartite graphs
Ashish Goel
,
Michael Kapralov
,
Sanjeev Khanna
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 39-46
Embedding bounded bandwidth graphs into
l_1
Douglas E. Carroll
,
Ashish Goel
,
Adam Meyerson
Lecture Notes in Computer Science
4051
, 2006, pp. 27-37
Pricing for fairness: Distributed resource allocation for multiple objectives
Sung-woo Cho
,
Ashish Goel
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 197-204
Simultaneous optimization via approximate majorization for concave profits or convex costs
Ashish Goel
,
Adam Meyerson
Algorithmica
44
(4), 2006, pp. 301-323
Source routing and scheduling in packet networks
Matthew Andrews
,
Antonio Fernández
,
Ashish Goel
,
Lisa Zhang
Journal of the ACM
52
(4), 2005, pp. 582-601
Scale-free aggregation in sensor networks
Mihaela Enachescu
,
Ashish Goel
,
Ramesh Govindan
,
Rajeev Motwani
Theoretical Computer Science
344
(1), 2005, pp. 15-29
Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk
Ashish Goel
,
Deborah Estrin
Algorithmica
43
(1-2), 2005, pp. 5-15
An online throughput-competitive algorithm for multicast routing and admission control
Ashish Goel
,
Monika R. Henzinger
,
Serge Plotkin
Journal of Algorithms
55
(1), 2005, pp. 1-20
Instability of FIFO at arbitrarily low rates in the adversarial queueing model
Rajat Bhattacharjee
,
Ashish Goel
,
Zvi Lotker
SIAM Journal on Computing
34
(2), 2004-2005, pp. 318-332
Lower bounds for embedding into distributions over excluded minor graph families
Douglas E. Carroll
,
Ashish Goel
Lecture Notes in Computer Science
3221
, 2004, pp. 146-156
Multi-processor scheduling to minimize flow time with
\epsilon
resource augmentation
Chandra Chekuri
,
Ashish Goel
,
Sanjeev Khanna
,
Amit Kumar
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 363-372
Sharp thresholds for monotone properties in random geometric graphs
Ashish Goel
,
Sanatan Rai
,
Bhaskar Krishnamachari
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 580-586
Scheduling data transfers in a network and the set scheduling problem
Ashish Goel
,
Monika R. Henzinger
,
Serge Plotkin
,
Eva Tardos
Journal of Algorithms
48
(2), 2003, pp. 314-332
Combinatorial optimization problems in self-assembly
Leonard Adleman
,
Qi Cheng
,
Ashish Goel
,
Ming-Deh Huang
,
David Kempe
,
Pablo Moisset de Espanés
,
Paul Wilhelm Karl Rothemund
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 23-32
Running time and program size for self-assembled squares
Leonard Adleman
,
Qi Cheng
,
Ashish Goel
,
Ming-Deh Huang
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, STOC'2001 (Hersonissos, Crete, Greece, July 6-8, 2001)
, 2001, pp. 740-748
Combining fairness with throughput: Online routing with multiple objectives
Ashish Goel
,
Adam Meyerson
,
Serge Plotkin
Journal of Computer and System Sciences
63
(1), 2001, pp. 62-79
Stability of networks and protocols in the adversarial queueing model for packet routing
Ashish Goel
Networks
37
(4), 2001, pp. 219-224
Combining fairness with throughput: Online with multiple objectives
Ashish Goel
,
Adam Meyerson
,
Serge Plotkin
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 670-679
Approximation algorithms for directed Steiner problems
Moses Charikar
,
Chandra Chekuri
,
To-yat Cheung
,
Zuo Dai
,
Ashish Goel
,
Sudipto Guha
,
Ming Li
Journal of Algorithms
33
(1), 1999, pp. 73-91
Scheduling data transfers in a network and the set scheduling problem
Ashish Goel
,
Monika R. Henzinger
,
Serge Plotkin
,
Eva Tardos
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 189-197
Stochastic load balancing and related problems
Ashish Goel
,
Piotr Indyk
misc, 1999, August
Stability of networks and protocols in the adversarial queueing model for packet routing
Ashish Goel
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 911-912
Approximation algorithms for directed Steiner problems
Moses Charikar
,
Chandra Chekuri
,
To-yat Cheung
,
Zuo Dai
,
Ashish Goel
,
Sudipto Guha
,
Ming Li
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98 (San Francisco, California, January 25-27, 1998)
, 1998, pp. 192-200
Seiten 1
2
>