Published on Computer Science Department at Princeton University (https://www.cs.princeton.edu)

Home > Research > Technical Reports > Technical Reports for Author

Display by author:
A [1] | B [2] | C [3] | D [4] | E [5] | F [6] | G [7] | H [8] | I [9] | J [10] | K [11] | L [12] | M [13] | N [14] | O [15] | P [16] | Q [17] | R [18] | S [19] | T [20] | U | V [21] | W [22] | X [23] | Y [24] | Z [25]

  • Walker, David
    • TR-994-15 - Compiling Path Queries [26] (2015)
  • Wallace, Grant
    • TR-707-04 - A Multi-Cursor X Window Manager Supporting Control Room Collaboration [27] (2004)
  • Wallach, Dan S.
    • TR-657-02 - Reading Between the Lines: Lessons from the SDMI Challenge [28] (2002)
    • TR-566-97 - Java Security: Web Browsers and Beyond [29] (1997)
    • TR-546-97 - Extensible Security Architectures for Java [30] (1997)
    • TR-540-96 - Web Spoofing: An Internet Con Game [31] (1996)
    • TR-501-95 - Security Flaws in the HotJava Web Browser [32] (1995)
  • Wang, Chong
    • TR-933-12 - Hierarchical Bayesian Modeling: Efficient Inference and Applications [33] (2012)
  • Wang, Daniel C.
    • TR-715-04 - Safe Heterogeneous Applications: Curing the Java Native Interface [34] (2004)
    • TR-647-02 - JVM TCB: Measurements of the Trusted Computing Base of Java Virtual Machines [35] (2002)
    • TR-640-01 - Managing Memory with Types (Thesis) [36] (2001)
    • TR-624-00 - Type-Preserving Garbage Collectors (Extended Version) [37] (2000)
    • TR-609-99 - Safe Garbage Collection = Regions + Intensional Type Analysis [38] (1999)
    • TR-554-97 - The Zephyr Abstract Syntax Description Language [39] (1997)
  • Wang, Ge
    • TR-824-08 - The ChucK Audio Programming Language "A Strongly-timed and On-the-Fly Environ/mentality" [40] (2008)
  • Wang, Jia
    • TR-877-10 - Scalable Flow-Based Networking with DIFANE [41] (2010)
  • Wang, Limin
    • TR-680-03 - Building Robust Network Services Through Efficient Resource Management (Thesis) [42] (2003)
    • TR-666-02 - MSB: Media Streaming Booster [43] (2002)
    • TR-654-02 - The Effectiveness of Request Redirection on CDN Robustness [44] (2002)
    • TR-628-00 - Understanding TCP Vegas: A Duality Model* [45] (2000)
    • TR-616-00 - Understanding TCP Vegas: Theory and Practice* [46] (2000)
    • TR-590-99 - Thread Scheduling for Out-of-Core Applications with Memory Server on Multicomputers [47] (1999)
  • Wang, Randolph Y.
    • TR-723-05 - The Digital StudyHall [48] (2005)
    • TR-710-04 - Nicephorus: Striking a Balance between the Recovery Capability and the Overhead of Byzantine Detection [49] (2004)
    • TR-709-04 - Opt and Vent: An Efficient Protocol for Byzantine Detection in Wireless Ad Hoc Network Routing [50] (2004)
    • TR-705-04 - Networking Going Postal [51] (2004)
    • TR-703-04 - SkipIndex: Towards a Scalable Peer-to-Peer Index Service for High Dimensional Data [52] (2004)
    • TR-691-04 - Postmanet: Turning the Postal System into a Generic Digital Communication Mechanism [53] (2004)
    • TR-688-04 - Turning the Postal System into a Generic Digital Communication Mechanism [54] (2004)
    • TR-685-03 - Distance Learning Technologies for Basic Education in Disadvantaged Areas [55] (2003)
    • TR-672-03 - Coherent and Network-Aware Tracking of Objects [56] (2003)
    • TR-664-02 - A Peer-to-Peer Mobile Storage System [57] (2002)
    • TR-632-01 - Probabilistic Packet Scheduling: Achieving Proportional Share Bandwidth Allocation [58] (2001)
    • TR-612-99 - MimdRAID: Low Latency Secondary Storage [59] (1999)
  • Wang, Richard
    • TR-899-11 - Openflow-Based Load Balancing Gone Wild (MSE thesis) [60] (2011)
  • Wang, Yi
    • TR-858-09 - A Principled Approach to Managing Routing in Large ISP Networks [61] (2009)
    • TR-844-08 - Neighbor-Specific BGP: More Flexible Routing Policies Without Sacrificing Global Stability [62] (2008)
    • TR-827-08 - Atomic Routing Theory: Making an AS Route Like a Single Node [63] (2008)
    • TR-802-07 - Morpheus: Enabling Flexible Interdomain Routing Policies [64] (2007)
    • TR-784-07 - Morpheus: Making Routing Programmable [65] (2007)
  • Wang, Yida
    • TR-985-16 - Incremental Full Correlation Matrix Analysis for Real-Time fMRI Studies [66] (2016)
  • Wang, Yingfei
    • TR-001-17 - Advances in decision-making under uncertainty: inference, finite-time analysis, and health applications [67] (2017)
  • Wang, Yong
    • TR-790-07 - Situation-Aware Optimizations in Challenged Networks [68] (2007)
  • Wang, Zhe
    • TR-916-11 - Similarity Search with Multimodal Data [69] (2011)
    • TR-760-06 - Analysis of Filtering for Similarity Search Using Sketches [70] (2006)
    • TR-759-06 - A Time-Space Efficient Locality Sensitive Hashing Method for Similarity Search in High Dimensions [71] (2006)
    • TR-690-04 - CoDNS: Masking DNS Delays via Cooperative Lookups [72] (2004)
  • Washburn, Geoffrey
    • TR-717-05 - Analyzing Polymorphic Advice [73] (2005)
  • Waters, Brent R.
    • TR-700-04 - Puzzle Outsourcing for IP-Level DoS Resistance [74] (2004)
    • TR-667-03 - Secure, Private Proofs of Location [75] (2003)
  • Watson, Arthur
    • TR-528-96 - Structured Testing: Analysis and Extensions (Thesis) [76] (1996)
    • TR-015-85 - Embedding Computation in One-Dimensional Automata by Phase Coding Solitons [77] (1985)
  • Wawrzoniak, Mike
    • TR-668-03 - A Divert Mechanism for Service Overlays [78] (2003)
    • TR-642-02 - Intelligent Devices as Symmetric Partners for End--to--end Data Flows [79] (2002)
    • TR-641-02 - Snow on Silk: A NodeOS in the Linux Kernel [80] (2002)
  • Wei, Victor K.
    • TR-004-85 - A Locally Adaptive Data Compression Scheme [81] (1985)
  • Weirich, Stephanie
    • TR-717-05 - Analyzing Polymorphic Advice [73] (2005)
  • Weise, Thibaut
    • TR-907-11 - Dynamic Hair Capture [82] (2011)
  • Weiss, Mark Allen
    • TR-137-88 - Tight Lower Bounds for Shellsort [83] (1988)
    • TR-098-87 - Lower Bounds for Shellsort (thesis) [84] (1987)
  • Welsh, J. Douglas
    • TR-020-86 - The Total DNA Homology Experiment [85] (1986)
  • Welzl, Emo
    • TR-290-90 - Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems [86] (1990)
  • Wendell, Patrick
    • TR-868-09 - Decentralized Server Selection Through Joint Proximity and Load Optimization [87] (2009)
  • Werneck, Renato
    • TR-750-06 - Design and Analysis of Data Structures for Dynamic Trees [88] (2006)
  • Westbrook, Jeffrey
    • TR-243-90 - Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph [89] (1990)
    • TR-229-89 - Algorithms and Data Structures for Dynamic Graph Problems (thesis) [90] (1989)
    • TR-228-89 - Maintaining Bridge-Connected and Biconnected Components Online [91] (1989)
    • TR-103-87 - Amortized Analysis of Algorithms for Set Union with Backtracking [92] (1987)
  • Weyrich, Tim
    • TR-874-10 - Multi-Feature Matching of Fresco Fragments [93] (2010)
  • Widman, Lawrence
    • TR-365-92 - Nonlinear Heart Model Predicts the Range of Heart Rates for Electrical Alternans in Pericardial Effusion [94] (1992)
  • Wigderson, Avi
    • TR-232-89 - On the Second Eigenvalue of Hypergraphs [95] (1989)
  • Wilfong, Gordon T.
    • TR-847-09 - Routers of the AS, Unite! Guaranteeing a Network Realizes Its Routing Policy [96] (2009)
    • TR-049-86 - One-Processor Scheduling of Tasks with Preferred Starting Times [97] (1986)
  • Wilks, Allan R.
    • TR-054-86 - Robust Contour Tracing [98] (1986)
  • Willke, Ted
    • TR-983-15 - Optimizing Full Correlation Matrix Analysis of fMRI Data on Intel R Xeon PhiTM Coprocessors [99] (2015)
  • Willke, Theodore
    • TR-985-16 - Incremental Full Correlation Matrix Analysis for Real-Time fMRI Studies [66] (2016)
    • TR-018-18 - Scheduling Computation Graphs of Deep Learning Models on Manycore CPUs [100] (2018)
  • Wirth, Anthony
    • TR-716-04 - Approximation Algorithms for Clustering (Thesis) [101] (2004)
  • Wood, David A.
    • TR-535-96 - Relaxed Consistency and Coherence Granularity in DSM Systems: A Performance Evaluation [102] (1996)
    • TR-464-94 - Application-Specific Protocols for User-Level Shared Memory [103] (1994)
  • Wortman, David
    • TR-210-89 - Shared Virtual Memory Accomodating Heterogeneity [104] (1989)
  • Wright, Rebecca N.
    • TR-823-08 - Rationality and Traffic Attraction: Incentives for Honest Path Announcements in BGP [105] (2008)
  • Wu, Dinghao
    • TR-733-05 - Interfacing Compilers, Proof Checkers, and Proofs for Foundational Proof-Carrying Code [106] (2005)
  • Wu, Min
    • TR-657-02 - Reading Between the Lines: Lessons from the SDMI Challenge [28] (2002)
  • Wu, Qiang
    • TR-753-06 - Architectural and Compiler Techniques for Microprocessor Power and Performance Management [107] (2006)

Source URL: https://www.cs.princeton.edu/research/techreps/author_letter/W

Links
[1] https://www.cs.princeton.edu/research/techreps/author_letter/A
[2] https://www.cs.princeton.edu/research/techreps/author_letter/B
[3] https://www.cs.princeton.edu/research/techreps/author_letter/C
[4] https://www.cs.princeton.edu/research/techreps/author_letter/D
[5] https://www.cs.princeton.edu/research/techreps/author_letter/E
[6] https://www.cs.princeton.edu/research/techreps/author_letter/F
[7] https://www.cs.princeton.edu/research/techreps/author_letter/G
[8] https://www.cs.princeton.edu/research/techreps/author_letter/H
[9] https://www.cs.princeton.edu/research/techreps/author_letter/I
[10] https://www.cs.princeton.edu/research/techreps/author_letter/J
[11] https://www.cs.princeton.edu/research/techreps/author_letter/K
[12] https://www.cs.princeton.edu/research/techreps/author_letter/L
[13] https://www.cs.princeton.edu/research/techreps/author_letter/M
[14] https://www.cs.princeton.edu/research/techreps/author_letter/N
[15] https://www.cs.princeton.edu/research/techreps/author_letter/O
[16] https://www.cs.princeton.edu/research/techreps/author_letter/P
[17] https://www.cs.princeton.edu/research/techreps/author_letter/Q
[18] https://www.cs.princeton.edu/research/techreps/author_letter/R
[19] https://www.cs.princeton.edu/research/techreps/author_letter/S
[20] https://www.cs.princeton.edu/research/techreps/author_letter/T
[21] https://www.cs.princeton.edu/research/techreps/author_letter/V
[22] https://www.cs.princeton.edu/research/techreps/author_letter/W
[23] https://www.cs.princeton.edu/research/techreps/author_letter/X
[24] https://www.cs.princeton.edu/research/techreps/author_letter/Y
[25] https://www.cs.princeton.edu/research/techreps/author_letter/Z
[26] https://www.cs.princeton.edu/research/techreps/TR-994-15
[27] https://www.cs.princeton.edu/research/techreps/TR-707-04
[28] https://www.cs.princeton.edu/research/techreps/TR-657-02
[29] https://www.cs.princeton.edu/research/techreps/TR-566-97
[30] https://www.cs.princeton.edu/research/techreps/TR-546-97
[31] https://www.cs.princeton.edu/research/techreps/TR-540-96
[32] https://www.cs.princeton.edu/research/techreps/TR-501-95
[33] https://www.cs.princeton.edu/research/techreps/TR-933-12
[34] https://www.cs.princeton.edu/research/techreps/TR-715-04
[35] https://www.cs.princeton.edu/research/techreps/TR-647-02
[36] https://www.cs.princeton.edu/research/techreps/TR-640-01
[37] https://www.cs.princeton.edu/research/techreps/TR-624-00
[38] https://www.cs.princeton.edu/research/techreps/TR-609-99
[39] https://www.cs.princeton.edu/research/techreps/TR-554-97
[40] https://www.cs.princeton.edu/research/techreps/TR-824-08
[41] https://www.cs.princeton.edu/research/techreps/TR-877-10
[42] https://www.cs.princeton.edu/research/techreps/TR-680-03
[43] https://www.cs.princeton.edu/research/techreps/TR-666-02
[44] https://www.cs.princeton.edu/research/techreps/TR-654-02
[45] https://www.cs.princeton.edu/research/techreps/TR-628-00
[46] https://www.cs.princeton.edu/research/techreps/TR-616-00
[47] https://www.cs.princeton.edu/research/techreps/TR-590-99
[48] https://www.cs.princeton.edu/research/techreps/TR-723-05
[49] https://www.cs.princeton.edu/research/techreps/TR-710-04
[50] https://www.cs.princeton.edu/research/techreps/TR-709-04
[51] https://www.cs.princeton.edu/research/techreps/TR-705-04
[52] https://www.cs.princeton.edu/research/techreps/TR-703-04
[53] https://www.cs.princeton.edu/research/techreps/TR-691-04
[54] https://www.cs.princeton.edu/research/techreps/TR-688-04
[55] https://www.cs.princeton.edu/research/techreps/TR-685-03
[56] https://www.cs.princeton.edu/research/techreps/TR-672-03
[57] https://www.cs.princeton.edu/research/techreps/TR-664-02
[58] https://www.cs.princeton.edu/research/techreps/TR-632-01
[59] https://www.cs.princeton.edu/research/techreps/TR-612-99
[60] https://www.cs.princeton.edu/research/techreps/TR-899-11
[61] https://www.cs.princeton.edu/research/techreps/TR-858-09
[62] https://www.cs.princeton.edu/research/techreps/TR-844-08
[63] https://www.cs.princeton.edu/research/techreps/TR-827-08
[64] https://www.cs.princeton.edu/research/techreps/TR-802-07
[65] https://www.cs.princeton.edu/research/techreps/TR-784-07
[66] https://www.cs.princeton.edu/research/techreps/TR-985-16
[67] https://www.cs.princeton.edu/research/techreps/TR-001-17
[68] https://www.cs.princeton.edu/research/techreps/TR-790-07
[69] https://www.cs.princeton.edu/research/techreps/TR-916-11
[70] https://www.cs.princeton.edu/research/techreps/TR-760-06
[71] https://www.cs.princeton.edu/research/techreps/TR-759-06
[72] https://www.cs.princeton.edu/research/techreps/TR-690-04
[73] https://www.cs.princeton.edu/research/techreps/TR-717-05
[74] https://www.cs.princeton.edu/research/techreps/TR-700-04
[75] https://www.cs.princeton.edu/research/techreps/TR-667-03
[76] https://www.cs.princeton.edu/research/techreps/TR-528-96
[77] https://www.cs.princeton.edu/research/techreps/TR-015-85
[78] https://www.cs.princeton.edu/research/techreps/TR-668-03
[79] https://www.cs.princeton.edu/research/techreps/TR-642-02
[80] https://www.cs.princeton.edu/research/techreps/TR-641-02
[81] https://www.cs.princeton.edu/research/techreps/TR-004-85
[82] https://www.cs.princeton.edu/research/techreps/TR-907-11
[83] https://www.cs.princeton.edu/research/techreps/TR-137-88
[84] https://www.cs.princeton.edu/research/techreps/TR-098-87
[85] https://www.cs.princeton.edu/research/techreps/TR-020-86
[86] https://www.cs.princeton.edu/research/techreps/TR-290-90
[87] https://www.cs.princeton.edu/research/techreps/TR-868-09
[88] https://www.cs.princeton.edu/research/techreps/TR-750-06
[89] https://www.cs.princeton.edu/research/techreps/TR-243-90
[90] https://www.cs.princeton.edu/research/techreps/TR-229-89
[91] https://www.cs.princeton.edu/research/techreps/TR-228-89
[92] https://www.cs.princeton.edu/research/techreps/TR-103-87
[93] https://www.cs.princeton.edu/research/techreps/TR-874-10
[94] https://www.cs.princeton.edu/research/techreps/TR-365-92
[95] https://www.cs.princeton.edu/research/techreps/TR-232-89
[96] https://www.cs.princeton.edu/research/techreps/TR-847-09
[97] https://www.cs.princeton.edu/research/techreps/TR-049-86
[98] https://www.cs.princeton.edu/research/techreps/TR-054-86
[99] https://www.cs.princeton.edu/research/techreps/TR-983-15
[100] https://www.cs.princeton.edu/research/techreps/TR-018-18
[101] https://www.cs.princeton.edu/research/techreps/TR-716-04
[102] https://www.cs.princeton.edu/research/techreps/TR-535-96
[103] https://www.cs.princeton.edu/research/techreps/TR-464-94
[104] https://www.cs.princeton.edu/research/techreps/TR-210-89
[105] https://www.cs.princeton.edu/research/techreps/TR-823-08
[106] https://www.cs.princeton.edu/research/techreps/TR-733-05
[107] https://www.cs.princeton.edu/research/techreps/TR-753-06