default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Prabhakar Ragde
@article{DBLP:journals/jfp/Ragde20,
author = {Prabhakar Ragde},
title = {Review of "Algorithms for Functional Programming" by John
David Stone, Springer-Verlag, 2018},
journal = {J. Funct. Program.},
volume = {30},
pages = {e19},
year = {2020},
url = {https://doi.org/10.1017/S0956796820000179},
doi = {10.1017/S0956796820000179},
timestamp = {Fri, 31 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jfp/Ragde20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/Ragde16,
author = {Prabhakar Ragde},
editor = {Johan Jeuring and
Jay McCarthy},
title = {Proust: {A} Nano Proof Assistant},
booktitle = {Proceedings of the 4th and 5th International Workshop on Trends in
Functional Programming in Education, {TFPIE} 2016, Sophia-Antipolis,
France, and University of Maryland, College Park, MD, USA, June 2,
2015, and June 7, 2016},
series = {{EPTCS}},
volume = {230},
pages = {63--75},
year = {2016},
url = {https://doi.org/10.4204/EPTCS.230.5},
doi = {10.4204/EPTCS.230.5},
timestamp = {Thu, 21 Feb 2019 15:49:26 +0100},
biburl = {https://dblp.org/rec/journals/corr/Ragde16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/Ragde14,
author = {Prabhakar Ragde},
editor = {James L. Caldwell and
Philip K. F. H{\"{o}}lzenspies and
Peter Achten},
title = {Simple Balanced Binary Search Trees},
booktitle = {Proceedings 3rd International Workshop on Trends in Functional Programming
in Education, {TFPIE} 2014, Soesterberg, The Netherlands, 25th May
2014},
series = {{EPTCS}},
volume = {170},
pages = {78--87},
year = {2014},
url = {https://doi.org/10.4204/EPTCS.170.6},
doi = {10.4204/EPTCS.170.6},
timestamp = {Thu, 25 Feb 2021 14:03:49 +0100},
biburl = {https://dblp.org/rec/journals/corr/Ragde14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jfp/Ragde13,
author = {Prabhakar Ragde},
title = {\emph{OCaml from the Very Beginning}, by John Whitington, Coherent
Press, 2013, {\textsterling} 25.99, {US} {\textdollar}37.99. {ISBN-10:}
0957671105 (paperback), 204 pp},
journal = {J. Funct. Program.},
volume = {23},
number = {3},
pages = {352--354},
year = {2013},
url = {https://doi.org/10.1017/S0956796813000087},
doi = {10.1017/S0956796813000087},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jfp/Ragde13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/abs-1301-5076,
author = {Prabhakar Ragde},
editor = {Marco T. Moraz{\'{a}}n and
Peter Achten},
title = {Mathematics Is Imprecise},
booktitle = {Proceedings First International Workshop on Trends in Functional Programming
in Education, {TFPIE} 2012, University of St. Andrews, Scotland, UK,
11th June 2012},
series = {{EPTCS}},
volume = {106},
pages = {40--49},
year = {2012},
url = {https://doi.org/10.4204/EPTCS.106.3},
doi = {10.4204/EPTCS.106.3},
timestamp = {Wed, 12 Sep 2018 01:05:12 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-5076.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FellowsKNRRSTW08,
author = {Michael R. Fellows and
Christian Knauer and
Naomi Nishimura and
Prabhakar Ragde and
Frances A. Rosamond and
Ulrike Stege and
Dimitrios M. Thilikos and
Sue Whitesides},
title = {Faster Fixed-Parameter Tractable Algorithms for Matching and Packing
Problems},
journal = {Algorithmica},
volume = {52},
number = {2},
pages = {167--176},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9146-y},
doi = {10.1007/S00453-007-9146-Y},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FellowsKNRRSTW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DujmovicFKLMNRRWW08,
author = {Vida Dujmovic and
Michael R. Fellows and
Matthew Kitching and
Giuseppe Liotta and
Catherine McCartin and
Naomi Nishimura and
Prabhakar Ragde and
Frances A. Rosamond and
Sue Whitesides and
David R. Wood},
title = {On the Parameterized Complexity of Layered Graph Drawing},
journal = {Algorithmica},
volume = {52},
number = {2},
pages = {267--292},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9151-1},
doi = {10.1007/S00453-007-9151-1},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DujmovicFKLMNRRWW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icfp/Ragde08,
author = {Prabhakar Ragde},
editor = {Frank Huch and
Adam Parkin},
title = {The chilling descent: making the transition to a conventional curriculum},
booktitle = {Proceedings of the 2008 international workshop on Functional and declarative
programming in education, FDPE@ICFP 2008, Victoria, BC, Canada, September
20 - 28, 2008},
pages = {13--20},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1411260.1411263},
doi = {10.1145/1411260.1411263},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icfp/Ragde08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/NishimuraRS07,
author = {Naomi Nishimura and
Prabhakar Ragde and
Stefan Szeider},
title = {Solving {\#}SAT using vertex covers},
journal = {Acta Informatica},
volume = {44},
number = {7-8},
pages = {509--523},
year = {2007},
url = {https://doi.org/10.1007/s00236-007-0056-x},
doi = {10.1007/S00236-007-0056-X},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/NishimuraRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DujmovicFHKLMNRRSWW06,
author = {Vida Dujmovic and
Michael R. Fellows and
Michael T. Hallett and
Matthew Kitching and
Giuseppe Liotta and
Catherine McCartin and
Naomi Nishimura and
Prabhakar Ragde and
Frances A. Rosamond and
Matthew Suderman and
Sue Whitesides and
David R. Wood},
title = {A Fixed-Parameter Approach to 2-Layer Planarization},
journal = {Algorithmica},
volume = {45},
number = {2},
pages = {159--182},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1181-y},
doi = {10.1007/S00453-005-1181-Y},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DujmovicFHKLMNRRSWW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/NishimuraRS06,
author = {Naomi Nishimura and
Prabhakar Ragde and
Stefan Szeider},
editor = {Armin Biere and
Carla P. Gomes},
title = {Solving {\#}SAT Using Vertex Covers},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2006, 9th
International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4121},
pages = {396--409},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11814948\_36},
doi = {10.1007/11814948\_36},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/NishimuraRS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GuptaNPR05,
author = {Arvind Gupta and
Naomi Nishimura and
Andrzej Proskurowski and
Prabhakar Ragde},
title = {Embeddings of \emph{k}-connected graphs of pathwidth \emph{k}},
journal = {Discret. Appl. Math.},
volume = {145},
number = {2},
pages = {242--265},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2002.12.005},
doi = {10.1016/J.DAM.2002.12.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GuptaNPR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/NishimuraRT05,
author = {Naomi Nishimura and
Prabhakar Ragde and
Dimitrios M. Thilikos},
title = {Fast fixed-parameter tractable algorithms for nontrivial generalizations
of vertex cover},
journal = {Discret. Appl. Math.},
volume = {152},
number = {1-3},
pages = {229--245},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2005.02.029},
doi = {10.1016/J.DAM.2005.02.029},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/NishimuraRT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/NishimuraRT05,
author = {Naomi Nishimura and
Prabhakar Ragde and
Dimitrios M. Thilikos},
editor = {Frank K. H. A. Dehne and
Alejandro L{\'{o}}pez{-}Ortiz and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Parameterized Counting Algorithms for General Graph Covering Problems},
booktitle = {Algorithms and Data Structures, 9th International Workshop, {WADS}
2005, Waterloo, Canada, August 15-17, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3608},
pages = {99--109},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11534273\_10},
doi = {10.1007/11534273\_10},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/NishimuraRT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DemaineHNRT04,
author = {Erik D. Demaine and
Mohammad Taghi Hajiaghayi and
Naomi Nishimura and
Prabhakar Ragde and
Dimitrios M. Thilikos},
title = {Approximation algorithms for classes of graphs excluding single-crossing
graphs as minors},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {2},
pages = {166--195},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2003.12.001},
doi = {10.1016/J.JCSS.2003.12.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DemaineHNRT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FellowsKNRRSTW04,
author = {Michael R. Fellows and
Christian Knauer and
Naomi Nishimura and
Prabhakar Ragde and
Frances A. Rosamond and
Ulrike Stege and
Dimitrios M. Thilikos and
Sue Whitesides},
editor = {Susanne Albers and
Tomasz Radzik},
title = {Faster Fixed-Parameter Tractable Algorithms for Matching and Packing
Problems},
booktitle = {Algorithms - {ESA} 2004, 12th Annual European Symposium, Bergen, Norway,
September 14-17, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3221},
pages = {311--322},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30140-0\_29},
doi = {10.1007/978-3-540-30140-0\_29},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/FellowsKNRRSTW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/NishimuraRT04,
author = {Naomi Nishimura and
Prabhakar Ragde and
Dimitrios M. Thilikos},
editor = {Rodney G. Downey and
Michael R. Fellows and
Frank K. H. A. Dehne},
title = {Smaller Kernels for Hitting Set Problems of Constant Arity},
booktitle = {Parameterized and Exact Computation, First International Workshop,
{IWPEC} 2004, Bergen, Norway, September 14-17, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3162},
pages = {121--126},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28639-4\_11},
doi = {10.1007/978-3-540-28639-4\_11},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/NishimuraRT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/NishimuraRS04,
author = {Naomi Nishimura and
Prabhakar Ragde and
Stefan Szeider},
title = {Detecting Backdoor Sets with Respect to Horn and Binary Clauses},
booktitle = {{SAT} 2004 - The Seventh International Conference on Theory and Applications
of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada,
Online Proceedings},
year = {2004},
url = {http://www.satisfiability.org/SAT04/programme/51.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sat/NishimuraRS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/FernauHNRR03,
author = {Henning Fernau and
Torben Hagerup and
Naomi Nishimura and
Prabhakar Ragde and
Klaus Reinhardt},
title = {On the parameterized complexity of the generalized rush hour puzzle},
booktitle = {Proceedings of the 15th Canadian Conference on Computational Geometry,
CCCG'03, Halifax, Canada, August 11-13, 2003},
pages = {6--9},
year = {2003},
url = {http://www.cccg.ca/proceedings/2003/22.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/FernauHNRR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/NishimuraRT02,
author = {Naomi Nishimura and
Prabhakar Ragde and
Dimitrios M. Thilikos},
title = {On Graph Powers for Leaf-Labeled Trees},
journal = {J. Algorithms},
volume = {42},
number = {1},
pages = {69--108},
year = {2002},
url = {https://doi.org/10.1006/jagm.2001.1195},
doi = {10.1006/JAGM.2001.1195},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/NishimuraRT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HajiaghayiNRT01,
author = {Mohammad Taghi Hajiaghayi and
Naomi Nishimura and
Prabhakar Ragde and
Dimitrios M. Thilikos},
title = {Fast approximation schemes for K\({}_{\mbox{3, 3}}\)-minor-free or
K\({}_{\mbox{5}}\)-minor-free graphs},
journal = {Electron. Notes Discret. Math.},
volume = {10},
pages = {137--142},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(04)00379-8},
doi = {10.1016/S1571-0653(04)00379-8},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/HajiaghayiNRT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DujmovicFHKLMNRRSWW01,
author = {Vida Dujmovic and
Michael R. Fellows and
Michael T. Hallett and
Matthew Kitching and
Giuseppe Liotta and
Catherine McCartin and
Naomi Nishimura and
Prabhakar Ragde and
Frances A. Rosamond and
Matthew Suderman and
Sue Whitesides and
David R. Wood},
editor = {Friedhelm Meyer auf der Heide},
title = {On the Parameterized Complexity of Layered Graph Drawing},
booktitle = {Algorithms - {ESA} 2001, 9th Annual European Symposium, Aarhus, Denmark,
August 28-31, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2161},
pages = {488--499},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44676-1\_41},
doi = {10.1007/3-540-44676-1\_41},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/DujmovicFHKLMNRRSWW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/DujmovicFHKLMNRRSWW01,
author = {Vida Dujmovic and
Michael R. Fellows and
Michael T. Hallett and
Matthew Kitching and
Giuseppe Liotta and
Catherine McCartin and
Naomi Nishimura and
Prabhakar Ragde and
Frances A. Rosamond and
Matthew Suderman and
Sue Whitesides and
David R. Wood},
editor = {Petra Mutzel and
Michael J{\"{u}}nger and
Sebastian Leipert},
title = {A Fixed-Parameter Approach to Two-Layer Planarization},
booktitle = {Graph Drawing, 9th International Symposium, {GD} 2001 Vienna, Austria,
September 23-26, 2001, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2265},
pages = {1--15},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45848-4\_1},
doi = {10.1007/3-540-45848-4\_1},
timestamp = {Sun, 13 Nov 2022 09:57:35 +0100},
biburl = {https://dblp.org/rec/conf/gd/DujmovicFHKLMNRRSWW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/NishimuraRT01,
author = {Naomi Nishimura and
Prabhakar Ragde and
Dimitrios M. Thilikos},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations
of Vertex Cover},
booktitle = {Algorithms and Data Structures, 7th International Workshop, {WADS}
2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2125},
pages = {75--86},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44634-6\_8},
doi = {10.1007/3-540-44634-6\_8},
timestamp = {Sun, 02 Jun 2019 21:24:17 +0200},
biburl = {https://dblp.org/rec/conf/wads/NishimuraRT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/NishimuraRT00,
author = {Naomi Nishimura and
Prabhakar Ragde and
Dimitrios M. Thilikos},
title = {Finding Smallest Supertrees Under Minor Containment},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {3},
pages = {445--465},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000259},
doi = {10.1142/S0129054100000259},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/NishimuraRT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/HeideKR00,
author = {Friedhelm Meyer auf der Heide and
Miroslaw Kutylowski and
Prabhakar Ragde},
editor = {Arndt Bode and
Thomas Ludwig and
Wolfgang Karl and
Roland Wism{\"{u}}ller},
title = {Complexity Theory and Algorithms},
booktitle = {Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference,
Munich, Germany, August 29 - September 1, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1900},
pages = {455},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44520-X\_59},
doi = {10.1007/3-540-44520-X\_59},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/europar/HeideKR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GuptaNPR00,
author = {Arvind Gupta and
Naomi Nishimura and
Andrzej Proskurowski and
Prabhakar Ragde},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Embeddings of \emph{k}-Connected Graphs of Pathwidth \emph{k}},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {111--124},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_11},
doi = {10.1007/3-540-44985-X\_11},
timestamp = {Fri, 27 Mar 2020 08:50:36 +0100},
biburl = {https://dblp.org/rec/conf/swat/GuptaNPR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/NishimuraRT00,
author = {Naomi Nishimura and
Prabhakar Ragde and
Dimitrios M. Thilikos},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {On Graph Powers for Leaf-Labeled Trees},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {125--138},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_12},
doi = {10.1007/3-540-44985-X\_12},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/NishimuraRT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/NishimuraRT99,
author = {Naomi Nishimura and
Prabhakar Ragde and
Dimitrios M. Thilikos},
editor = {Peter Widmayer and
Gabriele Neyer and
Stephan J. Eidenbenz},
title = {Finding Smallest Supertrees Under Minor Containment},
booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop,
{WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1665},
pages = {303--312},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46784-X\_29},
doi = {10.1007/3-540-46784-X\_29},
timestamp = {Wed, 11 Sep 2019 13:15:53 +0200},
biburl = {https://dblp.org/rec/conf/wg/NishimuraRT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BerkmanMR98,
author = {Omer Berkman and
Yossi Matias and
Prabhakar Ragde},
title = {Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and
Range Minima over Small Domains},
journal = {J. Algorithms},
volume = {28},
number = {2},
pages = {197--215},
year = {1998},
url = {https://doi.org/10.1006/jagm.1997.0905},
doi = {10.1006/JAGM.1997.0905},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BerkmanMR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HagerupKNR98,
author = {Torben Hagerup and
Jyrki Katajainen and
Naomi Nishimura and
Prabhakar Ragde},
title = {Characterizing Multiterminal Flow Networks and Computing Flows in
Networks of Small Treewidth},
journal = {J. Comput. Syst. Sci.},
volume = {57},
number = {3},
pages = {366--375},
year = {1998},
url = {https://doi.org/10.1006/jcss.1998.1592},
doi = {10.1006/JCSS.1998.1592},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HagerupKNR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BussKRS96,
author = {Jonathan F. Buss and
Paris C. Kanellakis and
Prabhakar Ragde and
Alexander A. Shvartsman},
title = {Parallel Algorithms with Processor Failures and Delays},
journal = {J. Algorithms},
volume = {20},
number = {1},
pages = {45--86},
year = {1996},
url = {https://doi.org/10.1006/jagm.1996.0003},
doi = {10.1006/JAGM.1996.0003},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BussKRS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DymondFNRR96,
author = {Patrick W. Dymond and
Faith E. Fich and
Naomi Nishimura and
Prabhakar Ragde and
Walter L. Ruzzo},
title = {Pointers versus Arithmetic in PRAMs},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {218--232},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0063},
doi = {10.1006/JCSS.1996.0063},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DymondFNRR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icde/BuhrGNR96,
author = {Peter A. Buhr and
Anil K. Goel and
Naomi Nishimura and
Prabhakar Ragde},
editor = {Stanley Y. W. Su},
title = {Parallel Pointer-Based Join Algorithms in Memory-mapped Environments},
booktitle = {Proceedings of the Twelfth International Conference on Data Engineering,
February 26 - March 1, 1996, New Orleans, Louisiana, {USA}},
pages = {266--275},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/ICDE.1996.492115},
doi = {10.1109/ICDE.1996.492115},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icde/BuhrGNR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/BuhrGNR96,
author = {Peter A. Buhr and
Anil K. Goel and
Naomi Nishimura and
Prabhakar Ragde},
editor = {Guy E. Blelloch},
title = {{\(\mathrm{\mu}\)}Database: Parallelism in a Memory-Mapped Environment},
booktitle = {Proceedings of the 8th Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '96, Padua, Italy, June 24-26, 1996},
pages = {196--199},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/237502.237547},
doi = {10.1145/237502.237547},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/BuhrGNR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FichKKLR95,
author = {Faith E. Fich and
Miroslaw Kowaluk and
Miroslaw Kutylowski and
Krzysztof Lorys and
Prabhakar Ragde},
title = {Retrieval of Scattered Information by EREW, CREW, and {CRCW} PRAMs},
journal = {Comput. Complex.},
volume = {5},
number = {2},
pages = {113--131},
year = {1995},
url = {https://doi.org/10.1007/BF01268141},
doi = {10.1007/BF01268141},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/FichKKLR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HagerupKNR95,
author = {Torben Hagerup and
Jyrki Katajainen and
Naomi Nishimura and
Prabhakar Ragde},
editor = {Kenneth L. Clarkson},
title = {Characterizations of k-Terminal Flow Networks and Computing Network
Flows in Partial k-Trees},
booktitle = {Proceedings of the Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
22-24 January 1995. San Francisco, California, {USA}},
pages = {641--649},
publisher = {{ACM/SIAM}},
year = {1995},
url = {http://dl.acm.org/citation.cfm?id=313651.313832},
timestamp = {Thu, 05 Jul 2018 07:29:25 +0200},
biburl = {https://dblp.org/rec/conf/soda/HagerupKNR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Ragde93,
author = {Prabhakar Ragde},
title = {The Parallel Simplicity of Compaction and Chaining},
journal = {J. Algorithms},
volume = {14},
number = {3},
pages = {371--380},
year = {1993},
url = {https://doi.org/10.1006/jagm.1993.1019},
doi = {10.1006/JAGM.1993.1019},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Ragde93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DymondFNRR93,
author = {Patrick W. Dymond and
Faith E. Fich and
Naomi Nishimura and
Prabhakar Ragde and
Walter L. Ruzzo},
title = {Pointers versus Arithmetic in PRAMs},
booktitle = {Proceedings of the Eigth Annual Structure in Complexity Theory Conference,
San Diego, CA, USA, May 18-21, 1993},
pages = {239--252},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SCT.1993.336522},
doi = {10.1109/SCT.1993.336522},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DymondFNRR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BerkmanMR93,
author = {Omer Berkman and
Yossi Matias and
Prabhakar Ragde},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima,
and Related Problems with Integer Inputs},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {175--187},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_246},
doi = {10.1007/3-540-57155-8\_246},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BerkmanMR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Ragde92,
author = {Prabhakar Ragde},
title = {Processor-Time Tradeoffs in {PRAM} Simulations},
journal = {J. Comput. Syst. Sci.},
volume = {44},
number = {1},
pages = {103--113},
year = {1992},
url = {https://doi.org/10.1016/0022-0000(92)90006-5},
doi = {10.1016/0022-0000(92)90006-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Ragde92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FichKLKR92,
author = {Faith E. Fich and
Miroslaw Kowaluk and
Krzysztof Lorys and
Miroslaw Kutylowski and
Prabhakar Ragde},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Retrieval of scattered information by EREW, {CREW} and {CRCW} PRAMs},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {30--41},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_3},
doi = {10.1007/3-540-55706-7\_3},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/FichKLKR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RagdeW91,
author = {Prabhakar Ragde and
Avi Wigderson},
title = {Linear-Size Constant-Depth Polylog-Treshold Circuits},
journal = {Inf. Process. Lett.},
volume = {39},
number = {3},
pages = {143--146},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90110-4},
doi = {10.1016/0020-0190(91)90110-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RagdeW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ragde91,
author = {Prabhakar Ragde},
title = {Analysis of an Asynchronous {PRAM} Algorithm},
journal = {Inf. Process. Lett.},
volume = {39},
number = {5},
pages = {253--256},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90024-C},
doi = {10.1016/0020-0190(91)90024-C},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ragde91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Ragde91,
author = {Prabhakar Ragde},
title = {Extracting Poetry from Technical Paper s},
journal = {{SIGACT} News},
volume = {22},
number = {2},
pages = {50},
year = {1991},
url = {https://doi.org/10.1145/122295.993137},
doi = {10.1145/122295.993137},
timestamp = {Tue, 28 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/Ragde91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GrolmuszR90,
author = {Vince Grolmusz and
Prabhakar Ragde},
title = {Incomparability in parallel computation},
journal = {Discret. Appl. Math.},
volume = {29},
number = {1},
pages = {63--78},
year = {1990},
url = {https://doi.org/10.1016/0166-218X(90)90082-N},
doi = {10.1016/0166-218X(90)90082-N},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GrolmuszR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/NewmanRW90,
author = {Ilan Newman and
Prabhakar Ragde and
Avi Wigderson},
title = {Perfect Hashing, Graph Entropy, and Circuit Complexity},
booktitle = {Proceedings: Fifth Annual Structure in Complexity Theory Conference,
Universitat Polit{\`{e}}cnica de Catalunya, Barcelona, Spain, July
8-11, 1990},
pages = {91--99},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/SCT.1990.113958},
doi = {10.1109/SCT.1990.113958},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/NewmanRW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Radge90,
author = {Prabhakar Ragde},
editor = {Mike Paterson},
title = {The Parallel Simplicity of Compaction and Chaining},
booktitle = {Automata, Languages and Programming, 17th International Colloquium,
ICALP90, Warwick University, England, UK, July 16-20, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {443},
pages = {744--751},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/BFb0032071},
doi = {10.1007/BFB0032071},
timestamp = {Tue, 03 Sep 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Radge90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LubyR89,
author = {Michael Luby and
Prabhakar Ragde},
title = {A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior},
journal = {Algorithmica},
volume = {4},
number = {4},
pages = {551--567},
year = {1989},
url = {https://doi.org/10.1007/BF01553908},
doi = {10.1007/BF01553908},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LubyR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/YeshaFLR89,
author = {Faith E. Fich and
Ming Li and
Prabhakar Ragde and
Yaacov Yesha},
title = {On the Power of Concurrent-Write PRAMs With Read-Only Memory},
journal = {Inf. Comput.},
volume = {83},
number = {2},
pages = {234--244},
year = {1989},
url = {https://doi.org/10.1016/0890-5401(89)90059-X},
doi = {10.1016/0890-5401(89)90059-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/YeshaFLR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GafniNR89,
author = {Eli Gafni and
Joseph Naor and
Prabhakar Ragde},
title = {On Separating the Erew and Crew Pram Models},
journal = {Theor. Comput. Sci.},
volume = {68},
number = {3},
pages = {343--346},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90169-2},
doi = {10.1016/0304-3975(89)90169-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GafniNR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FichRW88,
author = {Faith E. Fich and
Prabhakar Ragde and
Avi Wigderson},
title = {Simulations Among Concurrent-Write PRAMs},
journal = {Algorithmica},
volume = {3},
pages = {43--51},
year = {1988},
url = {https://doi.org/10.1007/BF01762109},
doi = {10.1007/BF01762109},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FichRW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FichRW88,
author = {Faith E. Fich and
Prabhakar Ragde and
Avi Wigderson},
title = {Relations Between Concurrent-Write Models of Parallel Computation},
journal = {{SIAM} J. Comput.},
volume = {17},
number = {3},
pages = {606--627},
year = {1988},
url = {https://doi.org/10.1137/0217037},
doi = {10.1137/0217037},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FichRW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/RagdeSSW88,
author = {Prabhakar Ragde and
William L. Steiger and
Endre Szemer{\'{e}}di and
Avi Wigderson},
title = {The Parallel Complexity of Element Distinctness is Omega (sqrt(log
n))},
journal = {{SIAM} J. Discret. Math.},
volume = {1},
number = {3},
pages = {399--410},
year = {1988},
url = {https://doi.org/10.1137/0401040},
doi = {10.1137/0401040},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/RagdeSSW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GrolmuszR87,
author = {Vince Grolmusz and
Prabhakar Ragde},
title = {Incomparability in Parallel Computation},
booktitle = {28th Annual Symposium on Foundations of Computer Science, Los Angeles,
California, USA, 27-29 October 1987},
pages = {89--98},
publisher = {{IEEE} Computer Society},
year = {1987},
url = {https://doi.org/10.1109/SFCS.1987.34},
doi = {10.1109/SFCS.1987.34},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GrolmuszR87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/LubyR85,
author = {Michael Luby and
Prabhakar Ragde},
editor = {Wilfried Brauer},
title = {A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior
(Preliminary Version)},
booktitle = {Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece,
July 15-19, 1985, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {194},
pages = {394--403},
publisher = {Springer},
year = {1985},
url = {https://doi.org/10.1007/BFb0015765},
doi = {10.1007/BFB0015765},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/LubyR85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FichHRW85,
author = {Faith E. Fich and
Friedhelm Meyer auf der Heide and
Prabhakar Ragde and
Avi Wigderson},
editor = {Robert Sedgewick},
title = {One, Two, Three {\textbackslash}dots Infinity: Lower Bounds for Parallel
Computation},
booktitle = {Proceedings of the 17th Annual {ACM} Symposium on Theory of Computing,
May 6-8, 1985, Providence, Rhode Island, {USA}},
pages = {48--58},
publisher = {{ACM}},
year = {1985},
url = {https://doi.org/10.1145/22145.22151},
doi = {10.1145/22145.22151},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FichHRW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/FichRW84,
author = {Faith E. Fich and
Prabhakar Ragde and
Avi Wigderson},
editor = {Tiko Kameda and
Jayadev Misra and
Joseph G. Peters and
Nicola Santoro},
title = {Relations Between Concurrent-Write Models of Parallel Computation},
booktitle = {Proceedings of the Third Annual {ACM} Symposium on Principles of Distributed
Computing, Vancouver, B. C., Canada, August 27-29, 1984},
pages = {179--189},
publisher = {{ACM}},
year = {1984},
url = {https://doi.org/10.1145/800222.806745},
doi = {10.1145/800222.806745},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/FichRW84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-09-05 01:14 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:
