Titlebook: Automata, Languages and Programming; 36th International C Susanne Albers,Alberto Marchetti-Spaccamela,Wolfga Conference proceedings 2009 Sp

ANA

Towards a Study of Low-Complexity Graphsuce the element of . in models of large scale social networks. This viewpoint may also provide interesting new classes of graphs for which to design algorithms..We focus largely on the case where the “low complexity” computation is ... We show that this is already a rich class of graphs that include

镇压

Induction

Yag-Capsulotomy

Competitive Analysis of Aggregate Max in Windowed Streaming. of recent observations. Unlike previous approaches, we use the competitive analysis framework and compare the performance of the online streaming algorithm against an optimal adversary that knows the entire sequence in advance. We consider the problem of maximizing the ., i.e., the sum of the valu

傲慢物

Faster Regular Expression Matchingstance, the .. and . commands, scripting languages such as . and ., programs for analyzing massive data streams, etc. We show how to solve this ubiquitous task in linear space and .(.(loglog.)/(log.). + . + .) time where . is the length of the expression and . the length of the string. This is the f

oracle

爆炸

Unconditional Lower Bounds against Advicenown even whether . ⊆ ./... For the probabilistic classes, no lower bounds for uniform exponential time against advice were known before..We also consider the question of whether these lower bounds can be made to work on almost all input lengths rather than on infinitely many. We give an oracle rela

椭圆

环形

宫殿般