BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Greece
1 × The Netherlands
1 × United Kingdom
2 × USA
Collaborated with:
∅ N.Nishimura S.Szeider M.Luby F.E.Fich F.M.a.d.Heide A.Wigderson
Talks about:
binari (2) algorithm (1) shortest (1) parallel (1) mathemat (1) imprecis (1) bidirect (1) behavior (1) backdoor (1) respect (1)

Person: Prabhakar Ragde

DBLP DBLP: Ragde:Prabhakar

Contributed to:

TFPIE 20142014
TFPIE 20122012
SAT 20062006
SAT 20042004
ICALP 19851985
STOC 19851985

Wrote 6 papers:

TFPIE-2014-Ragde
Simple Balanced Binary Search Trees (PR), pp. 78–87.
TFPIE-2012-Ragde
Mathematics Is Imprecise (PR), pp. 40–49.
SAT-2006-NishimuraRS #satisfiability #using
Solving #SAT Using Vertex Covers (NN, PR, SS), pp. 396–409.
SAT-2004-NishimuraRS #detection #set
Detecting Backdoor Sets with Respect to Horn and Binary Clauses (NN, PR, SS), pp. 96–103.
ICALP-1985-LubyR #algorithm #behaviour #bidirectional
A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (ML, PR), pp. 394–403.
STOC-1985-FichHRW #bound #infinity #parallel
One, Two, Three … Infinity: Lower Bounds for Parallel Computation (FEF, FMadH, PR, AW), pp. 48–58.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.