The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ashish Goel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Thomas W. Page Jr., Richard G. Guy, John S. Heidemann, David Ratner, Peter L. Reiher, Ashish Goel, Geoffrey H. Kuenning, Gerald J. Popek
    Perspectives on Optimistically Replicated, Peer-to-Peer Filing. [Citation Graph (1, 0)][DBLP]
    Softw., Pract. Exper., 1998, v:28, n:2, pp:155-180 [Journal]
  2. Mihaela Enachescu, Ashish Goel, Ramesh Govindan, Rajeev Motwani
    Scale Free Aggregation in Sensor Networks. [Citation Graph (0, 0)][DBLP]
    ALGOSENSORS, 2004, pp:71-84 [Conf]
  3. Ashish Goel, Swarup Bhunia, Hamid Mahmoodi-Meimand, Kaushik Roy
    Low-overhead design of soft-error-tolerant scan flip-flops with enhanced-scan capability. [Citation Graph (0, 0)][DBLP]
    ASP-DAC, 2006, pp:665-670 [Conf]
  4. Sung-woo Cho, Ashish Goel
    Bandwidth Allocation in Networks: A Single Dual Update Subroutine for Multiple Objectives. [Citation Graph (0, 0)][DBLP]
    CAAN, 2004, pp:28-41 [Conf]
  5. Mihaela Enachescu, Ashish Goel, Ramesh Govindan, Rajeev Motwani
    Aggregating Correlated Data in Sensor Networks. [Citation Graph (0, 0)][DBLP]
    CAAN, 2004, pp:1-2 [Conf]
  6. Ho-Lin Chen, Ashish Goel
    Error Free Self-assembly Using Error Prone Tiles. [Citation Graph (0, 0)][DBLP]
    DNA, 2004, pp:62-75 [Conf]
  7. Douglas E. Carroll, Ashish Goel
    Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:146-156 [Conf]
  8. Matthew Andrews, Antonio Fernández, Ashish Goel, Lisa Zhang
    Source Routing and Scheduling in Packet Networks. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:168-177 [Conf]
  9. Rajat Bhattacharjee, Ashish Goel
    Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:160-167 [Conf]
  10. Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge A. Plotkin
    Approximating a Finite Metric by a Small Number of Tree Metrics. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:379-388 [Conf]
  11. Ashish Goel, Piotr Indyk
    Stochastic Load Balancing and Related Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:579-586 [Conf]
  12. Douglas E. Carroll, Ashish Goel, Adam Meyerson
    Embedding Bounded Bandwidth Graphs into l1. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:27-37 [Conf]
  13. Ashish Goel, Cyrus Shahabi, Shu-Yuen Didi Yao, Roger Zimmermann
    SCADDAR: An Efficient Randomized Technique to Reorganize Continuous Media Blocks. [Citation Graph (0, 0)][DBLP]
    ICDE, 2002, pp:473-0 [Conf]
  14. Shang-Tse Chuang, Ashish Goel, Nick McKeown, Balaji Prabhakar
    Matching Output Queueing with a Combined Input Output Queued Switch. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:1169-1178 [Conf]
  15. Abhimanyu Das, Debojyoti Dutta, Ahmed Helmy, Ashish Goel, John S. Heidemann
    Low-state fairness: lower bounds and practical enforcement. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2005, pp:2436-2446 [Conf]
  16. Debojyoti Dutta, Ashish Goel, John S. Heidemann
    Oblivious AQM and Nash Equilibria. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2003, pp:- [Conf]
  17. Debojyoti Dutta, Ashish Goel, John S. Heidemann
    Towards Protocol Equilibrium with Oblivious Routers. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2004, pp:- [Conf]
  18. Ashish Goel, Michael Mitzenmacher
    Exact sampling of TCP Window States. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2002, pp:- [Conf]
  19. Ashish Goel, K. G. Ramakrishnan, Deepak Kataria, Dimitris Logothetis
    Efficient Computation of Delay-sensitive Routes from One Source to All Destinations. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2001, pp:854-858 [Conf]
  20. Gang Lu, Narayanan Sadagopan, Bhaskar Krishnamachari, Ashish Goel
    Delay efficient sleep scheduling in wireless sensor networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2005, pp:2470-2481 [Conf]
  21. Hui Zhang 0002, Ashish Goel, Ramesh Govindan
    Using the Small-World Model to Improve Freenet Performance. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2002, pp:- [Conf]
  22. Zoë Abrams, Ashish Goel, Serge A. Plotkin
    Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. [Citation Graph (0, 0)][DBLP]
    IPSN, 2004, pp:424-432 [Conf]
  23. Debojyoti Dutta, Ashish Goel, John S. Heidemann
    Faster Network Design with Scenario Pre-Filtering. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 2002, pp:237-246 [Conf]
  24. Ashish Goel, Sudipto Guha, Kamesh Munagala
    Asking the right questions: model-driven optimization using probes. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:203-212 [Conf]
  25. Sung-woo Cho, Ashish Goel
    Exact Sampling in Machine Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:202-210 [Conf]
  26. Gagan Aggarwal, Ashish Goel, Rajeev Motwani
    Truthful auctions for pricing search keywords. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2006, pp:1-7 [Conf]
  27. Rishi Bhargava, Ashish Goel, Adam Meyerson
    Using approximate majorization to characterize protocol fairness. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS/Performance, 2001, pp:330-331 [Conf]
  28. Hui Zhang 0002, Ashish Goel, Ramesh Govindan
    Incrementally improving lookup latency in distributed hash table systems. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 2003, pp:114-125 [Conf]
  29. Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li
    Approximation Algorithms for Directed Steiner Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:192-200 [Conf]
  30. Ho-Lin Chen, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, Pablo Moisset de Espanés
    Invadable self-assembly: combining robustness with efficiency. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:890-899 [Conf]
  31. Ashish Goel
    Stability of Networks and Protocols in the Adversarial Queueing Model for Packet Routing. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:911-912 [Conf]
  32. Ashish Goel, Deborah Estrin
    Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:499-505 [Conf]
  33. Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin
    Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:97-106 [Conf]
  34. Ashish Goel, Piotr Indyk, Kasturi R. Varadarajan
    Reductions among high dimensional proximity problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:769-778 [Conf]
  35. Ashish Goel, Kamesh Munagala
    Balancing Steiner trees and shortest path trees online. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:562-563 [Conf]
  36. Ashish Goel, Adam Meyerson, Serge A. Plotkin
    Approximate majorization and fair online load balancing. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:384-390 [Conf]
  37. Ashish Goel, Adam Meyerson, Serge A. Plotkin
    Distributed admission control, scheduling, and routing with stale information. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:611-619 [Conf]
  38. Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang
    Running time and program size for self-assembled squares. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:740-748 [Conf]
  39. Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, David Kempe, Pablo Moisset de Espanés, Paul W. K. Rothemund
    Combinatorial optimization problems in self-assembly. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:23-32 [Conf]
  40. Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha
    Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-Median. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:114-123 [Conf]
  41. Chandra Chekuri, Ashish Goel, Sanjeev Khanna, Amit Kumar
    Multi-processor scheduling to minimize flow time with epsilon resource augmentation. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:363-372 [Conf]
  42. Sung-woo Cho, Ashish Goel
    Pricing for fairness: distributed resource allocation for multiple objectives. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:197-204 [Conf]
  43. Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos
    Scheduling Data Transfers in a Network and the Set Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:189-197 [Conf]
  44. Ashish Goel, Adam Meyerson, Serge A. Plotkin
    Combining fairness with throughput: online routing with multiple objectives. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:670-679 [Conf]
  45. Ashish Goel, Sanatan Rai, Bhaskar Krishnamachari
    Sharp thresholds For monotone properties in random geometric graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:580-586 [Conf]
  46. Hui Zhang 0002, Ashish Goel, Ramesh Govindan, Kahn Mason, Benjamin Van Roy
    Making Eigenvector-Based Reputation Systems Robust to Collusion. [Citation Graph (0, 0)][DBLP]
    WAW, 2004, pp:92-104 [Conf]
  47. Ashish Goel, Deborah Estrin
    Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:43, n:1-2, pp:5-15 [Journal]
  48. Ashish Goel, Kamesh Munagala
    Extending Greedy Multicast Routing to Delay Sensitive Applications. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:3, pp:335-352 [Journal]
  49. Ashish Goel, Adam Meyerson
    Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:4, pp:301-323 [Journal]
  50. Hui Zhang 0002, Ashish Goel, Ramesh Govindan
    An empirical evaluation of internet latency expansion. [Citation Graph (0, 0)][DBLP]
    Computer Communication Review, 2004, v:35, n:1, pp:93-97 [Journal]
  51. Debojyoti Dutta, Ashish Goel, John S. Heidemann
    Oblivious AQM and nash equilibria. [Citation Graph (0, 0)][DBLP]
    Computer Communication Review, 2002, v:32, n:3, pp:20- [Journal]
  52. Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick McKeown, Tim Roughgarden
    Part III: routers with very small buffers. [Citation Graph (0, 0)][DBLP]
    Computer Communication Review, 2005, v:35, n:3, pp:83-90 [Journal]
  53. Hui Zhang 0002, Ashish Goel, Ramesh Govindan
    Using the small-world model to improve freenet performance. [Citation Graph (0, 0)][DBLP]
    Computer Communication Review, 2002, v:32, n:1, pp:79- [Journal]
  54. Hui Zhang 0002, Ashish Goel, Ramesh Govindan
    Using the small-world model to improve Freenet performance. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2004, v:46, n:4, pp:555-574 [Journal]
  55. Zoë Abrams, Ashish Goel, Serge A. Plotkin
    Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  56. Matthew Andrews, Antonio Fernández, Ashish Goel, Lisa Zhang
    Source Routing and Scheduling in Packet Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  57. Ashish Goel, Sanatan Rai, Bhaskar Krishnamachari
    Sharp thresholds for monotone properties in random geometric graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  58. Matthew Andrews, Antonio Fernández, Ashish Goel, Lisa Zhang
    Source routing and scheduling in packet networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:4, pp:582-601 [Journal]
  59. Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li
    Approximation Algorithms for Directed Steiner Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:33, n:1, pp:73-91 [Journal]
  60. Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin
    An online throughput-competitive algorithm for multicast routing and admission control. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:55, n:1, pp:1-20 [Journal]
  61. Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin, Éva Tardos
    Scheduling data transfers in a network and the set scheduling problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:2, pp:314-332 [Journal]
  62. Ashish Goel, Adam Meyerson, Serge A. Plotkin
    Combining Fairness with Throughput: Online Routing with Multiple Objectives. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:1, pp:62-79 [Journal]
  63. Fang Bian, Ashish Goel, Cauligi S. Raghavendra, Xin Li
    Energy-Efficient Broadcasting in Wireless ad hoc Networks Lower Bounds and Algorithms. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2002, v:3, n:3-4, pp:149-166 [Journal]
  64. Ashish Goel
    Stability of networks and protocols in the adversarial queueing model for packet routing. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:37, n:4, pp:219-224 [Journal]
  65. Rajat Bhattacharjee, Ashish Goel, Zvi Lotker
    Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:2, pp:318-332 [Journal]
  66. Ashish Goel, Adam Meyerson, Serge A. Plotkin
    Approximate majorization and fair online load balancing. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:2, pp:338-349 [Journal]
  67. Mihaela Enachescu, Ashish Goel, Ramesh Govindan, Rajeev Motwani
    Scale-free aggregation in sensor networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:344, n:1, pp:15-29 [Journal]
  68. Hui Zhang 0002, Ashish Goel, Ramesh Govindan
    Improving lookup latency in distributed hash table systems using random sampling. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2005, v:13, n:5, pp:1121-1134 [Journal]
  69. Amin Firoozshahian, Vahideh Manshadi, Ashish Goel, Balaji Prabhakar
    Efficient, Fully Local Algorithms for CIOQ Switches. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:2491-2495 [Conf]
  70. Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick McKeown, Tim Roughgarden
    Routers with Very Small Buffers. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  71. Rajat Bhattacharjee, Ashish Goel
    Algorithms and incentives for robust ranking. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:425-433 [Conf]

  72. An alternate design paradigm for robust spin-torque transfer magnetic RAM (STT MRAM) from circuit/architecture perspective. [Citation Graph (, )][DBLP]


  73. Renewable, Time-Responsive DNA Logic Gates for Scalable Digital Circuits. [Citation Graph (, )][DBLP]


  74. Toward Minimum Size Self-Assembled Counters. [Citation Graph (, )][DBLP]


  75. An Oblivious O(1)-Approximation for Single Source Buy-at-Bulk. [Citation Graph (, )][DBLP]


  76. Reducing Maximum Stretch in Compact Routing. [Citation Graph (, )][DBLP]


  77. On the Network Coding Advantage for Wireless Multicast in Euclidean Space. [Citation Graph (, )][DBLP]


  78. Obtaining High Throughput in Networks with Tiny Buffers. [Citation Graph (, )][DBLP]


  79. Small subset queries and bloom filters using ternary associative memories, with applications. [Citation Graph (, )][DBLP]


  80. Similarity search and locality sensitive hashing using ternary content addressable memories. [Citation Graph (, )][DBLP]


  81. Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities. [Citation Graph (, )][DBLP]


  82. Dimension augmentation and combinatorial criteria for efficient error-resistant DNA self-assembly. [Citation Graph (, )][DBLP]


  83. The ratio index for budgeted learning, with applications. [Citation Graph (, )][DBLP]


  84. Perfect matchings via uniform sampling in regular bipartite graphs. [Citation Graph (, )][DBLP]


  85. Perfect matchings in o(n log n) time in regular bipartite graphs. [Citation Graph (, )][DBLP]


  86. Hybrid keyword search auctions. [Citation Graph (, )][DBLP]


  87. An incentive-based architecture for social recommendations. [Citation Graph (, )][DBLP]


  88. Hybrid Keyword Search Auctions [Citation Graph (, )][DBLP]


  89. Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families [Citation Graph (, )][DBLP]


  90. The Ratio Index for Budgeted Learning, with Applications [Citation Graph (, )][DBLP]


  91. Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs [Citation Graph (, )][DBLP]


  92. Perfect Matchings in Õ(n1.5) Time in Regular Bipartite Graphs [Citation Graph (, )][DBLP]


  93. An Oblivious O(1)-Approximation for Single Source Buy-at-Bulk [Citation Graph (, )][DBLP]


  94. Perfect Matchings in O(n \log n) Time in Regular Bipartite Graphs [Citation Graph (, )][DBLP]


  95. One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk [Citation Graph (, )][DBLP]


  96. Graph Sparsification via Refinement Sampling [Citation Graph (, )][DBLP]


  97. Fast Incremental and Personalized PageRank over Distributed Main Memory Databases [Citation Graph (, )][DBLP]


  98. Similarity Search and Locality Sensitive Hashing using TCAMs [Citation Graph (, )][DBLP]


  99. Liquidity in Credit Networks: A Little Trust Goes a Long Way [Citation Graph (, )][DBLP]


Search in 1.235secs, Finished in 1.239secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002