Andrea S. LaPaugh

Affiliations:
  • Princeton University, USA


According to our database1, Andrea S. LaPaugh authored at least 25 papers between 1980 and 2013.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2013
Enabling Author-Centric Ranking of Web Content.
Proceedings of the 16th International Workshop on the Web and Databases 2013, 2013

2005
Estimating the maximum.
J. Algorithms, 2005

2003
Subscription-Enhanced Content Delivery.
Proceedings of the Web Content Caching and Distribution, 8th International Workshop, 2003

Content Distribution for Publish/Subscribe Services.
Proceedings of the Middleware 2003, 2003

2002
Predicting category accesses for a user in a structured information space.
Proceedings of the SIGIR 2002: Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2002

Categorizing information objects from user access patterns.
Proceedings of the 2002 ACM CIKM International Conference on Information and Knowledge Management, 2002

1999
VLSI Layout Algorithms.
Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998
Finding All Minimal Shapes in a Routing Channel.
Algorithmica, 1998

1997
Rotation scheduling: a loop pipelining algorithm.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1997

Case Study in Algorithms: VLSI Layout.
Proceedings of the Computer Science and Engineering Handbook, 1997

1996
Layout Algorithms for VLSI deisgn.
ACM Comput. Surv., 1996

1994
Minimizing Channel Density by Lateral Shifting of Components.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993
Recontamination Does Not Help to Search a Graph.
J. ACM, 1993

1992
How to Store a Triangular Matrix.
IEEE Trans. Computers, 1992

1991
Editors' Introduction.
Algorithmica, 1991

CLOVER: A Timing Constraints Verification System.
Proceedings of the 28th Design Automation Conference, 1991

1990
Issues in synthesis of board-level systems.
Proceedings of the First International Workshop on Rapid System Prototyping, 1990

1985
Scheduling File Transfers.
SIAM J. Comput., 1985

1984
The even-path problem for graphs and digraphs.
Networks, 1984

1983
Scheduling File Transfers in a Distributed Network.
Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, 1983

Total Fault Testing Using the Bipartite Transformation.
Proceedings of the Proceedings International Test Conference 1983, 1983

Optimal choice of intermediate latching to maximize throughput in VLSI circuits.
Proceedings of the IEEE International Conference on Acoustics, 1983

Total stuct-at-fault testing by circuit transformation.
Proceedings of the 20th Design Automation Conference, 1983

1980
The Subgraph Homeomorphism Problem.
J. Comput. Syst. Sci., 1980

A Polynomial Time Algorithm for Optimal Routing around a Rectangle (Extended Abstract)
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980


  Loading...