CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt176",{id:"formSmash:upper:j_idt176",widgetVar:"widget_formSmash_upper_j_idt176",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt178_j_idt180",{id:"formSmash:upper:j_idt178:j_idt180",widgetVar:"widget_formSmash_upper_j_idt178_j_idt180",target:"formSmash:upper:j_idt178:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Dynamic algorithms: new worst-case and instance-optimal bounds via new connectionsPrimeFaces.cw("AccordionPanel","widget_formSmash_some",{id:"formSmash:some",widgetVar:"widget_formSmash_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_all",{id:"formSmash:all",widgetVar:"widget_formSmash_all",multiple:true});
function selectAll()
{
var panelSome = $(PrimeFaces.escapeClientId("formSmash:some"));
var panelAll = $(PrimeFaces.escapeClientId("formSmash:all"));
panelAll.toggle();
toggleList(panelSome.get(0).childNodes, panelAll);
toggleList(panelAll.get(0).childNodes, panelAll);
}
/*Toggling the list of authorPanel nodes according to the toggling of the closeable second panel */
function toggleList(childList, panel)
{
var panelWasOpen = (panel.get(0).style.display == 'none');
// console.log('panel was open ' + panelWasOpen);
for (var c = 0; c < childList.length; c++) {
if (childList[c].classList.contains('authorPanel')) {
clickNode(panelWasOpen, childList[c]);
}
}
}
/*nodes have styleClass ui-corner-top if they are expanded and ui-corner-all if they are collapsed */
function clickNode(collapse, child)
{
if (collapse && child.classList.contains('ui-corner-top')) {
// console.log('collapse');
child.click();
}
if (!collapse && child.classList.contains('ui-corner-all')) {
// console.log('expand');
child.click();
}
}
2018 (English)Doctoral thesis, comprehensive summary (Other academic)
##### Abstract [en]

##### Place, publisher, year, edition, pages

KTH Royal Institute of Technology, 2018. , p. 51
##### Series

TRITA-EECS-AVL ; 2018:51
##### National Category

Computer Sciences
##### Research subject

Computer Science
##### Identifiers

URN: urn:nbn:se:kth:diva-232471ISBN: 978-91-7729-865-6 (print)OAI: oai:DiVA.org:kth-232471DiVA, id: diva2:1234277
##### Public defence

2018-08-27, F3, Kungl Tekniska högskolan, Lindstedtsvägen 26, Stockholm, 13:00 (English)
##### Opponent

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt523",{id:"formSmash:j_idt523",widgetVar:"widget_formSmash_j_idt523",multiple:true});
##### Supervisors

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt532",{id:"formSmash:j_idt532",widgetVar:"widget_formSmash_j_idt532",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt541",{id:"formSmash:j_idt541",widgetVar:"widget_formSmash_j_idt541",multiple:true});
##### Note

##### List of papers

This thesis studies a series of questions about dynamic algorithms which are algorithms for quickly maintaining some information of an input data undergoing a sequence of updates. The first question asks \emph{how small the update time for handling each update can be} for each dynamic problem. To obtain fast algorithms, several relaxations are often used including allowing amortized update time, allowing randomization, or even assuming an oblivious adversary. Hence, the second question asks \emph{whether these relaxations and assumptions can be removed} without sacrificing the speed. Some dynamic problems are successfully solved by fast dynamic algorithms without any relaxation. The guarantee of such algorithms, however, is for a worst-case scenario. This leads to the last question which asks for \emph{an algorithm whose cost is nearly optimal for every scenario}, namely an instance-optimal algorithm. This thesis shows new progress on all three questions.

For the first question, we give two frameworks for showing the inherent limitations of fast dynamic algorithms. First, we propose a conjecture called the Online Boolean Matrix-vector Multiplication Conjecture (OMv). Assuming this conjecture, we obtain new \emph{tight} conditional lower bounds of update time for more than ten dynamic problems even when algorithms are allowed to have large polynomial preprocessing time. Second, we establish the first analogue of ``NP-completeness'' for dynamic problems, and show that many natural problems are ``NP-hard'' in the dynamic setting. This hardness result is based on the hardness of all problems in a huge class that includes a number of natural and hard dynamic problems. All previous conditional lower bounds for dynamic problems are based on hardness of specific problems/conjectures.

For the second question, we give an algorithm for maintaining a minimum spanning forest in an $n$-node graph undergoing edge insertions and deletions using $n^{o(1)}$ worst-case update time with high probability. This significantly improves the long-standing $O(\sqrt{n})$ bound by {[}Frederickson STOC'83, Eppstein, Galil, Italiano and Nissenzweig FOCS'92{]}. Previously, a spanning forest (possibly not minimum) can be maintained in polylogarithmic update time if either amortized update is allowed or an oblivious adversary is assumed. Therefore, our work shows how to eliminate these relaxations without slowing down updates too much.

For the last question, we show two main contributions on the theory of instance-optimal dynamic algorithms. First, we use the forbidden submatrix theory from combinatorics to show that a binary search tree (BST) algorithm called \emph{Greedy} has almost optimal cost when its input \emph{avoids a pattern}. This is a significant progress towards the Traversal Conjecture {[}Sleator and Tarjan JACM'85{]} and its generalization. Second, we initialize the theory of instance optimality of heaps by showing a general transformation between BSTs and heaps and then transferring the rich analogous theory of BSTs to heaps. Via the connection, we discover a new heap, called the \emph{smooth heap}, which is very simple to implement, yet inherits most guarantees from BST literature on being instance-optimal on various kinds of inputs. The common approach behind all our results is about making new connections between dynamic algorithms and other fields including fine-grained and classical complexity theory, approximation algorithms for graph partitioning, local clustering algorithms, and forbidden submatrix theory.

QC 20180725

Available from: 2018-07-25 Created: 2018-07-24 Last updated: 2018-07-25Bibliographically approved1. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture$(function(){PrimeFaces.cw("OverlayPanel","overlay808913",{id:"formSmash:j_idt607:0:j_idt613",widgetVar:"overlay808913",target:"formSmash:j_idt607:0:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

2. Nondeterminism and Completeness for Dynamic Algorithms$(function(){PrimeFaces.cw("OverlayPanel","overlay1234276",{id:"formSmash:j_idt607:1:j_idt613",widgetVar:"overlay1234276",target:"formSmash:j_idt607:1:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

3. Dynamic Minimum Spanning Forest with Subpolynomial Worst-case Update Time$(function(){PrimeFaces.cw("OverlayPanel","overlay1171866",{id:"formSmash:j_idt607:2:j_idt613",widgetVar:"overlay1171866",target:"formSmash:j_idt607:2:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

4. Smooth Heaps and a Dual View of Self-adjusting Data Structures$(function(){PrimeFaces.cw("OverlayPanel","overlay1234275",{id:"formSmash:j_idt607:3:j_idt613",widgetVar:"overlay1234275",target:"formSmash:j_idt607:3:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

5. Distributed Exact Weighted All-Pairs Shortest Paths in (O)over-tilde(n(5/4)) Rounds$(function(){PrimeFaces.cw("OverlayPanel","overlay1172111",{id:"formSmash:j_idt607:4:j_idt613",widgetVar:"overlay1172111",target:"formSmash:j_idt607:4:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

isbn
urn-nbn$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_j_idt1311",{id:"formSmash:j_idt1311",widgetVar:"widget_formSmash_j_idt1311",showEffect:"fade",hideEffect:"fade",showDelay:500,hideDelay:300,target:"formSmash:altmetricDiv"});});

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt1364",{id:"formSmash:lower:j_idt1364",widgetVar:"widget_formSmash_lower_j_idt1364",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1365_j_idt1367",{id:"formSmash:lower:j_idt1365:j_idt1367",widgetVar:"widget_formSmash_lower_j_idt1365_j_idt1367",target:"formSmash:lower:j_idt1365:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});