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]

  • Pach, Joaanos
    • TR-369-92 - Layout of Rooted Trees [26] (1992)
  • Pai, Vivek
    • TR-826-08 - Language Support for Processing Ad Hoc Data [27] (2008)
    • TR-793-07 - On the Effectiveness of Simultaneous Multithreading on Network Server Workloads [28] (2007)
    • TR-792-07 - Do Commodity SMT Processors Need More OS Research? [29] (2007)
    • TR-791-07 - Finding Speed Bumps: Web Server Performance Analysis and Anomaly Detection via Wide-Spectrum Microbenchmarking [30] (2007)
    • TR-742-06 - Misconfigured DNS Entries Lead to Inaccurate Topology Mapping [31] (2006)
    • TR-694-04 - The Origins of Network Server Latency and the Myth of Connection [32] (2004)
    • TR-690-04 - CoDNS: Masking DNS Delays via Cooperative Lookups [33] (2004)
    • TR-670-03 - Making the ``Box'' Transparent: System Call Performance as a First-class Result [34] (2003)
    • TR-654-02 - The Effectiveness of Request Redirection on CDN Robustness [35] (2002)
  • Paige, R.
    • TR-268-90 - More Efficient Bottom-Up Tree Pattern Matching [36] (1990)
  • Paige, Robert
    • TR-038-86 - Three Partition Refinement Algorithms [37] (1986)
  • Palacios, Jose L.
    • TR-221-89 - Random Walk Techniques for Protocol Validation [38] (1989)
  • Palios, Leonidas
    • TR-368-92 - Decomposition Problems in Computational Geometry (Thesis) [39] (1992)
    • TR-227-89 - Triangulating A Nonconvex Polytope [40] (1989)
  • Pall, Daniel
    • TR-812-08 - Faster Packet Forwarding in a Scalable Ethernet Architecture [41] (2008)
  • Panduranga, E.S.
    • TR-122-87 - Reflections in Curved Surfaces (thesis) [42] (1987)
  • Pang, Ruoming
    • TR-821-08 - Towards Understanding Application Semantics of Network Traffic (thesis) [43] (2008)
    • TR-658-02 - Defensive Programming: Using an Annotation Toolkit to Build Dos-Resistant Software [44] (2002)
  • Paris, Sylvain
    • TR-907-11 - Dynamic Hair Capture [45] (2011)
  • Park, Arvin
    • TR-127-87 - A Shared Memory Architecture for Distributed Computing (thesis) [46] (1987)
    • TR-088-87 - The Processor Identity Problem [47] (1987)
    • TR-075-87 - Performance Through Memory [48] (1987)
    • TR-074-87 - IOStone: A Synthetic File System Performance Benchmark [49] (1987)
    • TR-067-86 - Models and Measurements of File System Performance [50] (1986)
    • TR-057-86 - Providing Fault Tolerance In Parallel Storage Systems [51] (1986)
    • TR-048-86 - Improved Sorting Algorithms for Parallel Computers [52] (1986)
    • TR-046-86 - Optimal Parallel Sorting on a Linear Processor Array [53] (1986)
    • TR-042-86 - Array Access Bound for Block Storage Memory Systems [54] (1986)
    • TR-036-86 - Massive Memory Means Massive Performance [55] (1986)
    • TR-017-85 - Design of an Interleaved Massive Memory Machine [56] (1985)
  • Park, Christopher
    • TR-971-14 - Computational Functional Genomics for Directing Biological Discoveries [57] (2014)
  • Park, KyoungSoo
    • TR-772-07 - Towards Highly Reliable and Scalable Distributed Systems (thesis) [58] (2007)
    • TR-690-04 - CoDNS: Masking DNS Delays via Cooperative Lookups [33] (2004)
  • Parks, T.W.
    • TR-278-90 - METEOR: A Constraint-based FIR Filter Design Program [59] (1990)
  • Pauly, Mark
    • TR-907-11 - Dynamic Hair Capture [45] (2011)
  • Pedram, Massoud
    • TR-934-12 - Scaffold: Quantum Programming Language [60] (2012)
  • Pellacini, Fabio
    • TR-726-05 - Lighting with Paint [61] (2005)
  • Pellauer, Michael
    • TR-981-15 - ArMOR: Defending Against Memory Consistency Model Mismatches in Heterogeneous Architectures [62] (2015)
  • Penry, David
    • TR-767-06 - The Acceleration of Structural Microarchitectural Simulation via Scheduling (thesis) [63] (2006)
  • Pereira, Thiago
    • TR-993-15 - New methods for the computational fabrication of appearance [64] (2015)
  • Perez Botero, Diego
    • TR-960-13 - Pwnetizer: Improving Availability in Cloud Computing through Fast Cloning and I/O Randomization [65] (2013)
    • TR-926-12 - Live Migration of an Entire Network (and its Hosts) [66] (2012)
  • Perry, Frances
    • TR-831-08 - Reasoning about Software in the Presence of Transient Faults – Complete Proofs [note change] [67] (2008)
    • TR-830-08 - Reasoning about Software in the Presence of Transient Faults (thesis) [68] (2008)
    • TR-799-07 - Reasoning about Control Flow in the Presence of Transient Faults [69] (2007)
    • TR-776-07 - Fault-tolerant Typed Assembly Language [70] (2007)
  • Petersen, Karin
    • TR-431-93 - Operating System Support for Modern Memory Hierarchies (Thesis) [71] (1993)
    • TR-401-92 - An Evaluation of Multiprocessor Cache Coherence Based on Virtual Memory Support [72] (1992)
    • TR-400-92 - Cache Coherence for Shared Memory Multiprocessors Based on Virtual Memory Support [73] (1992)
    • TR-373-92 - A Comparative Evaluation of Cache Coherence Schemes Based on Virtual Memory Support [74] (1992)
    • TR-307-91 - Evaluation of Memory System Extensions [75] (1991)
  • Peterson, Larry
    • TR-912-11 - VICCI: A Programmable Cloud-Computing Research Testbed [76] (2011)
    • TR-755-06 - Experiences Building PlanetLab [77] (2006)
    • TR-712-04 - Scalable Routing Overlay Networks [78] (2004)
    • TR-690-04 - CoDNS: Masking DNS Delays via Cooperative Lookups [33] (2004)
    • TR-668-03 - A Divert Mechanism for Service Overlays [79] (2003)
    • TR-666-02 - MSB: Media Streaming Booster [80] (2002)
    • TR-658-02 - Defensive Programming: Using an Annotation Toolkit to Build Dos-Resistant Software [44] (2002)
    • TR-654-02 - The Effectiveness of Request Redirection on CDN Robustness [35] (2002)
    • TR-645-02 - Maximum Packet Rates for Full-Duplex Ethernet [81] (2002)
    • TR-643-02 - Measuring the Web Using a Versatile Meta Information Crawler [82] (2002)
    • TR-642-02 - Intelligent Devices as Symmetric Partners for End--to--end Data Flows [83] (2002)
    • TR-641-02 - Snow on Silk: A NodeOS in the Linux Kernel [84] (2002)
    • TR-632-01 - Probabilistic Packet Scheduling: Achieving Proportional Share Bandwidth Allocation [85] (2001)
    • TR-628-00 - Understanding TCP Vegas: A Duality Model* [86] (2000)
    • TR-626-00 - Evaluating Network Processors in IP Forwarding [87] (2000)
    • TR-616-00 - Understanding TCP Vegas: Theory and Practice* [88] (2000)
    • TR-615-00 - Scheduling Computations on a Programmable Router [89] (2000)
    • TR-611-99 - The Role of Virtual Time in Real-time Scheduling [90] (1999)
    • TR-605-99 - TCP mechanisms for Diff-Serv Architecture [91] (1999)
    • TR-602-99 - BERT: A Scheduler for Best Effort and Realtime Tasks - revised [92] (1999)
    • TR-598-99 - Inter-AS Traffic Patterns and Their Implications [93] (1999)
    • TR-588-98 - Defending Against Denial of Service Attacks in Scout [94] (1998)
    • TR-587-98 - BERT: A Scheduler for Best Effort and Realtime Tasks [95] (1998)
  • Philbin, James
    • TR-570-97 - Design and Implementation of Virtual Memory-Mapped Communication on Myrinet [96] (1997)
    • TR-569-96 - Thread Scheduling for Cache Locality [97] (1996)
  • Pike, Rob
    • TR-174-88 - A Library for Incremental Update of Bitmap Images [98] (1988)
  • Pinter, Ron Y.
    • TR-218-89 - Decreasing Channel Width Bounds by Channel Widening [99] (1989)
  • Pittelli, Frank
    • TR-076-87 - Recovery in a Triple Modular Redundant Database System [100] (1987)
    • TR-073-87 - Distributed Computing Research at Princeton - 1986 [101] (1987)
    • TR-029-86 - Distributed Computing Research at Princeton - 1985 [102] (1986)
    • TR-028-86 - Reliable Scheduling in a TMR Database System [103] (1986)
    • TR-002-85 - Database Processing with Triple Modular Redundancy [104] (1985)
  • Plank, James S.
    • TR-543-97 - CLIP: A Checkpointing Tool for Message-Passing Parallel Programs [105] (1997)
    • TR-406-93 - Efficient Checkpointing on MIMD Architectures (thesis) [106] (1993)
    • TR-316-91 - Checkpointing Multicomputer Applications [107] (1991)
    • TR-239-89 - Real-Time, Concurrent Checkpoint for Parallel Programs [108] (1989)
  • Podmayersky, Brandon
    • TR-903-11 - An Incremental Deployment Strategy for Serval [109] (2011)
  • Podolak, Joshua
    • TR-840-08 - The Symmetry Transform and its Applications (thesis) [110] (2008)
    • TR-782-07 - Symmetry-Aware Mesh Processing [111] (2007)
  • Pollack, Richard
    • TR-288-90 - Counting and Cutting Cycles of Lines and Rods in Space [112] (1990)
  • Polyzois, Christos A.
    • TR-371-92 - Disaster Recovery for Transaction Processing Systems (Thesis) [113] (1992)
    • TR-359-92 - Evaluation of Remote Backup Algorithms for Transaction Processing Systems [114] (1992)
    • TR-354-91 - Processing of Read-Only Queries at a Remote Backup [115] (1991)
    • TR-248-90 - Two Epoch Algorithms for Disaster Recovery [116] (1990)
    • TR-219-89 - Telematics Research at Princeton - 1988 [117] (1989)
    • TR-198-88 - Management of a Remote Backup Copy for Disaster Recovery [118] (1988)
  • Porter, Daryl
    • TR-215-89 - A Probabilistic Relational Data Model [119] (1989)
    • TR-147-88 - Supporting Probabilistic Data in a Relational System [120] (1988)
    • TR-090-87 - Some Thoughts on Probabilistic Databases [121] (1987)
  • Potrebic, Peter
    • TR-029-86 - Distributed Computing Research at Princeton - 1985 [102] (1986)
    • TR-018-86 - A Load Balancing Implementation for a Local Area Network of Workstations [122] (1986)
  • Prabhu, Prakash
    • TR-951-13 - Semantic Language Extensions for Implicit Parallel Programming [123] (2013)
  • Praun, Emil
    • TR-593-99 - Robust Mesh Watermarking [124] (1999)
  • Pree, Wolfgang
    • TR-613-99 - UML-F: A Modeling Language for Object-Oriented Frameworks [125] (1999)
  • Proebsting, Todd A.
    • TR-386-92 - Engineering Efficient Code Generators Using Tree Matching and Dynamic Programming [126] (1992)

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

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-369-92
[27] https://www.cs.princeton.edu/research/techreps/TR-826-08
[28] https://www.cs.princeton.edu/research/techreps/TR-793-07
[29] https://www.cs.princeton.edu/research/techreps/TR-792-07
[30] https://www.cs.princeton.edu/research/techreps/TR-791-07
[31] https://www.cs.princeton.edu/research/techreps/TR-742-06
[32] https://www.cs.princeton.edu/research/techreps/TR-694-04
[33] https://www.cs.princeton.edu/research/techreps/TR-690-04
[34] https://www.cs.princeton.edu/research/techreps/TR-670-03
[35] https://www.cs.princeton.edu/research/techreps/TR-654-02
[36] https://www.cs.princeton.edu/research/techreps/TR-268-90
[37] https://www.cs.princeton.edu/research/techreps/TR-038-86
[38] https://www.cs.princeton.edu/research/techreps/TR-221-89
[39] https://www.cs.princeton.edu/research/techreps/TR-368-92
[40] https://www.cs.princeton.edu/research/techreps/TR-227-89
[41] https://www.cs.princeton.edu/research/techreps/TR-812-08
[42] https://www.cs.princeton.edu/research/techreps/TR-122-87
[43] https://www.cs.princeton.edu/research/techreps/TR-821-08
[44] https://www.cs.princeton.edu/research/techreps/TR-658-02
[45] https://www.cs.princeton.edu/research/techreps/TR-907-11
[46] https://www.cs.princeton.edu/research/techreps/TR-127-87
[47] https://www.cs.princeton.edu/research/techreps/TR-088-87
[48] https://www.cs.princeton.edu/research/techreps/TR-075-87
[49] https://www.cs.princeton.edu/research/techreps/TR-074-87
[50] https://www.cs.princeton.edu/research/techreps/TR-067-86
[51] https://www.cs.princeton.edu/research/techreps/TR-057-86
[52] https://www.cs.princeton.edu/research/techreps/TR-048-86
[53] https://www.cs.princeton.edu/research/techreps/TR-046-86
[54] https://www.cs.princeton.edu/research/techreps/TR-042-86
[55] https://www.cs.princeton.edu/research/techreps/TR-036-86
[56] https://www.cs.princeton.edu/research/techreps/TR-017-85
[57] https://www.cs.princeton.edu/research/techreps/TR-971-14
[58] https://www.cs.princeton.edu/research/techreps/TR-772-07
[59] https://www.cs.princeton.edu/research/techreps/TR-278-90
[60] https://www.cs.princeton.edu/research/techreps/TR-934-12
[61] https://www.cs.princeton.edu/research/techreps/TR-726-05
[62] https://www.cs.princeton.edu/research/techreps/TR-981-15
[63] https://www.cs.princeton.edu/research/techreps/TR-767-06
[64] https://www.cs.princeton.edu/research/techreps/TR-993-15
[65] https://www.cs.princeton.edu/research/techreps/TR-960-13
[66] https://www.cs.princeton.edu/research/techreps/TR-926-12
[67] https://www.cs.princeton.edu/research/techreps/TR-831-08
[68] https://www.cs.princeton.edu/research/techreps/TR-830-08
[69] https://www.cs.princeton.edu/research/techreps/TR-799-07
[70] https://www.cs.princeton.edu/research/techreps/TR-776-07
[71] https://www.cs.princeton.edu/research/techreps/TR-431-93
[72] https://www.cs.princeton.edu/research/techreps/TR-401-92
[73] https://www.cs.princeton.edu/research/techreps/TR-400-92
[74] https://www.cs.princeton.edu/research/techreps/TR-373-92
[75] https://www.cs.princeton.edu/research/techreps/TR-307-91
[76] https://www.cs.princeton.edu/research/techreps/TR-912-11
[77] https://www.cs.princeton.edu/research/techreps/TR-755-06
[78] https://www.cs.princeton.edu/research/techreps/TR-712-04
[79] https://www.cs.princeton.edu/research/techreps/TR-668-03
[80] https://www.cs.princeton.edu/research/techreps/TR-666-02
[81] https://www.cs.princeton.edu/research/techreps/TR-645-02
[82] https://www.cs.princeton.edu/research/techreps/TR-643-02
[83] https://www.cs.princeton.edu/research/techreps/TR-642-02
[84] https://www.cs.princeton.edu/research/techreps/TR-641-02
[85] https://www.cs.princeton.edu/research/techreps/TR-632-01
[86] https://www.cs.princeton.edu/research/techreps/TR-628-00
[87] https://www.cs.princeton.edu/research/techreps/TR-626-00
[88] https://www.cs.princeton.edu/research/techreps/TR-616-00
[89] https://www.cs.princeton.edu/research/techreps/TR-615-00
[90] https://www.cs.princeton.edu/research/techreps/TR-611-99
[91] https://www.cs.princeton.edu/research/techreps/TR-605-99
[92] https://www.cs.princeton.edu/research/techreps/TR-602-99
[93] https://www.cs.princeton.edu/research/techreps/TR-598-99
[94] https://www.cs.princeton.edu/research/techreps/TR-588-98
[95] https://www.cs.princeton.edu/research/techreps/TR-587-98
[96] https://www.cs.princeton.edu/research/techreps/TR-570-97
[97] https://www.cs.princeton.edu/research/techreps/TR-569-96
[98] https://www.cs.princeton.edu/research/techreps/TR-174-88
[99] https://www.cs.princeton.edu/research/techreps/TR-218-89
[100] https://www.cs.princeton.edu/research/techreps/TR-076-87
[101] https://www.cs.princeton.edu/research/techreps/TR-073-87
[102] https://www.cs.princeton.edu/research/techreps/TR-029-86
[103] https://www.cs.princeton.edu/research/techreps/TR-028-86
[104] https://www.cs.princeton.edu/research/techreps/TR-002-85
[105] https://www.cs.princeton.edu/research/techreps/TR-543-97
[106] https://www.cs.princeton.edu/research/techreps/TR-406-93
[107] https://www.cs.princeton.edu/research/techreps/TR-316-91
[108] https://www.cs.princeton.edu/research/techreps/TR-239-89
[109] https://www.cs.princeton.edu/research/techreps/TR-903-11
[110] https://www.cs.princeton.edu/research/techreps/TR-840-08
[111] https://www.cs.princeton.edu/research/techreps/TR-782-07
[112] https://www.cs.princeton.edu/research/techreps/TR-288-90
[113] https://www.cs.princeton.edu/research/techreps/TR-371-92
[114] https://www.cs.princeton.edu/research/techreps/TR-359-92
[115] https://www.cs.princeton.edu/research/techreps/TR-354-91
[116] https://www.cs.princeton.edu/research/techreps/TR-248-90
[117] https://www.cs.princeton.edu/research/techreps/TR-219-89
[118] https://www.cs.princeton.edu/research/techreps/TR-198-88
[119] https://www.cs.princeton.edu/research/techreps/TR-215-89
[120] https://www.cs.princeton.edu/research/techreps/TR-147-88
[121] https://www.cs.princeton.edu/research/techreps/TR-090-87
[122] https://www.cs.princeton.edu/research/techreps/TR-018-86
[123] https://www.cs.princeton.edu/research/techreps/TR-951-13
[124] https://www.cs.princeton.edu/research/techreps/TR-593-99
[125] https://www.cs.princeton.edu/research/techreps/TR-613-99
[126] https://www.cs.princeton.edu/research/techreps/TR-386-92