Results 1  10
of
10
Lower Bounds for Fully Dynamic Connectivity Problems in Graphs
, 1998
"... We prove lower bounds on the complexity of maintaining fully dynamic kedge or kvertex connectivity in plane graphs and in (k − 1)vertex connected graphs. We show an amortized lower bound of �(log n/k(log log n + log b)) per edge insertion, deletion, or query operation in the cell probe model, whe ..."
Abstract

Cited by 32 (5 self)
 Add to MetaCart
We prove lower bounds on the complexity of maintaining fully dynamic kedge or kvertex connectivity in plane graphs and in (k − 1)vertex connected graphs. We show an amortized lower bound of �(log n/k(log log n + log b)) per edge insertion, deletion, or query operation in the cell probe model, where b is the word size of the machine and n is the number of vertices in G. We also show an amortized lower bound of �(log n/(log log n + log b)) per operation for fully dynamic planarity testing in embedded graphs. These are the first lower bounds for fully dynamic connectivity problems.
Banshee: A scalable constraintbased analysis toolkit
 In SAS ’05: Proceedings of the 12th International Static Analysis Symposium. London, United Kingdom
, 2005
"... Abstract. We introduce Banshee, a toolkit for constructing constraintbased analyses. Banshee’s novel features include a code generator for creating customized constraint resolution engines, incremental analysis based on backtracking, and fast persistence. These features make Banshee useful as a foun ..."
Abstract

Cited by 31 (1 self)
 Add to MetaCart
Abstract. We introduce Banshee, a toolkit for constructing constraintbased analyses. Banshee’s novel features include a code generator for creating customized constraint resolution engines, incremental analysis based on backtracking, and fast persistence. These features make Banshee useful as a foundation for production program analyses. 1
An Efficient Representation for Sparse Sets
 ACM Letters on Programming Languages and Systems
, 1993
"... this paper, we have described a representation suitable for sets with a fixedsize universe. The representation supports constanttime implementations of clearset, member, addmember, deletemember, cardinality, and chooseone. Based on the efficiency of these operations, the new representation wi ..."
Abstract

Cited by 30 (4 self)
 Add to MetaCart
this paper, we have described a representation suitable for sets with a fixedsize universe. The representation supports constanttime implementations of clearset, member, addmember, deletemember, cardinality, and chooseone. Based on the efficiency of these operations, the new representation will often be superior to alternatives such as bit vectors, balanced binary trees, hash tables, linked lists, etc. Additionally, the new representation supports enumeration of the members in O(n) time, making it a competitive choice for relatively sparse sets requiring operations like forall, setcopy, setunion, and setdifference.
The CLP(OIH) Language
, 1998
"... Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Dissertation Series publications. Copies may be obtained by contacting: BRICS ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Dissertation Series publications. Copies may be obtained by contacting: BRICS
Using Conditional Branches to Improve Constant Propagation
, 1995
"... This paper describes an efficient algorithm for discovering assertions of equality implied by conditional branches and discusses how to use these assertions to improve the results of Wegman and Zadeck's sparse constant propagation algorithms [12]. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper describes an efficient algorithm for discovering assertions of equality implied by conditional branches and discusses how to use these assertions to improve the results of Wegman and Zadeck's sparse constant propagation algorithms [12].
Efficient Simplification of Bisimulation Formulas
 In Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems, pages 111132. LNCS 1019
, 1995
"... The problem of checking or optimally simplifying bisimulation formulas is likely to be computationally very hard. We take a different view at the problem: we set out to define a very fast algorithm, and then see what we can obtain. Sometimes our algorithm can simplify a formula perfectly, sometimes ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The problem of checking or optimally simplifying bisimulation formulas is likely to be computationally very hard. We take a different view at the problem: we set out to define a very fast algorithm, and then see what we can obtain. Sometimes our algorithm can simplify a formula perfectly, sometimes it cannot. However, the algorithm is extremely fast and can, therefore, be added to formulabased bisimulation model checkers at practically no cost. When the formula can be simplified by our algorithm, this can have a dramatic positive effect on the better, but also more time consuming, theorem provers which will finish the job. 1 Introduction The need for validity checking or optimal simplification of first order bisimulation formulas has arisen from recent work on symbolic bisimulation checking of valuepassing calculi [4, 9, 15]. The NPcompleteness of checking satisfiability of propositional formulas [3] implies that validity checking of that class of formulas is coNP complete. Addit...
Backtracking
"... Contents 1 Introduction 3 2 Models of computation 6 3 The Set Union Problem 9 4 The WorstCase Time Complexity of a Single Operation 15 5 The Set Union Problem with Deunions 18 6 Split and the Set Union Problem on Intervals 22 7 The Set Union Problem with Unlimited Backtracking 26 1 Introduction A ..."
Abstract
 Add to MetaCart
Contents 1 Introduction 3 2 Models of computation 6 3 The Set Union Problem 9 4 The WorstCase Time Complexity of a Single Operation 15 5 The Set Union Problem with Deunions 18 6 Split and the Set Union Problem on Intervals 22 7 The Set Union Problem with Unlimited Backtracking 26 1 Introduction An equivalence relation on a finite set S is a binary relation that is reflexive symmetric and transitive. That is, for s; t and u in S, we have that sRs, if sRt then tRs, and if sRt and tRu then sRu. Set S is partitioned by R into equivalence classes where each class cointains all and only the elements that obey R pairwise. Many computational problems involve representing, modifying and tracking the evolution of equivalenc
Retroactive data structures (extended abstract)
 IN SODA ’04: PROCEEDINGS OF THE FIFTEENTH ANNUAL ACMSIAM SYMPOSIUM ON DISCRETE ALGORITHMS
, 2004
"... We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called retroactive data structures, the historical sequence of operations performed on the data structure is not fixed. The data s ..."
Abstract
 Add to MetaCart
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called retroactive data structures, the historical sequence of operations performed on the data structure is not fixed. The data structure allows arbitrary insertion and deletion of operations at arbitrary times, subject only to consistency requirements. We initiate the study of retroactive data structures by formally defining the model and its variants. We prove that, unlike persistence, efficient retroactivity is not always achievable, so we go on to present several specific retroactive data structures.
Banshee: A Practical ConstraintBased Analysis
"... Abstract. We introduce Banshee, a toolkit for constructing constraintbased program analyses. Banshee’s novel features include a code generator for creating customized constraint resolution engines, an incremental analysis facility based on backtracking, and fast persistence based on serializing regi ..."
Abstract
 Add to MetaCart
Abstract. We introduce Banshee, a toolkit for constructing constraintbased program analyses. Banshee’s novel features include a code generator for creating customized constraint resolution engines, an incremental analysis facility based on backtracking, and fast persistence based on serializing regions of memory. These features make Banshee useful not only for rapid prototyping, but also as a foundation for program analyses used in production software tools. 1