BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × China
1 × Denmark
1 × Iceland
1 × The Netherlands
1 × USA
Collaborated with:
S.Sen S.Khan R.Chouhan S.Roy S.K.Mehta V.Powar R.Hariharan A.Gaur J.Upadhyay
Talks about:
algorithm (3) graph (3) maintain (2) closur (2) path (2) statement (1) increment (1) decrement (1) unweight (1) undirect (1)

Person: Surender Baswana

DBLP DBLP: Baswana:Surender

Contributed to:

ICALP (1) 20142014
CGO 20132013
CAV 20082008
ICALP (1) 20082008
ICALP 20032003
STOC 20022002

Wrote 6 papers:

ICALP-v1-2014-BaswanaK #algorithm #graph #incremental #maintenance
Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs (SB, SK), pp. 138–149.
CGO-2013-ChouhanRB #interactive #profiling
Pertinent path profiling: Tracking interactions among relevant statements (RC, SR, SB), p. 12.
CAV-2008-BaswanaMP #consistency #memory management #set #verification
Implied Set Closure and Its Application to Memory Consistency Verification (SB, SKM, VP), pp. 94–106.
ICALP-A-2008-BaswanaGSU #constant #distance #fault #graph #polynomial
Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error (SB, AG, SS, JU), pp. 609–621.
ICALP-2003-BaswanaS #algorithm #graph #linear
A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs (SB, SS), pp. 384–296.
STOC-2002-BaswanaHS #algorithm #maintenance #transitive
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths (SB, RH, SS), pp. 117–123.

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.