The following pages link to Lisa Zhang (Q187145):
Displaying 44 items.
- (Q234027) (redirect page) (← links)
- Improving robustness of next-hop routing (Q266050) (← links)
- Approximation algorithms for grooming in optical network design (Q551206) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- Approximation algorithms for access network design (Q699765) (← links)
- A note on generalized rank aggregation (Q989442) (← links)
- Efficient execution of nondeterministic parallel programs on asynchronous systems (Q1383149) (← links)
- Fast, fair and frugal bandwidth allocation in ATM networks (Q1601032) (← links)
- An improved FPTAS for Restricted Shortest Path. (Q1853085) (← links)
- Information, inattention, perception, and discounting (Q2056462) (← links)
- Rate-adaptive weighted fair queueing for energy-aware scheduling (Q2446067) (← links)
- Scheduling protocols for switches with large envelopes (Q2464416) (← links)
- Minimizing maximum fiber requirement in optical networks (Q2581759) (← links)
- Packet routing with arbitrary end-to-end delay requirements (Q2819587) (← links)
- Logarithmic hardness of the directed congestion minimization problem (Q2931414) (← links)
- Buy-at-Bulk Network Design with Protection (Q3169130) (← links)
- Almost-tight hardness of directed congestion minimization (Q3452193) (← links)
- Logarithmic hardness of the undirected edge-disjoint paths problem (Q3455215) (← links)
- Minimum-Cost Network Design with (Dis)economies of Scale (Q3464060) (← links)
- Exact algorithms for the master ring problem (Q3528154) (← links)
- Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data (Q3546281) (← links)
- Routing and scheduling in multihop wireless networks with time-varying channels (Q3580945) (← links)
- Hardness of the undirected edge-disjoint paths problem (Q3581428) (← links)
- Hardness of the undirected congestion minimization problem (Q3581429) (← links)
- (Q4228478) (← links)
- (Q4252277) (← links)
- (Q4471379) (← links)
- (Q4542555) (← links)
- The Effects of Temporary Sessions on Network Performance (Q4651487) (← links)
- Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule (Q4828564) (← links)
- (Q4828966) (← links)
- Automatic Methods for Hiding Latency in Parallel and Distributed Computation (Q4943758) (← links)
- (Q4952651) (← links)
- Path decomposition under a new cost measure with applications to optical network design (Q4962708) (← links)
- Egalitarian Graph Orientations (Q5278053) (← links)
- Routing and scheduling for energy and delay minimization in the powerdown model (Q5326790) (← links)
- Hardness of the Undirected Congestion Minimization Problem (Q5454245) (← links)
- Algorithms – ESA 2004 (Q5464613) (← links)
- Automata, Languages and Programming (Q5466456) (← links)
- (Q5485320) (← links)
- (Q5501367) (← links)
- A cycle augmentation algorithm for minimum cost multicommodity flows on a ring (Q5936466) (← links)
- New algorithms for disk scheduling (Q5957577) (← links)
- Managing software reuse economics: An integrated ROI-based model (Q5960729) (← links)
