A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version). - Michael Luby; Prabhakar Ragde (ICALP, 1985)

One, Two, Three dots Infinity: Lower Bounds for Parallel Computation - Faith E. Fich; Friedhelm Meyer auf der Heide; Prabhakar Ragde; Avi Wigderson (STOC, 1985)

Simulations Among Concurrent-Write PRAMs. - Faith E. Fich; Prabhakar Ragde; Avi Wigderson (Algorithmica, 1988)

Relations Between Concurrent-Write Models of Parallel Computation. - Faith E. Fich; Prabhakar Ragde; Avi Wigderson (SIAM J. Comput., 1988)

The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)). - Prabhakar Ragde; William L. Steiger; Endre Szemerédi; Avi Wigderson (SIAM J. Discret. Math., 1988)

A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior. - Michael Luby; Prabhakar Ragde (Algorithmica, 1989)

On Separating the Erew and Crew Pram Models. - Eli Gafni; Joseph Naor; Prabhakar Ragde (Theor. Comput. Sci., 1989)

On the Power of Concurrent-Write PRAMs With Read-Only Memory - Faith E. Fich; Ming Li 001; Prabhakar Ragde; Yaacov Yesha (Inf. Comput., 1989)

Perfect Hashing, Graph Entropy, and Circuit Complexity. - Ilan Newman; Prabhakar Ragde; Avi Wigderson (SCT, 1990)

Incomparability in parallel computation. - Vince Grolmusz; Prabhakar Ragde (Discret. Appl. Math., 1990)

Analysis of an Asynchronous PRAM Algorithm. - Prabhakar Ragde (Inf. Process. Lett., 1991)

Linear-Size Constant-Depth Polylog-Treshold Circuits. - Prabhakar Ragde; Avi Wigderson (Inf. Process. Lett., 1991)

Extracting Poetry from Technical Paper s. - Prabhakar Ragde (SIGACT News, 1991)

Processor-Time Tradeoffs in PRAM Simulations. - Prabhakar Ragde (J. Comput. Syst. Sci., 1992)

Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs. - Omer Berkman; Yossi Matias; Prabhakar Ragde (WADS, 1993)

The Parallel Simplicity of Compaction and Chaining. - Prabhakar Ragde (J. Algorithms, 1993)

Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. - Torben Hagerup; Jyrki Katajainen; Naomi Nishimura; Prabhakar Ragde (SODA, 1995)

Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs. - Faith E. Fich; Miroslaw Kowaluk; Miroslaw Kutylowski; Krzysztof Lorys; Prabhakar Ragde (Comput. Complex., 1995)

Parallel Pointer-Based Join Algorithms in Memory-mapped Environments. - Peter A. Buhr; Anil K. Goel; Naomi Nishimura; Prabhakar Ragde (ICDE, 1996)

µDatabase: Parallelism in a Memory-Mapped Environment. - Peter A. Buhr; Anil K. Goel; Naomi Nishimura; Prabhakar Ragde (SPAA, 1996)

Parallel Algorithms with Processor Failures and Delays. - Jonathan F. Buss; Paris C. Kanellakis; Prabhakar Ragde; Alexander A. Shvartsman (J. Algorithms, 1996)

Pointers versus Arithmetic in PRAMs. - Patrick W. Dymond; Faith E. Fich; Naomi Nishimura; Prabhakar Ragde; Walter L. Ruzzo (J. Comput. Syst. Sci., 1996)

Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains. - Omer Berkman; Yossi Matias; Prabhakar Ragde (J. Algorithms, 1998)

Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth. - Torben Hagerup; Jyrki Katajainen; Naomi Nishimura; Prabhakar Ragde (J. Comput. Syst. Sci., 1998)

Complexity Theory and Algorithms. - Friedhelm Meyer auf der Heide; Miroslaw Kutylowski; Prabhakar Ragde (Euro-Par, 2000)

Finding Smallest Supertrees Under Minor Containment. - Naomi Nishimura; Prabhakar Ragde; Dimitrios M. Thilikos (Int. J. Found. Comput. Sci., 2000)

On the Parameterized Complexity of Layered Graph Drawing. - Vida Dujmovic; Michael R. Fellows; Michael T. Hallett; Matthew Kitching; Giuseppe Liotta; Catherine McCartin; Naomi Nishimura; Prabhakar Ragde; Frances A. Rosamond; Matthew Suderman; Sue Whitesides; David R. Wood (ESA, 2001)

A Fixed-Parameter Approach to Two-Layer Planarization. - Vida Dujmovic; Michael R. Fellows; Michael T. Hallett; Matthew Kitching; Giuseppe Liotta; Catherine McCartin; Naomi Nishimura; Prabhakar Ragde; Frances A. Rosamond; Matthew Suderman; Sue Whitesides; David R. Wood (GD, 2001)

Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs. - Mohammad Taghi Hajiaghayi; Naomi Nishimura; Prabhakar Ragde; Dimitrios M. Thilikos (Electron. Notes Discret. Math., 2001)

On Graph Powers for Leaf-Labeled Trees. - Naomi Nishimura; Prabhakar Ragde; Dimitrios M. Thilikos (J. Algorithms, 2002)

On the parameterized complexity of the generalized rush hour puzzle. - Henning Fernau; Torben Hagerup; Naomi Nishimura; Prabhakar Ragde; Klaus Reinhardt (CCCG, 2003)

Smaller Kernels for Hitting Set Problems of Constant Arity. - Naomi Nishimura; Prabhakar Ragde; Dimitrios M. Thilikos (IWPEC, 2004)

Detecting Backdoor Sets with Respect to Horn and Binary Clauses. - Naomi Nishimura; Prabhakar Ragde; Stefan Szeider (SAT, 2004)

Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. - Erik D. Demaine; Mohammad Taghi Hajiaghayi; Naomi Nishimura; Prabhakar Ragde; Dimitrios M. Thilikos (J. Comput. Syst. Sci., 2004)

Parameterized Counting Algorithms for General Graph Covering Problems. - Naomi Nishimura; Prabhakar Ragde; Dimitrios M. Thilikos (WADS, 2005)

Embeddings of k-connected graphs of pathwidth k. - Arvind Gupta; Naomi Nishimura; Andrzej Proskurowski; Prabhakar Ragde (Discret. Appl. Math., 2005)

Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. - Naomi Nishimura; Prabhakar Ragde; Dimitrios M. Thilikos (Discret. Appl. Math., 2005)

A Fixed-Parameter Approach to 2-Layer Planarization. - Vida Dujmovic; Michael R. Fellows; Michael T. Hallett; Matthew Kitching; Giuseppe Liotta; Catherine McCartin; Naomi Nishimura; Prabhakar Ragde; Frances A. Rosamond; Matthew Suderman; Sue Whitesides; David R. Wood (Algorithmica, 2006)

Solving #SAT using vertex covers. - Naomi Nishimura; Prabhakar Ragde; Stefan Szeider (Acta Informatica, 2007)

The chilling descent: making the transition to a conventional curriculum. - Prabhakar Ragde (FDPE@ICFP, 2008)

On the Parameterized Complexity of Layered Graph Drawing. - Vida Dujmovic; Michael R. Fellows; Matthew Kitching; Giuseppe Liotta; Catherine McCartin; Naomi Nishimura; Prabhakar Ragde; Frances A. Rosamond; Sue Whitesides; David R. Wood (Algorithmica, 2008)

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. - Michael R. Fellows; Christian Knauer; Naomi Nishimura; Prabhakar Ragde; Frances A. Rosamond; Ulrike Stege; Dimitrios M. Thilikos; Sue Whitesides (Algorithmica, 2008)

Mathematics Is Imprecise - Prabhakar Ragde (TFPIE, 2012)

OCaml from the Very Beginning, by John Whitington, Coherent Press, 2013, £ 25.99, US $37.99. ISBN-10: 0957671105 (paperback), 204 pp. - Prabhakar Ragde (J. Funct. Program., 2013)

Simple Balanced Binary Search Trees. - Prabhakar Ragde (TFPIE, 2014)

Proust: A Nano Proof Assistant. - Prabhakar Ragde (TFPIE, 2016)

Review of "Algorithms for Functional Programming" by John David Stone, Springer-Verlag, 2018. - Prabhakar Ragde (J. Funct. Program., 2020)