Sort by: Order: Results:

  • Goyal, Navin; Gupta, Manoj (Elsevier, 2019-01)
    In their seminal paper Sleator and Tarjan (1985) [15], the authors conjectured that the splay tree is a dynamically optimal binary search tree (BST). In spite of decades of intensive research, the problem remains open. ...
  • Baswana, Surender; Gupta, Manoj; Sen, Sandeep (Society for Industrial and Applied Mathematics, 2018-01)
    We present an algorithm for maintaining a maximal matching in a graph under addition and deletion of edges. Our algorithm is randomized and it takes expected amortized O(log n) time for each edge update, where n is the ...

Search Digital Repository


My Account