The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Matthew Andrews: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Matthew Andrews, Michel X. Goemans, Lisa Zhang
    Improved Bounds for On-line Load Balancing. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:1-10 [Conf]
  2. Matthew Andrews, Kamesh Munagala
    Online Algorithms for Caching Multimedia Streams. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:64-75 [Conf]
  3. Matthew Andrews
    Hardness of Buy-at-Bulk Network Design. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:115-124 [Conf]
  4. Matthew Andrews, Baruch Awerbuch, Antonio Fernández, Jon M. Kleinberg, Frank Thomson Leighton, Zhiyong Liu
    Universal Stability Results for Greedy Contention-Resolution Protocols. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:380-389 [Conf]
  5. Matthew Andrews, Michael A. Bender, Lisa Zhang
    New Algorithms for the Disk Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:550-559 [Conf]
  6. Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang
    Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:226-244 [Conf]
  7. 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]
  8. Matthew Andrews, Antonio Fernández, Mor Harchol-Balter, Frank Thomson Leighton, Lisa Zhang
    General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate). [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:294-302 [Conf]
  9. Matthew Andrews, Lisa Zhang
    Scheduling Over a Time-Varying User-Dependent Channel with Applications to High Speed Wireless Data. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:293-302 [Conf]
  10. Matthew Andrews, Lisa Zhang
    The Access Network Design Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:40-59 [Conf]
  11. Matthew Andrews, Lisa Zhang
    Wavelength Assignment in Optical Networks with Fixed Fiber Capacity. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:134-145 [Conf]
  12. Matthew Andrews
    Probabilistic End-to-End Delay Bounds for Earliest Deadline First Scheduling. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:603-612 [Conf]
  13. Matthew Andrews
    Maximizing profit in overloaded networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2005, pp:217-224 [Conf]
  14. Matthew Andrews, Sanjeev Khanna, Krishnan Kumaran
    Integrated Scheduling of Unicast and Multicast Traffic in an Input-Queued Switch. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:1144-1151 [Conf]
  15. Matthew Andrews, Lijun Qian, Alexander Stolyar
    Optimal utility based multi-user throughput allocation subject to throughput constraints. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2005, pp:2415-2424 [Conf]
  16. Matthew Andrews, F. Bruce Shepherd, Aravind Srinivasan, Peter Winkler, Francis Zane
    Clustering and Server Selection using Passive Monitoring. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2002, pp:- [Conf]
  17. Matthew Andrews, Milan Vojnovic
    Scheduling reserved traffic in input-queued switches: New delay bounds via probabilistic techniques. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2003, pp:- [Conf]
  18. Matthew Andrews, Lisa Zhang
    Achieving Stability in Networks of Input-Queued Switches. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2001, pp:1673-1679 [Conf]
  19. Matthew Andrews, Lisa Zhang
    Scheduling over non-stationary wireless channels with finite rate sets. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2004, pp:- [Conf]
  20. Matthew Andrews, Lisa Zhang
    Bounds on fiber minimization in optical networks with fixed fiber capacity. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2005, pp:409-419 [Conf]
  21. Matthew Andrews, Lisa Zhang
    Minimizing End-to-End Delay in High-Speed Networks with a Simple Coordinated Schedule. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:380-388 [Conf]
  22. Matthew Andrews, Lisa Zhang
    Routing and scheduling in multihop wireless networks with time-varying channels. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:1031-1040 [Conf]
  23. Matthew Andrews
    Instability of FIFO in session-oriented networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:440-447 [Conf]
  24. Matthew Andrews, Lisa Zhang
    The effects of temporary sessions on network performance. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:448-457 [Conf]
  25. Matthew Andrews, Lisa Zhang
    Scheduling protocols for switches with large envelopes. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:443-452 [Conf]
  26. Matthew Andrews, Frank Thomson Leighton, Panagiotis Takis Metaxas, Lisa Zhang
    Improved Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:52-61 [Conf]
  27. Matthew Andrews, Frank Thomson Leighton, Panagiotis Takis Metaxas, Lisa Zhang
    Automatic Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:257-265 [Conf]
  28. Matthew Andrews, Lisa Zhang
    Hardness of the undirected edge-disjoint paths problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:276-283 [Conf]
  29. Matthew Andrews, Lisa Zhang
    Hardness of the undirected congestion minimization problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:284-293 [Conf]
  30. Matthew Andrews, Lisa Zhang
    Logarithmic hardness of the directed congestion minimization problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:517-526 [Conf]
  31. Matthew Andrews, Lisa Zhang
    Stability Results for Networks with Input and Output Blocking. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:369-377 [Conf]
  32. Matthew Andrews, Lisa Zhang
    Packet Routing with Arbitrary End-to-End Delay Requirements. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:557-565 [Conf]
  33. Kalyan S. Perumalla, Matthew Andrews, Sandeep N. Bhatt
    A Virtual PNNI Network Testbed. [Citation Graph (0, 0)][DBLP]
    Winter Simulation Conference, 1997, pp:1057-1064 [Conf]
  34. Matthew Andrews, Michael A. Bender, Lisa Zhang
    New Algorithms for Disk Scheduling. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:2, pp:277-301 [Journal]
  35. Matthew Andrews, Michel X. Goemans, Lisa Zhang
    Improved Bounds for On-Line Load Balancing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:23, n:4, pp:278-301 [Journal]
  36. Matthew Andrews, Lisa Zhang
    Approximation Algorithms for Access Network Design. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:2, pp:197-215 [Journal]
  37. 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]
  38. Matthew Andrews, Baruch Awerbuch, Antonio Fernández, Frank Thomson Leighton, Zhiyong Liu, Jon M. Kleinberg
    Universal-stability results and performance bounds for greedy contention-resolution protocols. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:1, pp:39-69 [Journal]
  39. 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]
  40. Matthew Andrews, Lisa Zhang
    Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:5, pp:809-834 [Journal]
  41. Matthew Andrews, Lisa Zhang
    Logarithmic hardness of the undirected edge-disjoint paths problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:5, pp:745-761 [Journal]
  42. Matthew Andrews, Lisa Zhang
    Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:52, n:1, pp:57-81 [Journal]
  43. Matthew Andrews
    Instability of FIFO in session-oriented networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:50, n:2, pp:232-245 [Journal]
  44. Matthew Andrews, Lisa Zhang
    Minimizing maximum fiber requirement in optical networks. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:1, pp:118-131 [Journal]
  45. Matthew Andrews, Lisa Zhang
    Scheduling Protocols for Switches with Large Envelopes. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2004, v:7, n:3, pp:171-186 [Journal]
  46. Matthew Andrews, Antonio Fernández, Mor Harchol-Balter, Frank Thomson Leighton, Lisa Zhang
    General Dynamic Routing with Per-Packet Delay Guarantees of O(Distance + 1/Session Rate). [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1594-1623 [Journal]
  47. Matthew Andrews, Frank Thomson Leighton, Panagiotis Takis Metaxas, Lisa Zhang
    Automatic Methods for Hiding Latency in Parallel and Distributed Computation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:615-647 [Journal]
  48. Matthew Andrews, Lisa Zhang
    The Effects of Temporary Sessions on Network Performance. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:3, pp:659-673 [Journal]
  49. Matthew Andrews, Lisa Zhang
    Hardness of the Undirected Congestion Minimization Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:112-131 [Journal]
  50. Kalyan S. Perumalla, Matthew Andrews, Sandeep N. Bhatt
    TED Models for ATM Internetworks. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 1998, v:25, n:4, pp:12-21 [Journal]
  51. Matthew Andrews, Lisa Zhang
    Achieving stability in networks of input-queued switches. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2003, v:11, n:5, pp:848-857 [Journal]
  52. Matthew Andrews, Lisa Zhang
    Scheduling over nonstationary wireless channels with finite rate sets. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2006, v:14, n:5, pp:1067-1077 [Journal]
  53. Matthew Andrews
    Load Balancing in the Internet with Strict Delay Constraints. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:1280-1288 [Conf]
  54. Matthew Andrews, Aleksandrs Slivkins
    Oscillations with TCP-Like Flow Control in Networks of Queues. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  55. Matthew Andrews, Lisa Zhang
    Complexity of Wavelength Assignment in Optical Network Optimization. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  56. Matthew Andrews, Jin Cao, Jim McGowan
    Measuring Human Satisfaction in Data Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  57. Matthew Andrews
    Instability of FIFO in the permanent sessions model at arbitrarily small network loads. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:219-228 [Conf]
  58. Matthew Andrews, Kyomin Jung, Alexander Stolyar
    Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:145-154 [Conf]
  59. Matthew Andrews, Lisa Zhang
    Routing and scheduling in multihop wireless networks with time-varying channels. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:3, pp:- [Journal]

  60. Creating Templates to Achieve Low Delay in Multi-Carrier Frame-Based Wireless Data Systems. [Citation Graph (, )][DBLP]


  61. Satisfying Arbitrary Delay Requirements in Multihop Networks. [Citation Graph (, )][DBLP]


  62. Joint Scheduling and Congestion Control in Mobile Ad-Hoc Networks. [Citation Graph (, )][DBLP]


  63. Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory. [Citation Graph (, )][DBLP]


  64. Multiserver Scheduling with Contiguity Constraints. [Citation Graph (, )][DBLP]


  65. Routing and Scheduling for Energy and Delay Minimization in the Powerdown Model. [Citation Graph (, )][DBLP]


  66. Minimizing End-to-End Delay in Wireless Networks Using a Coordinated EDF Schedule. [Citation Graph (, )][DBLP]


  67. Routing for Energy Minimization in the Speed Scaling Model. [Citation Graph (, )][DBLP]


  68. Scheduling algorithms for multi-carrier wireless data systems. [Citation Graph (, )][DBLP]


  69. Optimization via communication networks. [Citation Graph (, )][DBLP]


  70. Distributed dynamic control of multi-hop wireless networks: From theory to practice. [Citation Graph (, )][DBLP]


  71. Oscillations with TCP-like Flow Control in Networks of Queues [Citation Graph (, )][DBLP]


  72. Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) [Citation Graph (, )][DBLP]


  73. Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002