P. Ragde

发表

The parallel simplicity of compaction and chaining

P. Ragde, 1990 .

THE PARALLEL COMPLEXITY OF ELEMENT DISTINCTNESS IS f ( x / logn ) *

A. Wigderson, P. Ragde, W. Steiger, 1988 .

Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth

Naomi Nishimura, Prabhakar Ragde, Torben Hagerup, 1998, J. Comput. Syst. Sci..

On-line target searching in bounded and unbounded domains

Alejandro López-Ortiz, Prabhakar Ragde, P. Ragde, 1996 .

Finding Smallest Supertrees Under Minor Containment

Dimitrios M. Thilikos, Naomi Nishimura, Prabhakar Ragde, 1999, Int. J. Found. Comput. Sci..

Rational Chebyshev Approximations for the Bessel Functions J 0 (x), J 1 (x), Y 0 (x), Y 1 (x)

P. Ragde, J. M. Blair, C. A. Wills, 1982 .

A Small Domain Lower Bound For Parallel Maximum Computation

P. Ragde, 2002 .

3.1.1 Triangulating a Monotone Polygon 3.2 Range Minima 2.3.2 Query Retrieval 3.1 All Nearest Smaller Values 2.2 Preex Minima and All Nearest Smaller Values

A. Wigderson, R. Tarjan, J. Bentley, 1998 .

A Fixed-Parameter Approach to Two-Layer Planarization

Giuseppe Liotta, David R. Wood, Naomi Nishimura, 2001, Graph Drawing.

Approximation algorithms for lasses of graphsex luding single-rossing graphs as minors ?

P. Ragde, E. Demaine, M. Hajiaghayi, 2007 .

Relations between concurrent-write models of parallel computation

Faith Ellen, Avi Wigderson, Prabhakar Ragde, 1984, PODC '84.

Processor-Time Tradeoffs in PRAM Simulations

PRABHAKAR RAGDE, P. Ragde, 1992, J. Comput. Syst. Sci..

Incomparability in parallel computation

Prabhakar Ragde, Vince Grolmusz, P. Ragde, 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

On the Parameterized Complexity of Layered Graph Drawing

Giuseppe Liotta, David R. Wood, Naomi Nishimura, 2001, Algorithmica.

Parallel Algorithms with Processor Failures and Delays

Prabhakar Ragde, Alexander A. Shvartsman, Paris C. Kanellakis, 1996, J. Algorithms.

Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover

Dimitrios M. Thilikos, Naomi Nishimura, Prabhakar Ragde, 2001, Discret. Appl. Math..

Mathematics Is Imprecise

Prabhakar Ragde, P. Ragde, 2013, TFPIE.

The chilling descent: making the transition to a conventional curriculum

Prabhakar Ragde, P. Ragde, 2008, FDPE '08.

Solving #SAT using vertex covers

Naomi Nishimura, Prabhakar Ragde, Stefan Szeider, 2006, Acta Informatica.

Approximation algorithms for classes of graphs excluding single-crossing graphs as minors

Erik D. Demaine, Dimitrios M. Thilikos, Mohammad Taghi Hajiaghayi, 2004, J. Comput. Syst. Sci..

Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs

Dimitrios M. Thilikos, Mohammad Taghi Hajiaghayi, Naomi Nishimura, 2001, Electron. Notes Discret. Math..

A Fixed-Parameter Approach to 2-Layer Planarization

Giuseppe Liotta, David R. Wood, Naomi Nishimura, 2001, Algorithmica.

Parameterized Counting Algorithms for General Graph Covering Problems

Dimitrios M. Thilikos, Naomi Nishimura, Prabhakar Ragde, 2005, WADS.

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems

Dimitrios M. Thilikos, Naomi Nishimura, Prabhakar Ragde, 2008, Algorithmica.

Finding Smallest Supertrees Under Minor Containment

Dimitrios M. Thilikos, Naomi Nishimura, Prabhakar Ragde, 1999, Int. J. Found. Comput. Sci..

The Parallel Simplicity of Compaction and Chaining

Prabhakar Ragde, P. Ragde, 1990, J. Algorithms.

Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains

Yossi Matias, Prabhakar Ragde, Omer Berkman, 1998, J. Algorithms.

Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Bounded Treewidth1

Naomi Nishimura, Prabhakar Ragde, Torben Hagerup, 1998 .

Proust: A Nano Proof Assistant

Prabhakar Ragde, P. Ragde, 2016, TFPIE.

μDatabase: parallelism in a memory-mapped environment (research summary)

Naomi Nishimura, Prabhakar Ragde, Anil K. Goel, 1996, SPAA '96.

Parallel pointer-based join algorithms in memory mapped environments

Naomi Nishimura, Prabhakar Ragde, Anil K. Goel, 1996, Proceedings of the Twelfth International Conference on Data Engineering.

One, two, three . . . infinity: lower bounds for parallel computation

Friedhelm Meyer auf der Heide, Faith Ellen, Avi Wigderson, 1985, STOC '85.

On Graph Powers for Leaf-Labeled Trees

Dimitrios M. Thilikos, Naomi Nishimura, Prabhakar Ragde, 2000, SWAT.

A bidirectional shortest-path algorithm with good average-case behavior

Prabhakar Ragde, Michael Luby, M. Luby, 1989, Algorithmica.

Simulations among concurrent-write PRAMs

Faith Ellen, Avi Wigderson, Prabhakar Ragde, 1988, Algorithmica.