default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Ramesh Hariharan
@article{DBLP:journals/siamcomp/FungHHP19,
author = {Wai Shing Fung and
Ramesh Hariharan and
Nicholas J. A. Harvey and
Debmalya Panigrahi},
title = {A General Framework for Graph Sparsification},
journal = {{SIAM} J. Comput.},
volume = {48},
number = {4},
pages = {1196--1223},
year = {2019},
url = {https://doi.org/10.1137/16M1091666},
doi = {10.1137/16M1091666},
timestamp = {Fri, 27 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FungHHP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hipc/Hariharan19,
author = {Ramesh Hariharan},
title = {Genome Sequencing for Disease Diagnosis: The Confluence of Biology
and Computing},
booktitle = {26th {IEEE} International Conference on High Performance Computing,
Data, and Analytics, HiPC 2019, Hyderabad, India, December 17-20,
2019},
pages = {183},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/HiPC.2019.00031},
doi = {10.1109/HIPC.2019.00031},
timestamp = {Thu, 20 Feb 2020 16:19:46 +0100},
biburl = {https://dblp.org/rec/conf/hipc/Hariharan19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Hariharan16,
author = {Ramesh Hariharan},
title = {Maximum Agreement Subtree (of 2 Binary Trees)},
booktitle = {Encyclopedia of Algorithms},
pages = {1218--1221},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_220},
doi = {10.1007/978-1-4939-2864-4\_220},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Hariharan16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/HariharanKTECB15,
author = {Ramesh Hariharan and
Ananth Kalyanaraman and
Michela Taufer and
Trilce Estrada and
Pietro Cicotti and
Pavan Balaji},
title = {HiCOMB 2015 Keynote and Invited Talks},
booktitle = {2015 {IEEE} International Parallel and Distributed Processing Symposium
Workshop, {IPDPS} 2015, Hyderabad, India, May 25-29, 2015},
pages = {331},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/IPDPSW.2015.174},
doi = {10.1109/IPDPSW.2015.174},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/HariharanKTECB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ploscb/SosaSMVHPFHLFTEC12,
author = {Maria Ximena Sosa and
I. K. Ashok Sivakumar and
Samantha Maragh and
Vamsi Veeramachaneni and
Ramesh Hariharan and
Minothi Parulekar and
Karin M. Fredrikson and
Timothy T. Harkins and
Jeffrey Lin and
Andrew B. Feldman and
Pramila Tata and
Georg B. Ehret and
Aravinda Chakravarti},
title = {Next-Generation Sequencing of Human Mitochondrial Reference Genomes
Uncovers High Heteroplasmy Frequency},
journal = {PLoS Comput. Biol.},
volume = {8},
number = {10},
year = {2012},
url = {https://doi.org/10.1371/journal.pcbi.1002737},
doi = {10.1371/JOURNAL.PCBI.1002737},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ploscb/SosaSMVHPFHLFTEC12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ic3/Hariharan12,
author = {Ramesh Hariharan},
editor = {Manish Parashar and
Dinesh K. Kaushik and
Omer F. Rana and
Ravi Samtaney and
Yuanyuan Yang and
Albert Y. Zomaya},
title = {Data-Driven Biology and Computation},
booktitle = {Contemporary Computing - 5th International Conference, {IC3} 2012,
Noida, India, August 6-8, 2012. Proceedings},
series = {Communications in Computer and Information Science},
volume = {306},
pages = {7},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32129-0\_6},
doi = {10.1007/978-3-642-32129-0\_6},
timestamp = {Wed, 24 May 2017 08:31:09 +0200},
biburl = {https://dblp.org/rec/conf/ic3/Hariharan12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcisd/HariharanJNSVLS11,
author = {Ramesh Hariharan and
Anand Janakiraman and
Ramaswamy Nilakantan and
Bhupender Singh and
Sajith Varghese and
Gregory A. Landrum and
Ansgar Schuffenhauer},
title = {MultiMCS: {A} Fast Algorithm for the Maximum Common Substructure Problem
on Multiple Molecules},
journal = {J. Chem. Inf. Model.},
volume = {51},
number = {4},
pages = {788--806},
year = {2011},
url = {https://doi.org/10.1021/ci100297y},
doi = {10.1021/CI100297Y},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcisd/HariharanJNSVLS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FungHHP11,
author = {Wai Shing Fung and
Ramesh Hariharan and
Nicholas J. A. Harvey and
Debmalya Panigrahi},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {A general framework for graph sparsification},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {71--80},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993647},
doi = {10.1145/1993636.1993647},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FungHHP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-4080,
author = {Ramesh Hariharan and
Debmalya Panigrahi},
title = {A General Framework for Graph Sparsification},
journal = {CoRR},
volume = {abs/1004.4080},
year = {2010},
url = {http://arxiv.org/abs/1004.4080},
eprinttype = {arXiv},
eprint = {1004.4080},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-4080.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1005-0670,
author = {Ramesh Hariharan and
Debmalya Panigrahi},
title = {A Linear-time Algorithm for Sparsification of Unweighted Graphs},
journal = {CoRR},
volume = {abs/1005.0670},
year = {2010},
url = {http://arxiv.org/abs/1005.0670},
eprinttype = {arXiv},
eprint = {1005.0670},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1005-0670.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BhalgatH09,
author = {Anand Bhalgat and
Ramesh Hariharan},
editor = {Claire Mathieu},
title = {Fast edge orientation for unweighted graphs},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {265--272},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.30},
doi = {10.1137/1.9781611973068.30},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BhalgatH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-3609,
author = {Vinay Jethava and
Krishnan Suresh and
Chiranjib Bhattacharyya and
Ramesh Hariharan},
title = {Randomized Algorithms for Large scale SVMs},
journal = {CoRR},
volume = {abs/0909.3609},
year = {2009},
url = {http://arxiv.org/abs/0909.3609},
eprinttype = {arXiv},
eprint = {0909.3609},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0909-3609.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HariharanKM08,
author = {Ramesh Hariharan and
Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Faster Algorithms for Minimum Cycle Basis in Directed Graphs},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {4},
pages = {1430--1447},
year = {2008},
url = {https://doi.org/10.1137/060670730},
doi = {10.1137/060670730},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HariharanKM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/HariharanMV08a,
author = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
editor = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
title = {2008 Abstracts Collection - {IARCS} Annual Conference on Foundations
of Software Technology and Theoretical Computer Science},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2008, December 9-11, 2008,
Bangalore, India},
series = {LIPIcs},
volume = {2},
pages = {10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1772},
doi = {10.4230/LIPICS.FSTTCS.2008.1772},
timestamp = {Wed, 08 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/HariharanMV08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/HariharanMV08,
author = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
editor = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
title = {2008 Preface - {IARCS} Annual Conference on Foundations of Software
Technology and Theoretical Computer Science},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2008, December 9-11, 2008,
Bangalore, India},
series = {LIPIcs},
volume = {2},
pages = {i},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1771},
doi = {10.4230/LIPICS.FSTTCS.2008.1771},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/HariharanMV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BhalgatHKP08,
author = {Anand Bhalgat and
Ramesh Hariharan and
Telikepalli Kavitha and
Debmalya Panigrahi},
editor = {Shang{-}Hua Teng},
title = {Fast edge splitting and Edmonds' arborescence construction for unweighted
graphs},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {455--464},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347132},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BhalgatHKP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2008,
editor = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
title = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2008, December 9-11, 2008,
Bangalore, India},
series = {LIPIcs},
volume = {2},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2008},
timestamp = {Tue, 11 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/2008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Hariharan08,
author = {Ramesh Hariharan},
editor = {Ming{-}Yang Kao},
title = {Maximum Agreement Subtree (of 2 Binary Trees)},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_220},
doi = {10.1007/978-0-387-30162-4\_220},
timestamp = {Thu, 27 Jun 2019 16:25:31 +0200},
biburl = {https://dblp.org/rec/reference/algo/Hariharan08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BaswanaHS07,
author = {Surender Baswana and
Ramesh Hariharan and
Sandeep Sen},
title = {Improved decremental algorithms for maintaining transitive closure
and all-pairs shortest paths},
journal = {J. Algorithms},
volume = {62},
number = {2},
pages = {74--92},
year = {2007},
url = {https://doi.org/10.1016/j.jalgor.2004.08.004},
doi = {10.1016/J.JALGOR.2004.08.004},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BaswanaHS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/KumarBH07,
author = {Krishnan Kumar and
Chiru Bhattacharyya and
Ramesh Hariharan},
editor = {John C. Platt and
Daphne Koller and
Yoram Singer and
Sam T. Roweis},
title = {A Randomized Algorithm for Large Scale Support Vector Learning},
booktitle = {Advances in Neural Information Processing Systems 20, Proceedings
of the Twenty-First Annual Conference on Neural Information Processing
Systems, Vancouver, British Columbia, Canada, December 3-6, 2007},
pages = {793--800},
publisher = {Curran Associates, Inc.},
year = {2007},
url = {https://proceedings.neurips.cc/paper/2007/hash/ba2fd310dcaa8781a9a652a31baf3c68-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/KumarBH07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HariharanKP07,
author = {Ramesh Hariharan and
Telikepalli Kavitha and
Debmalya Panigrahi},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Efficient algorithms for computing all low \emph{s-t} edge connectivities
and related problems},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {127--136},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283398},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/HariharanKP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HariharanKPB07,
author = {Ramesh Hariharan and
Telikepalli Kavitha and
Debmalya Panigrahi and
Anand Bhalgat},
editor = {David S. Johnson and
Uriel Feige},
title = {An {\~{O}}(mn) Gomory-Hu tree construction algorithm for unweighted
graphs},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {605--614},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250879},
doi = {10.1145/1250790.1250879},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HariharanKPB07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HariharanKM06,
author = {Ramesh Hariharan and
Telikepalli Kavitha and
Kurt Mehlhorn},
editor = {Michele Bugliesi and
Bart Preneel and
Vladimiro Sassone and
Ingo Wegener},
title = {A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed
Graphs},
booktitle = {Automata, Languages and Programming, 33rd International Colloquium,
{ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {4051},
pages = {250--261},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11786986\_23},
doi = {10.1007/11786986\_23},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HariharanKM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ColeH05,
author = {Richard Cole and
Ramesh Hariharan},
title = {Dynamic {LCA} Queries on Trees},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {4},
pages = {894--923},
year = {2005},
url = {https://doi.org/10.1137/S0097539700370539},
doi = {10.1137/S0097539700370539},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ColeH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/ColeGHMP04,
author = {Richard Cole and
Zvi Galil and
Ramesh Hariharan and
S. Muthukrishnan and
Kunsoo Park},
title = {Parallel two dimensional witness computation},
journal = {Inf. Comput.},
volume = {188},
number = {1},
pages = {20--67},
year = {2004},
url = {https://doi.org/10.1016/S0890-5401(03)00162-7},
doi = {10.1016/S0890-5401(03)00162-7},
timestamp = {Wed, 19 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/ColeGHMP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/ChandruHK04,
author = {Vijay Chandru and
Ramesh Hariharan and
Narasimha M. Krishnakumar},
editor = {Kamal Lodaya and
Meena Mahajan},
title = {Short-Cuts on Star, Source and Planar Unfoldings},
booktitle = {{FSTTCS} 2004: Foundations of Software Technology and Theoretical
Computer Science, 24th International Conference, Chennai, India, December
16-18, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3328},
pages = {174--185},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30538-5\_15},
doi = {10.1007/978-3-540-30538-5\_15},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/ChandruHK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/AmirCHLP03,
author = {Amihood Amir and
Richard Cole and
Ramesh Hariharan and
Moshe Lewenstein and
Ely Porat},
title = {Overlap matching},
journal = {Inf. Comput.},
volume = {181},
number = {1},
pages = {57--74},
year = {2003},
url = {https://doi.org/10.1016/S0890-5401(02)00035-4},
doi = {10.1016/S0890-5401(02)00035-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/AmirCHLP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HariharanV03,
author = {Ramesh Hariharan and
V. Vinay},
title = {String matching in {\~{O}}(sqrt(n)+sqrt(m)) quantum time},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {103--110},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00010-8},
doi = {10.1016/S1570-8667(03)00010-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HariharanV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ColeH03,
author = {Richard Cole and
Ramesh Hariharan},
title = {Tree Pattern Matching to Subset Matching in Linear Time},
journal = {{SIAM} J. Comput.},
volume = {32},
number = {4},
pages = {1056--1066},
year = {2003},
url = {https://doi.org/10.1137/S0097539700382704},
doi = {10.1137/S0097539700382704},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ColeH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ColeH03a,
author = {Richard Cole and
Ramesh Hariharan},
title = {Faster Suffix Tree Construction with Missing Suffix Links},
journal = {{SIAM} J. Comput.},
volume = {33},
number = {1},
pages = {26--42},
year = {2003},
url = {https://doi.org/10.1137/S0097539701424465},
doi = {10.1137/S0097539701424465},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ColeH03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BaswanaHS03,
author = {Surender Baswana and
Ramesh Hariharan and
Sandeep Sen},
title = {Maintaining all-pairs approximate shortest paths under deletion of
edges},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {394--403},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644171},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BaswanaHS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ColeH03,
author = {Richard Cole and
Ramesh Hariharan},
editor = {Lawrence L. Larmore and
Michel X. Goemans},
title = {A fast algorithm for computing steiner edge connectivity},
booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
June 9-11, 2003, San Diego, CA, {USA}},
pages = {167--176},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/780542.780568},
doi = {10.1145/780542.780568},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ColeH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/PanduranganH02,
author = {Gopal Pandurangan and
Ramesh Hariharan},
title = {The restriction mapping problem revisited},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {3},
pages = {526--544},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00008-9},
doi = {10.1016/S0022-0000(02)00008-9},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/PanduranganH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ColeH02,
author = {Richard Cole and
Ramesh Hariharan},
title = {Approximate String Matching: {A} Simpler Faster Algorithm},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {6},
pages = {1761--1782},
year = {2002},
url = {https://doi.org/10.1137/S0097539700370527},
doi = {10.1137/S0097539700370527},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ColeH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lec/BaliHM02,
author = {Kalika Bali and
Ramesh Hariharan and
Swami Manohar},
title = {Language Technology Solutions in Simputer: an Overview},
booktitle = {2002 Language Engineering Conference {(LEC} 2002), 13-15 December
2002, Hyderabad, India},
pages = {189},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/LEC.2002.1182308},
doi = {10.1109/LEC.2002.1182308},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lec/BaliHM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BaswanaHS02,
author = {Surender Baswana and
Ramesh Hariharan and
Sandeep Sen},
editor = {John H. Reif},
title = {Improved decremental algorithms for maintaining transitive closure
and all-pairs shortest paths},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {117--123},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509928},
doi = {10.1145/509907.509928},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BaswanaHS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ColeH02,
author = {Richard Cole and
Ramesh Hariharan},
editor = {John H. Reif},
title = {Verifying candidate matches in sparse and wildcard matching},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {592--601},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509992},
doi = {10.1145/509907.509992},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ColeH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ColeHLP01,
author = {Richard Cole and
Ramesh Hariharan and
Moshe Lewenstein and
Ely Porat},
editor = {S. Rao Kosaraju},
title = {A faster implementation of the Goemans-Williamson clustering algorithm},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {17--25},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365414},
timestamp = {Thu, 19 Mar 2015 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ColeHLP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AmirCHLP01,
author = {Amihood Amir and
Richard Cole and
Ramesh Hariharan and
Moshe Lewenstein and
Ely Porat},
editor = {S. Rao Kosaraju},
title = {Overlap matching},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {279--288},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365459},
timestamp = {Thu, 19 Mar 2015 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AmirCHLP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2001,
editor = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
title = {{FST} {TCS} 2001: Foundations of Software Technology and Theoretical
Computer Science, 21st Conference, Bangalore, India, December 13-15,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2245},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45294-X},
doi = {10.1007/3-540-45294-X},
isbn = {3-540-43002-4},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/2001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ColeFHPT00,
author = {Richard Cole and
Martin Farach{-}Colton and
Ramesh Hariharan and
Teresa M. Przytycka and
Mikkel Thorup},
title = {An \emph{O}(\emph{n}log \emph{n}) Algorithm for the Maximum Agreement
Subtree Problem for Binary Trees},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {5},
pages = {1385--1404},
year = {2000},
url = {https://doi.org/10.1137/S0097539796313477},
doi = {10.1137/S0097539796313477},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ColeFHPT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ColeH00,
author = {Richard Cole and
Ramesh Hariharan},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Faster suffix tree construction with missing suffix links},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {407--415},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335352},
doi = {10.1145/335305.335352},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ColeH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AryaCMR00,
author = {Sunil Arya and
Siu{-}Wing Cheng and
David M. Mount and
Ramesh Hariharan},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Efficient Expected-Case Algorithms for Planar Point Location},
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 = {353--366},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_31},
doi = {10.1007/3-540-44985-X\_31},
timestamp = {Fri, 27 Mar 2020 08:50:36 +0100},
biburl = {https://dblp.org/rec/conf/swat/AryaCMR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ColeH99,
author = {Richard Cole and
Ramesh Hariharan},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {Dynamic {LCA} Queries on Trees},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {235--244},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314564},
timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
biburl = {https://dblp.org/rec/conf/soda/ColeH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ColeHI99,
author = {Richard Cole and
Ramesh Hariharan and
Piotr Indyk},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {Tree Pattern Matching and Subset Matching in Deterministic \emph{O}(\emph{n}
log\({}^{\mbox{3}}\) \emph{n})-time},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {245--254},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314565},
timestamp = {Thu, 19 Mar 2015 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ColeHI99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CrochmoreGHMR98,
author = {Maxime Crochemore and
Leszek Gasieniec and
Ramesh Hariharan and
S. Muthukrishnan and
Wojciech Rytter},
title = {A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern
Matching},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {3},
pages = {668--681},
year = {1998},
url = {https://doi.org/10.1137/S0097539795280068},
doi = {10.1137/S0097539795280068},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CrochmoreGHMR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ColeH98,
author = {Richard Cole and
Ramesh Hariharan},
editor = {Howard J. Karloff},
title = {Approximate String Matching: {A} Simpler Faster Algorithm},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {463--472},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314827},
timestamp = {Thu, 05 Jul 2018 07:29:49 +0200},
biburl = {https://dblp.org/rec/conf/soda/ColeH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Hariharan97,
author = {Ramesh Hariharan},
title = {Optimal Parallel Suffix Tree Construction},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {1},
pages = {44--69},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1496},
doi = {10.1006/JCSS.1997.1496},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Hariharan97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ColeH97,
author = {Richard Cole and
Ramesh Hariharan},
title = {Tighter Upper Bounds on the Exact Complexity of String Matching},
journal = {{SIAM} J. Comput.},
volume = {26},
number = {3},
pages = {803--856},
year = {1997},
url = {https://doi.org/10.1137/S009753979324694X},
doi = {10.1137/S009753979324694X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ColeH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ColeH97,
author = {Richard Cole and
Ramesh Hariharan},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {Tree Pattern Matching and Subset Matching in Randomized O(n log\({}^{\mbox{3}}\)m)
Time},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {66--75},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258553},
doi = {10.1145/258533.258553},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ColeH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/AlonKMH96,
author = {Noga Alon and
Pierre Kelsen and
Sanjeev Mahajan and
Ramesh Hariharan},
title = {Approximate Hypergraph Coloring},
journal = {Nord. J. Comput.},
volume = {3},
number = {4},
pages = {425--439},
year = {1996},
timestamp = {Mon, 24 Jul 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/njc/AlonKMH96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppl/BreslauerH96,
author = {Dany Breslauer and
Ramesh Hariharan},
title = {Optimal Parallel Construction of Minimal Suffix and Factor Automata},
journal = {Parallel Process. Lett.},
volume = {6},
number = {1},
pages = {35--44},
year = {1996},
url = {https://doi.org/10.1142/S0129626496000054},
doi = {10.1142/S0129626496000054},
timestamp = {Tue, 24 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ppl/BreslauerH96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ColeH96,
author = {Richard Cole and
Ramesh Hariharan},
editor = {{\'{E}}va Tardos},
title = {An O(n log n) Algorithm for the Maximum Agreement Subtree Problem
for Binary Trees},
booktitle = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}},
pages = {323--332},
publisher = {{ACM/SIAM}},
year = {1996},
url = {http://dl.acm.org/citation.cfm?id=313852.314079},
timestamp = {Thu, 05 Jul 2018 07:29:31 +0200},
biburl = {https://dblp.org/rec/conf/soda/ColeH96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KelsenMR96,
author = {Pierre Kelsen and
Sanjeev Mahajan and
Ramesh Hariharan},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Approximate Hypergraph Coloring},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {41--52},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_119},
doi = {10.1007/3-540-61422-2\_119},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/KelsenMR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ColeHPZ95,
author = {Richard Cole and
Ramesh Hariharan and
Mike Paterson and
Uri Zwick},
title = {Tighter Lower Bounds on the Exact Complexity of String Matching},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {1},
pages = {30--45},
year = {1995},
url = {https://doi.org/10.1137/S0097539793245829},
doi = {10.1137/S0097539793245829},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ColeHPZ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MahajanR95,
author = {Sanjeev Mahajan and
Ramesh Hariharan},
title = {Derandomizing Semidefinite Programming Based Approximation Algorithms},
booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
Wisconsin, USA, 23-25 October 1995},
pages = {162--169},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SFCS.1995.492473},
doi = {10.1109/SFCS.1995.492473},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MahajanR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/HariharanKK95,
author = {Ramesh Hariharan and
Sanjiv Kapoor and
Vijay Kumar},
editor = {Selim G. Akl and
Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {Faster Enumeration of All Spanning Trees of a Directed Graph},
booktitle = {Algorithms and Data Structures, 4th International Workshop, {WADS}
'95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {955},
pages = {428--439},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60220-8\_82},
doi = {10.1007/3-540-60220-8\_82},
timestamp = {Sun, 02 Jun 2019 21:24:17 +0200},
biburl = {https://dblp.org/rec/conf/wads/HariharanKK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/us/Hariharan94,
author = {Ramesh Hariharan},
title = {Designing Pattern Matching Algorithms by Exploiting Structural Pattern
Properties},
school = {New York University, {USA}},
year = {1994},
timestamp = {Thu, 12 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/us/Hariharan94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HariharanM94,
author = {Ramesh Hariharan and
S. Muthukrishnan},
editor = {Serge Abiteboul and
Eli Shamir},
title = {Optimal Parallel Algorithms for Prefix Matching},
booktitle = {Automata, Languages and Programming, 21st International Colloquium,
ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {820},
pages = {203--214},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58201-0\_69},
doi = {10.1007/3-540-58201-0\_69},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HariharanM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Hariharan94,
author = {Ramesh Hariharan},
editor = {Frank Thomson Leighton and
Michael T. Goodrich},
title = {Optimal parallel suffix tree construction},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of
Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec,
Canada},
pages = {290--299},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/195058.195162},
doi = {10.1145/195058.195162},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Hariharan94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ColeCGGHMPR93,
author = {Richard Cole and
Maxime Crochemore and
Zvi Galil and
Leszek Gasieniec and
Ramesh Hariharan and
S. Muthukrishnan and
Kunsoo Park and
Wojciech Rytter},
title = {Optimally fast parallel algorithms for preprocessing and pattern matching
in one and two dimensions},
booktitle = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
California, USA, 3-5 November 1993},
pages = {248--258},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SFCS.1993.366862},
doi = {10.1109/SFCS.1993.366862},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ColeCGGHMPR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/ColeHPZ93,
author = {Richard Cole and
Ramesh Hariharan and
Mike Paterson and
Uri Zwick},
title = {Which Patterns are Hard to Find?},
booktitle = {Second Israel Symposium on Theory of Computing Systems, {ISTCS} 1993,
Natanya, Israel, June 7-9, 1993, Proceedings},
pages = {59--68},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/ISTCS.1993.253483},
doi = {10.1109/ISTCS.1993.253483},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/istcs/ColeHPZ93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ColeH92,
author = {Richard Cole and
Ramesh Hariharan},
title = {Tighter Bounds on the Exact Complexity of String Matching (Extended
Abstract)},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
Pennsylvania, USA, 24-27 October 1992},
pages = {600--609},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SFCS.1992.267791},
doi = {10.1109/SFCS.1992.267791},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ColeH92.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-04-24 22:49 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:
