Prabhakar Ragde

Publication Activity (10 Years)

Years Active: 1984-2020
Publications (10 Years): 2

Top Topics

Springer Verlag

Functional Programming

Mathematical Knowledge

Top Venues

J. Funct. Program.

Publications

Prabhakar Ragde
Review of "Algorithms for Functional Programming" by John David Stone, Springer-Verlag, 2018. J. Funct. Program. 30 (2020)
Prabhakar Ragde
Proust: A Nano Proof Assistant. TFPIE (2016)
Prabhakar Ragde
Simple Balanced Binary Search Trees. TFPIE (2014)
Prabhakar Ragde
, by John Whitington, Coherent Press, 2013, £ 25.99, US $37.99. ISBN-10: 0957671105 (paperback), 204 pp. J. Funct. Program. 23 (3) (2013)
Prabhakar Ragde
Mathematics Is Imprecise TFPIE (2012)
Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. Algorithmica 52 (2) (2008)
Prabhakar Ragde
The chilling descent: making the transition to a conventional curriculum. FDPE@ICFP (2008)
Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood
On the Parameterized Complexity of Layered Graph Drawing. Algorithmica 52 (2) (2008)
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
Solving #SAT using vertex covers. Acta Informatica 44 (7-8) (2007)
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
A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica 45 (2) (2006)
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
Solving #SAT Using Vertex Covers. SAT (2006)
Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
. Discret. Appl. Math. 145 (2) (2005)
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. Discret. Appl. Math. 152 (1-3) (2005)
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
Parameterized Counting Algorithms for General Graph Covering Problems. WADS (2005)
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
Detecting Backdoor Sets with Respect to Horn and Binary Clauses. SAT (2004)
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
Smaller Kernels for Hitting Set Problems of Constant Arity. IWPEC (2004)
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J. Comput. Syst. Sci. 69 (2) (2004)
Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. ESA (2004)
Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt
On the parameterized complexity of the generalized rush hour puzzle. CCCG (2003)
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
On Graph Powers for Leaf-Labeled Trees. J. Algorithms 42 (1) (2002)
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
On the Parameterized Complexity of Layered Graph Drawing. ESA (2001)
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. WADS (2001)
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
A Fixed-Parameter Approach to Two-Layer Planarization. Graph Drawing (2001)
Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
-minor-free graphs. Electron. Notes Discret. Math. 10 (2001)
Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
. SWAT (2000)
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
On Graph Powers for Leaf-Labeled Trees. SWAT (2000)
Friedhelm Meyer auf der Heide, Miroslaw Kutylowski, Prabhakar Ragde
Complexity Theory and Algorithms. Euro-Par (2000)
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
Finding Smallest Supertrees Under Minor Containment. Int. J. Found. Comput. Sci. 11 (3) (2000)
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
Finding Smallest Supertrees Under Minor Containment. WG (1999)
Omer Berkman, Yossi Matias, Prabhakar Ragde
Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains. J. Algorithms 28 (2) (1998)
Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde
Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth. J. Comput. Syst. Sci. 57 (3) (1998)
Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde
µDatabase: Parallelism in a Memory-Mapped Environment. SPAA (1996)
Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde
Parallel Pointer-Based Join Algorithms in Memory-mapped Environments. ICDE (1996)
Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
Pointers versus Arithmetic in PRAMs. J. Comput. Syst. Sci. 53 (2) (1996)
Jonathan F. Buss, Paris C. Kanellakis, Prabhakar Ragde, Alexander A. Shvartsman
Parallel Algorithms with Processor Failures and Delays. J. Algorithms 20 (1) (1996)
Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde
Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. SODA (1995)
Faith E. Fich, Miroslaw Kowaluk, Miroslaw Kutylowski, Krzysztof Lorys, Prabhakar Ragde
Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs. Comput. Complex. 5 (2) (1995)
Omer Berkman, Yossi Matias, Prabhakar Ragde
Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs. WADS (1993)
Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
Pointers versus Arithmetic in PRAMs. Computational Complexity Conference (1993)
Prabhakar Ragde
The Parallel Simplicity of Compaction and Chaining. J. Algorithms 14 (3) (1993)
Prabhakar Ragde
Processor-Time Tradeoffs in PRAM Simulations. J. Comput. Syst. Sci. 44 (1) (1992)
Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde
Retrieval of scattered information by EREW, CREW and CRCW PRAMs. SWAT (1992)
Prabhakar Ragde, Avi Wigderson
Linear-Size Constant-Depth Polylog-Treshold Circuits. Inf. Process. Lett. 39 (3) (1991)
Prabhakar Ragde
Analysis of an Asynchronous PRAM Algorithm. Inf. Process. Lett. 39 (5) (1991)
Prabhakar Ragde
Extracting Poetry from Technical Paper s. SIGACT News 22 (2) (1991)
Vince Grolmusz, Prabhakar Ragde
Incomparability in parallel computation. Discret. Appl. Math. 29 (1) (1990)
Ilan Newman, Prabhakar Ragde, Avi Wigderson
Perfect Hashing, Graph Entropy, and Circuit Complexity. Computational Complexity Conference (1990)
Michael Luby, Prabhakar Ragde
A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior. Algorithmica 4 (4) (1989)
Faith E. Fich, Ming Li, Prabhakar Ragde, Yaacov Yesha
On the Power of Concurrent-Write PRAMs With Read-Only Memory Inf. Comput. 83 (2) (1989)
Eli Gafni, Joseph Naor, Prabhakar Ragde
On Separating the Erew and Crew Pram Models. Theor. Comput. Sci. 68 (3) (1989)
Faith E. Fich, Prabhakar Ragde, Avi Wigderson
Simulations Among Concurrent-Write PRAMs. Algorithmica 3 (1988)
Faith E. Fich, Prabhakar Ragde, Avi Wigderson
Relations Between Concurrent-Write Models of Parallel Computation. SIAM J. Comput. 17 (3) (1988)
Prabhakar Ragde, William L. Steiger, Endre Szemerédi, Avi Wigderson
The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)). SIAM J. Discret. Math. 1 (3) (1988)
Vince Grolmusz, Prabhakar Ragde
Incomparability in Parallel Computation FOCS (1987)
Michael Luby, Prabhakar Ragde
A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version). ICALP (1985)
Faith E. Fich, Friedhelm Meyer auf der Heide, Prabhakar Ragde, Avi Wigderson
One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation STOC (1985)
Faith E. Fich, Prabhakar Ragde, Avi Wigderson
Relations Between Concurrent-Write Models of Parallel Computation. PODC (1984)