default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrabhakar Ragde
Person information
- affiliation: University of Waterloo, David R. Cheriton School of Computer Science, Waterloo, ON, Canada
- affiliation (PhD 1986): University of California, Berkeley, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j29]Prabhakar Ragde
:
Review of "Algorithms for Functional Programming" by John David Stone, Springer-Verlag, 2018. J. Funct. Program. 30: e19 (2020)- 2013
- [j28]Prabhakar Ragde:
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. 23(3): 352-354 (2013) - 2008
- [j27]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): 167-176 (2008) - [j26]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): 267-292 (2008) - 2007
- [j25]Naomi Nishimura, Prabhakar Ragde, Stefan Szeider:
Solving #SAT using vertex covers. Acta Informatica 44(7-8): 509-523 (2007) - 2006
- [j24]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): 159-182 (2006) - 2005
- [j23]Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde:
Embeddings of k-connected graphs of pathwidth k. Discret. Appl. Math. 145(2): 242-265 (2005) - [j22]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. Discret. Appl. Math. 152(1-3): 229-245 (2005) - 2004
- [j21]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): 166-195 (2004) - 2002
- [j20]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
On Graph Powers for Leaf-Labeled Trees. J. Algorithms 42(1): 69-108 (2002) - 2001
- [j19]Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs. Electron. Notes Discret. Math. 10: 137-142 (2001) - 2000
- [j18]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Finding Smallest Supertrees Under Minor Containment. Int. J. Found. Comput. Sci. 11(3): 445-465 (2000) - 1998
- [j17]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): 197-215 (1998) - [j16]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): 366-375 (1998) - 1996
- [j15]Jonathan F. Buss, Paris C. Kanellakis, Prabhakar Ragde, Alexander A. Shvartsman:
Parallel Algorithms with Processor Failures and Delays. J. Algorithms 20(1): 45-86 (1996) - [j14]Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo:
Pointers versus Arithmetic in PRAMs. J. Comput. Syst. Sci. 53(2): 218-232 (1996) - 1995
- [j13]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): 113-131 (1995) - 1993
- [j12]Prabhakar Ragde:
The Parallel Simplicity of Compaction and Chaining. J. Algorithms 14(3): 371-380 (1993) - 1992
- [j11]Prabhakar Ragde:
Processor-Time Tradeoffs in PRAM Simulations. J. Comput. Syst. Sci. 44(1): 103-113 (1992) - 1991
- [j10]Prabhakar Ragde, Avi Wigderson:
Linear-Size Constant-Depth Polylog-Treshold Circuits. Inf. Process. Lett. 39(3): 143-146 (1991) - [j9]Prabhakar Ragde:
Analysis of an Asynchronous PRAM Algorithm. Inf. Process. Lett. 39(5): 253-256 (1991) - [j8]Prabhakar Ragde:
Extracting Poetry from Technical Paper s. SIGACT News 22(2): 50 (1991) - 1990
- [j7]Vince Grolmusz, Prabhakar Ragde:
Incomparability in parallel computation. Discret. Appl. Math. 29(1): 63-78 (1990) - 1989
- [j6]Michael Luby, Prabhakar Ragde:
A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior. Algorithmica 4(4): 551-567 (1989) - [j5]Faith E. Fich, Ming Li, Prabhakar Ragde, Yaacov Yesha:
On the Power of Concurrent-Write PRAMs With Read-Only Memory. Inf. Comput. 83(2): 234-244 (1989) - [j4]Eli Gafni, Joseph Naor, Prabhakar Ragde:
On Separating the Erew and Crew Pram Models. Theor. Comput. Sci. 68(3): 343-346 (1989) - 1988
- [j3]Faith E. Fich, Prabhakar Ragde, Avi Wigderson:
Simulations Among Concurrent-Write PRAMs. Algorithmica 3: 43-51 (1988) - [j2]Faith E. Fich, Prabhakar Ragde, Avi Wigderson:
Relations Between Concurrent-Write Models of Parallel Computation. SIAM J. Comput. 17(3): 606-627 (1988) - [j1]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): 399-410 (1988)
Conference and Workshop Papers
- 2016
- [c29]Prabhakar Ragde:
Proust: A Nano Proof Assistant. TFPIE 2016: 63-75 - 2014
- [c28]Prabhakar Ragde:
Simple Balanced Binary Search Trees. TFPIE 2014: 78-87 - 2012
- [c27]Prabhakar Ragde:
Mathematics Is Imprecise. TFPIE 2012: 40-49 - 2008
- [c26]Prabhakar Ragde:
The chilling descent: making the transition to a conventional curriculum. FDPE@ICFP 2008: 13-20 - 2006
- [c25]Naomi Nishimura, Prabhakar Ragde, Stefan Szeider:
Solving #SAT Using Vertex Covers. SAT 2006: 396-409 - 2005
- [c24]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Parameterized Counting Algorithms for General Graph Covering Problems. WADS 2005: 99-109 - 2004
- [c23]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: 311-322 - [c22]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Smaller Kernels for Hitting Set Problems of Constant Arity. IWPEC 2004: 121-126 - [c21]Naomi Nishimura, Prabhakar Ragde, Stefan Szeider:
Detecting Backdoor Sets with Respect to Horn and Binary Clauses. SAT 2004 - 2003
- [c20]Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt:
On the parameterized complexity of the generalized rush hour puzzle. CCCG 2003: 6-9 - 2001
- [c19]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: 488-499 - [c18]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. GD 2001: 1-15 - [c17]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. WADS 2001: 75-86 - 2000
- [c16]Friedhelm Meyer auf der Heide, Miroslaw Kutylowski, Prabhakar Ragde:
Complexity Theory and Algorithms. Euro-Par 2000: 455 - [c15]Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde:
Embeddings of k-Connected Graphs of Pathwidth k. SWAT 2000: 111-124 - [c14]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
On Graph Powers for Leaf-Labeled Trees. SWAT 2000: 125-138 - 1999
- [c13]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Finding Smallest Supertrees Under Minor Containment. WG 1999: 303-312 - 1996
- [c12]Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde:
Parallel Pointer-Based Join Algorithms in Memory-mapped Environments. ICDE 1996: 266-275 - [c11]Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde:
µDatabase: Parallelism in a Memory-Mapped Environment. SPAA 1996: 196-199 - 1995
- [c10]Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde:
Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. SODA 1995: 641-649 - 1993
- [c9]Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo:
Pointers versus Arithmetic in PRAMs. SCT 1993: 239-252 - [c8]Omer Berkman, Yossi Matias, Prabhakar Ragde:
Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs. WADS 1993: 175-187 - 1992
- [c7]Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde:
Retrieval of scattered information by EREW, CREW and CRCW PRAMs. SWAT 1992: 30-41 - 1990
- [c6]Ilan Newman, Prabhakar Ragde, Avi Wigderson:
Perfect Hashing, Graph Entropy, and Circuit Complexity. SCT 1990: 91-99 - [c5]Prabhakar Ragde:
The Parallel Simplicity of Compaction and Chaining. ICALP 1990: 744-751 - 1987
- [c4]Vince Grolmusz, Prabhakar Ragde:
Incomparability in Parallel Computation. FOCS 1987: 89-98 - 1985
- [c3]Michael Luby, Prabhakar Ragde:
A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version). ICALP 1985: 394-403 - [c2]Faith E. Fich, Friedhelm Meyer auf der Heide, Prabhakar Ragde, Avi Wigderson:
One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation. STOC 1985: 48-58 - 1984
- [c1]Faith E. Fich, Prabhakar Ragde, Avi Wigderson:
Relations Between Concurrent-Write Models of Parallel Computation. PODC 1984: 179-189
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-05 02:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
