Prabhakar Ragde

According to our database1, Prabhakar Ragde authored at least 47 papers between 1984 and 2016.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.



In proceedings 
PhD thesis 




Proust: A Nano Proof Assistant.
Proceedings of the 4th and 5th International Workshop on Trends in Functional Programming in Education, 2016

Simple Balanced Binary Search Trees.
Proceedings of the Proceedings 3rd International Workshop on Trends in Functional Programming in Education, 2014

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

Mathematics Is Imprecise
Proceedings of the Proceedings First International Workshop on Trends in Functional Programming in Education, 2012

On the Parameterized Complexity of Layered Graph Drawing.
Algorithmica, 2008

The chilling descent: making the transition to a conventional curriculum.
Proceedings of the 2008 international workshop on Functional and declarative programming in education, 2008

A Fixed-Parameter Approach to 2-Layer Planarization.
Algorithmica, 2006

Solving #SAT Using Vertex Covers.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Parameterized Counting Algorithms for General Graph Covering Problems.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Approximation algorithms for classes of graphs excluding single-crossing graphs as minors.
J. Comput. Syst. Sci., 2004

Detecting Backdoor Sets with Respect to Horn and Binary Clauses.
Proceedings of the SAT 2004, 2004

Smaller Kernels for Hitting Set Problems of Constant Arity.
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.
Proceedings of the Algorithms, 2004

On the parameterized complexity of the generalized rush hour puzzle.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs.
Electronic Notes in Discrete Mathematics, 2001

Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

A Fixed-Parameter Approach to Two-Layer Planarization.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

On Graph Powers for Leaf-Labeled Trees.
Proceedings of the Algorithm Theory, 2000

Embeddings of k-Connected Graphs of Pathwidth k.
Proceedings of the Algorithm Theory, 2000

Complexity Theory and Algorithms.
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

Finding Smallest Supertrees Under Minor Containment.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth.
J. Comput. Syst. Sci., 1998

Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains.
J. Algorithms, 1998

Parallel Algorithms with Processor Failures and Delays.
J. Algorithms, 1996

µDatabase: Parallelism in a Memory-Mapped Environment.
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Parallel Pointer-Based Join Algorithms in Memory-mapped Environments.
Proceedings of the Twelfth International Conference on Data Engineering, February 26, 1996

Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs.
Computational Complexity, 1995

Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

The Parallel Simplicity of Compaction and Chaining.
J. Algorithms, 1993

Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Pointers versus Arithmetic in PRAMs.
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

Processor-Time Tradeoffs in PRAM Simulations.
J. Comput. Syst. Sci., 1992

Retrieval of scattered information by EREW, CREW and CRCW PRAMs.
Proceedings of the Algorithm Theory, 1992

Linear-Size Constant-Depth Polylog-Treshold Circuits.
Inf. Process. Lett., 1991

Analysis of an Asynchronous PRAM Algorithm.
Inf. Process. Lett., 1991

Incomparability in parallel computation.
Discrete Applied Mathematics, 1990

Perfect Hashing, Graph Entropy, and Circuit Complexity.
Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990

On the Power of Concurrent-Write PRAMs With Read-Only Memory
Inf. Comput., November, 1989

On Separating the Erew and Crew Pram Models.
Theor. Comput. Sci., 1989

A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior.
Algorithmica, 1989

The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)).
SIAM J. Discrete Math., 1988

Simulations Among Concurrent-Write PRAMs.
Algorithmica, 1988

Incomparability in Parallel Computation
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version).
Proceedings of the Automata, 1985

Relations Between Concurrent-Write Models of Parallel Computation.
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984