Technical Reports Search
This is an archive of department research. Research published since 2020 is available through arXiv or Mudd Library.
DISPLAY BY AUTHOR:
Reports for Authors (Last name "V")
Venkatesan, Ramarathnam
- TR-515-96 - Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes (1996)
- TR-029-86 - Distributed Computing Research at Princeton - 1985 (1986)
- TR-644-02 - On Hardness and Lower Bounds in Complexity Theory (Thesis) (2002)
- TR-648-02 - A Trustworthy Proof Checker (2002)
- TR-189-88 - Simplified Linear-Time Jordan Sorting and Polygon Clipping (1988)
- TR-157-88 - A Fast Las Vegas Algorithm for Triangulating a Simple Polygon (1988)
- TR-132-88 - A Fast Las Vegas Algorithm for Triangulating a Simple Polygon (1988)
- TR-052-86 - An O(n log log n)-Time Algorithm for Triangulating Simple Polygons (1986)
- TR-051-86 - Decomposition and Intersection of Simple Splinegons (1986)
- TR-935-12 - Beyond Worst-Case Analysis in Approximation Algorithms (2012)
- TR-839-08 - Intelligent Speculation for Pipelined Multithreading (thesis) (2008)
- TR-950-13 - SoftCell: Taking control of Cellular Core Networks (2013)
- TR-934-12 - Scaffold: Quantum Programming Language (2012)
- TR-256-90 - Princeton SystemsFest II (1990)
- TR-224-89 - Princeton SystemsFest Proceedings (1989)