Thore Husfeldt  Home/Search
Context
Related
| brics.dk/DS/Ref/BR...RICSDS973.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brics.dk/DS/Ref/BR...BRICSDSRef (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This thesis is in Theory of Computation. We study quantitative aspects of computational problems that arise in settings where the input instance is subject to changes, i.e., dynamic problems. The results include efficient dynamic algorithms and data structures and strong information-theoretic lower bounds for problems on graphs, strings, and finite functions. (Update)
Similar documents (at the sentence level):
10.6%: Fully Dynamic Transitive Closure in Plane Dags with one Source.. - Husfeldt (1994) (Correct)
6.9%: Dynamic Algorithms for the Dyck Languages - Frandsen, Husfeldt, Miltersen.. (1995) (Correct)
Active bibliography (related documents): More All
2.0: Hardness Results for Dynamic Problems by Extensions of Fredman and .. - Rauhe (1998) (Correct)
1.3: Fully Dynamic Transitive Closure in Plane Dags with One Source.. - Husfeldt (1994) (Correct)
1.1: Computational Complexity of Dynamic Problems - Husfeldt (Correct)
Similar documents based on text: More All
1.2: Topics in Semantics-based Program Manipulation - Grobauer (2001) (Correct)
1.2: Worst Case Efficient Data Structures - Brodal (1997) (Correct)
1.0: Efficient External-Memory Data Structures and Applications - Arge (1996) (Correct)
BibTeX entry: (Update)
@misc{ husfeldt-dynamic,
author = "Thore Husfeldt",
title = "Dynamic Computation",
url = "citeseer.ist.psu.edu/husfeldt97dynamic.html" }
Citations (may not include all citations):191 Introduction to Formal Language Theory (context) - Harrison
183 A data structure for dynamic trees (context) - Sleator, Tarjan - 1983
141 The complexity of finite functions (context) - Boppana, Sipser - 1990
127 Maintenance of configurations in the plane (context) - Overmars, van Leeuwen - 1981
124 A dichromatic framework for balanced trees (context) - Guibas, Sedgewick
118 Data structures for on-line updating of minimum spanning tre.. (context) - Frederickson - 1985
103 A Programming Language (context) - Iverson - 1962
103 Almost optimal lower bounds for small depth circuits - Hastad - 1986
101 Sparsification---a technique for speeding up dynamic graph a.. (context) - Eppstein, Galil et al. - 1992
82 Monotone circuits for connectivity require super-logarithmic.. (context) - Karchmer, Wigderson - 1990
75 and the polynomial time hierarchy (context) - Furst, Saxe et al. - 1984
74 The cell probe complexity of dynamic data structures (context) - Fredman, Saks - 1989
70 A suggestion for a fast multiplier (context) - Wallace - 1964
63 Dynamic algorithms in Computational Geometry - Chiang, Tamassia - 1991
58 and Oren Patashnik (context) - Graham, Knuth
54 On RAM priority queues - Thorup
46 Decomposable searching problems (context) - Bentley - 1979
41 Log-logarithmic worst-case range queries are possible in spa.. (context) - Willard - 1983
34 Fully dynamic point location in a monotone subdivision (context) - Preparata, Tamassia - 1989
34 Personal communication (context) - Beame, Fich - 1994
31 A theorem on probabilistic constant depth computations (context) - Ajtai, Ben-Or - 1984
29 Dynamic point location in general subdivisions (context) - Baumgarten, Jung et al. - 1992
28 volume 156 of Lecture Notes in Computer Science (context) - Overmars, of et al. - 1983
24 Computer Modern Typefaces (context) - Knuth - 1986
23 Optimal algorithms for list indexing and subset rank (context) - Dietz - 1989
21 New bounds in cell probe model (context) - Xiao - 1992
20 polynomial-size circuits for symmetric functions (context) - Fagin, Klawe et al. - 1985
20 the algorithmic complexity of discrete functions (context) - Ofman
18 Definability by constant-depth polynomial-size circuits (context) - Denenberg, Gurevich et al. - 1986
17 Dynamic maintenance of planar digraphs (context) - Tamassia, Preparata - 1990
17 Word problems solvable in logspace (context) - Lipton, Zalcstein - 1977
14 volume A of Computers & Typesetting (context) - Knuth, Xbook
14 On data structures and asymmetric communication complexity (context) - Miltersen, Nisan et al. - 1995
13 Computer Science Department (context) - Miltersen, of et al. - 1992
13 Efficient algorithms for graphic matroid intersection and pa.. (context) - Gabow, Stallman - 1985
13 Lower bounds for union--split--find related problems on rand.. (context) - Miltersen - 1994
11 Should tables be sorted (context) - Yao
11 Minsky and Seymour (context) - Marvin - 1969
10 Complexity models for incremental computation (context) - Miltersen, Subramanian et al. - 1994
10 the dimension of partially ordered sets (context) - Kelly - 1981
9 Maintaining dynamic sequences under equality-tests in polylo.. (context) - Mehlhorn, Sundar et al. - 1994
8 Observations on the complexity of generating quasiGray codes (context) - Fredman - 1978
8 Algorithms for plane representations of acyclic digraphs (context) - Di Battista, Tamassia - 1988
8 Lower bounds for dynamic transitive closure (context) - Husfeldt, Rauhe et al. - 1996
8 Dynamic algorithms for the Dyck languages - Frandsen, Husfeldt et al. - 1995
8 A fully dynamic data structure for reachability in planar di.. (context) - Subramanian
7 Dynamic graph algorithms - Eppstein, Galil et al. - 1997
7 The complexity of symmetric functions in bounded-depth circu.. (context) - Brustmann, Wegener - 1987
6 Language recognition by marking automata (context) - Ritchie, Springsteel - 1972
6 line planar graph embedding (context) - Tamassia - 1996
5 Dynamic word problems - Frandsen, Miltersen et al. - 1993
5 Dynamic reachability in planar digraphs with one source and .. (context) - Tamassia, Tollis - 1993
5 Dynamic data structures for series parallel digraphs (context) - Italiano, Spaccamela et al.
4 Maintenance of a minimum spanning forest in a dyamic planar .. (context) - Eppstein, Italiano et al. - 1992
4 Randomized dynamic graph algorithms with polylogarithmic tim.. - Henzinger, King - 1995
4 Fully dynamic transitive closure in plane dags with one sour.. - Husfeldt - 1995
4 Generalized lower bounds derived from Hastad's main lemma (context) - Moran - 1987
3 A lower bound for finding predecessors in Yao's cell probe m.. (context) - Ajtai - 1988
3 Sigma 1 -formulae on finite structures (context) - Ajtai - 1983
3 Fully dynamic biconnectivity and transitive closure (context) - Henzinger, King - 1995
3 Efficient randomised patternmatching algorithms (context) - Karp, Rabin - 1987
3 Predecessor queries in dynamic integer sets (context) - Brodal - 1997
3 The complexity of problems on probabilistic (context) - Manber, Tompa - 1985
2 volume 13 of Pure and Applied Mathematics (context) - Magnus, Karrass et al. - 1966
2 Gruppentheoretische studien (context) - von Dyck
2 dynamic comlexity class (context) - Patnaik, Immerman et al. - 1994
1 An empirical study of dynamic graph algorithms (context) - Albers, Cattaneo et al.
1 About the derivation languages of grammars and machines (context) - Monien - 1977
1 Sorting and searching revisited (context) - Anderson
1 Cell probe lower bounds for re-evaluating symmetric function.. (context) - Husfeldt, Rauhe - 1996
1 A communication complexity proof that symmetric functions ha.. (context) - Brodal, Husfeldt - 1996
1 Dyck-sprogene -- dynamiske algoritmer og deres kompleksitet (context) - Rauhe, Skyum - 1995
Documents on the same site (http://www.brics.dk/DS/Ref/BRICS-DS-Ref/BRICS-DS-Ref.html): More
Logics and Automata for Verification: Expressiveness and.. - Henriksen (2000) (Correct)
Games for Verification: Algorithmic Issues - Jurdzinski (2000) (Correct)
Categorical Models for Concurrency: Independence, Fairness and.. - Hildebrandt (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC