# Lisa Zhang

According to our database

^{1}, Lisa Zhang## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2018

Inference in Probabilistic Graphical Models by Graph Neural Networks.

CoRR, 2018

Reviving and Improving Recurrent Back-Propagation.

CoRR, 2018

Learning deep structured active contours end-to-end.

CoRR, 2018

A unified clustering approach for identifying functional zones in suburban and urban areas.

Proceedings of the IEEE INFOCOM 2018, 2018

Reviving and Improving Recurrent Back-Propagation.

Proceedings of the 35th International Conference on Machine Learning, 2018

2017

Utility optimization in heterogeneous networks via CSMA-based algorithms.

Wireless Networks, 2017

Egalitarian Graph Orientations.

J. Graph Algorithms Appl., 2017

Extracting mobile user behavioral similarity via cell-level location trace.

Proceedings of the 2017 IEEE Conference on Computer Communications Workshops, 2017

2016

Minimum-Cost Network Design with (Dis)economies of Scale.

SIAM J. Comput., 2016

Improving robustness of next-hop routing.

J. Comb. Optim., 2016

Computing road signatures from cell sequences with minimum inconsistencies.

Proceedings of the IEEE Conference on Computer Communications Workshops, 2016

Tracking mobile users via standard routing engines.

Proceedings of the 2016 Annual Conference on Information Science and Systems, 2016

2015

Rate-Adaptive Scheduling Policies for Network Stability and Energy Efficiency.

IEEE/ACM Trans. Netw., 2015

Analysis of k-anonymity algorithms for streaming location data.

Proceedings of the 2015 IEEE Conference on Computer Communications Workshops, 2015

Sparsifying network topologies for application guidance.

Proceedings of the IFIP/IEEE International Symposium on Integrated Network Management, 2015

2014

Rate-adaptive weighted fair queueing for energy-aware scheduling.

Inf. Process. Lett., 2014

Improving Robustness of Next-Hop Routing.

CoRR, 2014

2013

Routing and scheduling for energy and delay minimization in the powerdown model.

Networks, 2013

Energy-Delay Tradeoffs in a Load-Balanced Router

CoRR, 2013

Utility optimization in heterogeneous networks via CSMA-based algorithms.

Proceedings of the 11th International Symposium and Workshops on Modeling and Optimization in Mobile, 2013

Worst-case delay bounds for uniform load-balanced switch fabrics.

Proceedings of IEEE International Conference on Communications, 2013

Collector-based cell reordering in load-balanced switch fabrics.

Proceedings of the IEEE 14th International Conference on High Performance Switching and Routing, 2013

Hierarchical community decomposition via oblivious routing techniques.

Proceedings of the Conference on Online Social Networks, 2013

2012

Routing for Power Minimization in the Speed Scaling Model.

IEEE/ACM Trans. Netw., 2012

Egalitarian Graph Orientations

CoRR, 2012

Multi-Carrier Multi-Rate Utility Optimization in Heterogeneous Networks via CSMA-Based Algorithms

CoRR, 2012

Scheduling algorithms for optimizing the tradeoffs between delay, queue size and energy.

Proceedings of the 46th Annual Conference on Information Sciences and Systems, 2012

Energy-delay tradeoffs in a load-balanced router.

Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011

Scheduling algorithms for multicarrier wireless data systems.

IEEE/ACM Trans. Netw., 2011

Approximation algorithms for grooming in optical network design.

Theor. Comput. Sci., 2011

Buy-at-Bulk Network Design with Protection.

Math. Oper. Res., 2011

Energy-aware scheduling algorithms for network stability.

Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010

Designing multihop wireless backhaul networks with delay guarantees.

Wireless Networks, 2010

Creating templates to achieve low delay in multi-carrier frame-based wireless data systems.

Wireless Networks, 2010

Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)

CoRR, 2010

Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs.

Combinatorica, 2010

Routing for Energy Minimization in the Speed Scaling Model.

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Routing and Scheduling for Energy and Delay Minimization in the Powerdown Model.

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Minimum-Cost Network Design with (Dis)economies of Scale.

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009

Complexity of wavelength assignment in optical network optimization.

IEEE/ACM Trans. Netw., 2009

A note on generalized rank aggregation.

Inf. Process. Lett., 2009

Approximation Algorithms for Grooming in Optical Network Design.

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Multiserver Scheduling with Contiguity Constraints.

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008

Path decomposition under a new cost measure with applications to optical network design.

ACM Trans. Algorithms, 2008

Exact algorithms for the master ring problem.

Networks, 2008

Almost-tight hardness of directed congestion minimization.

J. ACM, 2008

Approximation Algorithms for Scheduling Real-Time Multicast Flows in Wireless LANs.

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

Creating Templates to Achieve Low Delay in Multi-Carrier Frame-Based Wireless Data Systems.

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

Satisfying Arbitrary Delay Requirements in Multihop Networks.

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007

Routing and scheduling in multihop wireless networks with time-varying channels.

ACM Trans. Algorithms, 2007

Hardness of the Undirected Congestion Minimization Problem.

SIAM J. Comput., 2007

Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs.

Electronic Colloquium on Computational Complexity (ECCC), 2007

Scheduling algorithms for multi-carrier wireless data systems.

Proceedings of the 13th Annual International Conference on Mobile Computing and Networking, 2007

Heuristics for Fiber Installation in Optical Network Optimization.

Proceedings of the Global Communications Conference, 2007

Buy-at-Bulk Network Design with Protection.

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006

Scheduling over nonstationary wireless channels with finite rate sets.

IEEE/ACM Trans. Netw., 2006

Evaluation of SiGe: C HBT intrinsic reliability using conventional and step stress methodologies.

Microelectronics Reliability, 2006

Minimizing maximum fiber requirement in optical networks.

J. Comput. Syst. Sci., 2006

Logarithmic hardness of the undirected edge-disjoint paths problem.

J. ACM, 2006

Design tools for transparent optical networks.

Bell Labs Technical Journal, 2006

Admission control for multihop wireless backhaul networks with QoS support.

Proceedings of the IEEE Wireless Communications and Networking Conference, 2006

Logarithmic hardness of the directed congestion minimization problem.

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Designing Multihop Wireless Backhaul Networks with Delay Guarantees.

Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

Complexity of Wavelength Assignment in Optical Network Optimization.

Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

2005

Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data.

J. ACM, 2005

Source routing and scheduling in packet networks.

J. ACM, 2005

The new paradigm for wireless network optimization: a synergy of automated processes and human intervention.

IEEE Communications Magazine, 2005

Guest Editor's Introduction.

Algorithmica, 2005

Hardness of the undirected congestion minimization problem.

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Hardness of the undirected edge-disjoint paths problem.

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Bounds on fiber minimization in optical networks with fixed fiber capacity.

Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion.

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004

The Effects of Temporary Sessions on Network Performance.

SIAM J. Comput., 2004

Scheduling Protocols for Switches with Large Envelopes.

J. Scheduling, 2004

Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule.

J. Algorithms, 2004

Routing and scheduling in multihop wireless networks with time-varying channels.

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Scheduling over non-stationary wireless channels with finite rate sets.

Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

Wavelength Assignment in Optical Networks with Fixed Fiber Capacity.

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Path Decomposition Under a New Cost Measure with Applications to Optical Network Design.

Proceedings of the Algorithms, 2004

2003

Achieving stability in networks of input-queued switches.

IEEE/ACM Trans. Netw., 2003

Wavelength assignment and generalized interval graph coloring.

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

An improved FPTAS for Restricted Shortest Path.

Inf. Process. Lett., 2002

Source Routing and Scheduling in Packet Networks

CoRR, 2002

Fast, Fair and Frugal Bandwidth Allocation in ATM Networks.

Algorithmica, 2002

Approximation Algorithms for Access Network Design.

Algorithmica, 2002

New Algorithms for Disk Scheduling.

Algorithmica, 2002

Scheduling protocols for switches with large envelopes.

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Scheduling Over a Time-Varying User-Dependent Channel with Applications to High Speed Wireless Data.

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001

A cycle augmentation algorithm for minimum cost multicommodity flows on a ring.

Discrete Applied Mathematics, 2001

Managing Software Reuse Economics: An Integrated ROI-based Model.

Ann. Software Eng., 2001

Achieving Stability in Networks of Input-Queued Switches.

Proceedings of the Proceedings IEEE INFOCOM 2001, 2001

Source Routing and Scheduling in Packet Networks.

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

General Dynamic Routing with Per-Packet Delay Guarantees of

*O*(Distance + 1/Session Rate).
SIAM J. Comput., 2000

The effects of temporary sessions on network performance.

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

QoS Routing with Performance-Dependent Costs.

Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

Tracking, predicting and assessing software reuse costs: an automated tool.

Proceedings of the 22nd International Conference on on Software Engineering, 2000

An integrated cost model for software reuse.

Proceedings of the 22nd International Conference on on Software Engineering, 2000

Blocking probability estimates in a partitioned sector TDMA system.

Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2000), 2000

1999

Automatic Methods for Hiding Latency in Parallel and Distributed Computation.

SIAM J. Comput., 1999

Improved Bounds for On-Line Load Balancing.

Algorithmica, 1999

Packet Routing with Arbitrary End-to-End Delay Requirements.

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Fast, Fair, and Frugal Bandwidth Allocation in ATM Networks.

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Minimizing End-to-End Delay in High-Speed Networks with a Simple Coordinated Schedule.

Proceedings of the Proceedings IEEE INFOCOM '99, 1999

1998

Stability Results for Networks with Input and Output Blocking.

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

The Access Network Design Problem.

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems.

Inf. Comput., 1997

General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate).

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

Automatic Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract).

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems.

SPAA, 1996

Improved Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract).

SPAA, 1996

New Algorithms for the Disk Scheduling Problem.

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Improved Bounds for On-line Load Balancing.

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996