The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Prabhakar Ragde: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jonathan F. Buss, Paris C. Kanellakis, Prabhakar Ragde, Alexander A. Shvartsman
    Parallel Algorithms with Processor Failures and Delays. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1996, v:20, n:1, pp:45-86 [Journal]
  2. Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt
    On the parameterized complexity of the generalized rush hour puzzle. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:6-9 [Conf]
  3. Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
    Pointers versus Arithmetic in PRAMs. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:239-252 [Conf]
  4. Ilan Newman, Prabhakar Ragde, Avi Wigderson
    Perfect Hashing, Graph Entropy, and Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:91-99 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:488-499 [Conf]
  6. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:311-322 [Conf]
  7. Friedhelm Meyer auf der Heide, Miroslaw Kutylowski, Prabhakar Ragde
    Complexity Theory and Algorithms. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2000, pp:455- [Conf]
  8. Vince Grolmusz, Prabhakar Ragde
    Incomparability in Parallel Computation [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:89-98 [Conf]
  9. 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. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:1-15 [Conf]
  10. Michael Luby, Prabhakar Ragde
    A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:394-403 [Conf]
  11. Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde
    Parallel Pointer-Based Join Algorithms in Memory-mapped Environments. [Citation Graph (0, 33)][DBLP]
    ICDE, 1996, pp:266-275 [Conf]
  12. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Smaller Kernels for Hitting Set Problems of Constant Arity. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:121-126 [Conf]
  13. Faith E. Fich, Prabhakar Ragde, Avi Wigderson
    Relations Between Concurrent-Write Models of Parallel Computation. [Citation Graph (0, 0)][DBLP]
    PODC, 1984, pp:179-189 [Conf]
  14. Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
    Detecting Backdoor Sets with Respect to Horn and Binary Clauses. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  15. Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
    Solving #SAT Using Vertex Covers. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:396-409 [Conf]
  16. Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde
    Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:641-649 [Conf]
  17. Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde
    µDatabase: Parallelism in a Memory-Mapped Environment. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:196-199 [Conf]
  18. Faith E. Fich, Friedhelm Meyer auf der Heide, Prabhakar Ragde, Avi Wigderson
    One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:48-58 [Conf]
  19. Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde
    Retrieval of scattered information by EREW, CREW and CRCW PRAMs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:30-41 [Conf]
  20. Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
    Embeddings of k-Connected Graphs of Pathwidth k. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:111-124 [Conf]
  21. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    On Graph Powers for Leaf-Labeled Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:125-138 [Conf]
  22. Omer Berkman, Yossi Matias, Prabhakar Ragde
    Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:175-187 [Conf]
  23. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:75-86 [Conf]
  24. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Parameterized Counting Algorithms for General Graph Covering Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:99-109 [Conf]
  25. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Finding Smallest Supertrees Under Minor Containment. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:303-312 [Conf]
  26. Faith E. Fich, Prabhakar Ragde, Avi Wigderson
    Simulations Among Concurrent-Write PRAMs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:43-51 [Journal]
  27. Michael Luby, Prabhakar Ragde
    A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:4, pp:551-567 [Journal]
  28. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:2, pp:159-182 [Journal]
  29. Faith E. Fich, Miroslaw Kowaluk, Miroslaw Kutylowski, Krzysztof Lorys, Prabhakar Ragde
    Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1995, v:5, n:2, pp:113-131 [Journal]
  30. Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
    Embeddings of k-connected graphs of pathwidth k. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:242-265 [Journal]
  31. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:229-245 [Journal]
  32. Faith E. Fich, Ming Li, Prabhakar Ragde, Yaacov Yesha
    On the Power of Concurrent-Write PRAMs With Read-Only Memory [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:83, n:2, pp:234-244 [Journal]
  33. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    Finding Smallest Supertrees Under Minor Containment. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:445-465 [Journal]
  34. Prabhakar Ragde
    Analysis of an Asynchronous PRAM Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:5, pp:253-256 [Journal]
  35. Prabhakar Ragde, Avi Wigderson
    Linear-Size Constant-Depth Polylog-Treshold Circuits. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:3, pp:143-146 [Journal]
  36. Omer Berkman, Yossi Matias, Prabhakar Ragde
    Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:28, n:2, pp:197-215 [Journal]
  37. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
    On Graph Powers for Leaf-Labeled Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:42, n:1, pp:69-108 [Journal]
  38. Prabhakar Ragde
    The Parallel Simplicity of Compaction and Chaining. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:3, pp:371-380 [Journal]
  39. 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. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:2, pp:166-195 [Journal]
  40. Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
    Pointers versus Arithmetic in PRAMs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:2, pp:218-232 [Journal]
  41. Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde
    Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:57, n:3, pp:366-375 [Journal]
  42. Prabhakar Ragde
    Processor-Time Tradeoffs in PRAM Simulations. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:44, n:1, pp:103-113 [Journal]
  43. Faith E. Fich, Prabhakar Ragde, Avi Wigderson
    Relations Between Concurrent-Write Models of Parallel Computation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:3, pp:606-627 [Journal]
  44. Prabhakar Ragde, William L. Steiger, Endre Szemerédi, Avi Wigderson
    The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)). [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:3, pp:399-410 [Journal]
  45. Eli Gafni, Joseph Naor, Prabhakar Ragde
    On Separating the Erew and Crew Pram Models. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:68, n:3, pp:343-346 [Journal]

  46. Solving #SAT using vertex covers. [Citation Graph (, )][DBLP]


  47. Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. [Citation Graph (, )][DBLP]


  48. On the Parameterized Complexity of Layered Graph Drawing. [Citation Graph (, )][DBLP]


  49. Incomparability in parallel computation. [Citation Graph (, )][DBLP]


Search in 0.026secs, Finished in 0.030secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002