Zobrazeno 1 - 10
of 61
pro vyhledávání: '"Prabhakar Ragde"'
Autor:
Prabhakar Ragde
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 230, Iss Proc. TFPIE 2015/6, Pp 63-75 (2016)
Proust is a small Racket program offering rudimentary interactive assistance in the development of verified proofs for propositional and predicate logic. It is constructed in stages, some of which are done by students before using it to complete proo
Externí odkaz:
https://doaj.org/article/040fd600f4be4a7e916c6fa8d79ffd85
Autor:
Prabhakar Ragde
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 170, Iss Proc. TFPIE 2014, Pp 78-87 (2014)
Efficient implementations of sets and maps (dictionaries) are important in computer science, and balanced binary search trees are the basis of the best practical implementations. Pedagogically, however, they are often quite complicated, especially wi
Externí odkaz:
https://doaj.org/article/6e6599982a4c424b8b7e886fa9064179
Autor:
Prabhakar Ragde
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 106, Iss Proc. TFPIE 2012, Pp 40-49 (2013)
We commonly think of mathematics as bringing precision to application domains, but its relationship with computer science is more complex. This experience report on the use of Racket and Haskell to teach a required first university CS course to stude
Externí odkaz:
https://doaj.org/article/16beecf3a09a4f3ea63698f3023c5e0c
Autor:
Prabhakar Ragde
Publikováno v:
Journal of Functional Programming. 30
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e581c9bcf3ae168763fd62268a5661f
https://doi.org/10.1017/s0956796820000179
https://doi.org/10.1017/s0956796820000179
Autor:
Christian Knauer, Sue Whitesides, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Michael R. Fellows, Naomi Nishimura, Prabhakar Ragde
Publikováno v:
Algorithmica. 52:167-176
We obtain faster algorithms for problems such as r-dimensional matching and r-set packing when the size k of the solution is considered a parameter. We first establish a general framework for finding and exploiting small problem kernels (of size poly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bca6c571270bb042442b5aeb88fe32cb
https://doi.org/10.1007/s00453-007-9146-y
https://doi.org/10.1007/s00453-007-9146-y
Autor:
David R. Wood, Naomi Nishimura, Prabhakar Ragde, Catherine McCartin, Matthew Kitching, Vida Dujmović, Sue Whitesides, Giuseppe Liotta, Michael R. Fellows, Frances A. Rosamond
Publikováno v:
Algorithmica. 52:267-292
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admitting crossing-free h-layer drawings (for fixed h) have bounded pathwidth.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ab1788da9c674b18c579081efca0a8a
https://doi.org/10.1007/s00453-007-9151-1
https://doi.org/10.1007/s00453-007-9151-1
Publikováno v:
Acta Informatica. 44:509-523
We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form. Our algorithm is based on the detection of strong backdoor sets of bounded size; each instantiation of the variables of a strong backdoor set
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94ca808d94f0cc7433e9cc6895f417be
https://doi.org/10.1007/s00236-007-0056-x
https://doi.org/10.1007/s00236-007-0056-x
Autor:
Matthew Kitching, Michael Hallett, Vida Dujmović, David R. Wood, Giuseppe Liotta, Catherine McCartin, Matthew Suderman, Prabhakar Ragde, Frances A. Rosamond, Michael R. Fellows, Sue Whitesides, Naomi Nishimura
Publikováno v:
Graph Drawing
A bipartite graph is biplanar if the vertices can be placed on two parallel lines (layers) in the plane such that there are no edge crossings when edges are drawn as line segments between the layers. In this paper we study the 2-Layer Planarization p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a2a465933a6587046fbe2088944ed4f8
https://doi.org/10.1007/s00453-005-1181-y
https://doi.org/10.1007/s00453-005-1181-y
Publikováno v:
Discrete Applied Mathematics. 152(1-3):229-245
Our goal in this paper is the development of fast algorithms for recognizing general classes of graphs. We seek algorithms whose complexity can be expressed as a linear function of the graph size plus an exponential function of k, a natural parameter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::141c53ec398b83cda12c4255d1567765
Publikováno v:
Discrete Applied Mathematics. 145:242-265
We present O(n^3) embedding algorithms (subgraph isomorphism and its generalizations) for classes of graphs of bounded pathwidth, where n is the number of vertices in the graph. These include the first polynomial-time algorithm for minor containment
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::93a2e21edf55ab13c6edf1b2b3062e00
https://doi.org/10.1016/j.dam.2002.12.005
https://doi.org/10.1016/j.dam.2002.12.005