( en | de | ru )

 

Disambiguation of "Baswana, Surender"

Author of the publication

copydeleteadd this publication to your clipboard
Dynamic DFS in Undirected Graphs: breaking the O(m) barrier.

, , , and . SODA, page 730-739. SIAM, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Surender Kumar Gupta

Surender Singh Roperia

 

Other publications of authors with the same name

Incremental DFS algorithms: a theoretical and experimental study., , and . SODA, page 53-72. SIAM, (2018)Approximate Single Source Fault Tolerant Shortest Path., , , and . SODA, page 1901-1915. SIAM, (2018)Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error., , , and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 609-621. Springer, (2008)Planar Graph Blocking for External Searching., and . FSTTCS, volume 1974 of Lecture Notes in Computer Science, page 252-263. Springer, (2000)A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs, and . Random Struct. Algorithms, 30 (4): 532-563 (2007)Faster Streaming algorithms for graph spanners. CoRR, (2006)Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient., , and . CoRR, (2018)Implied Set Closure and Its Application to Memory Consistency Verification., , and . CAV, volume 5123 of Lecture Notes in Computer Science, page 94-106. Springer, (2008)Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs., and . SIAM J. Comput., 39 (7): 2865-2896 (2010)A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs., and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 384-296. Springer, (2003)