Results 21  30
of
31
Priority Queues and Dijkstra’s Algorithm
, 2007
"... We study the impact of using different priority queues in the performance of Dijkstra’s SSSP algorithm. We consider only general priority queues that can handle any type of keys (integer, floating point, etc.); the only exception is that we use as a benchmark the DIMACS Challenge SSSP code [1] which ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study the impact of using different priority queues in the performance of Dijkstra’s SSSP algorithm. We consider only general priority queues that can handle any type of keys (integer, floating point, etc.); the only exception is that we use as a benchmark the DIMACS Challenge SSSP code [1] which can handle only integer values for distances. Our experiments were focussed on the following: 1. We study the performance of two variants of Dijkstra’s algorithm: the wellknown version that uses a priority queue that supports the DecreaseKey operation, and another that uses a basic priority queue that supports only Insert and DeleteMin. For the latter type of priority queue we include several for which highperformance code is available such as bottomup binary heap, aligned 4ary heap, and sequence heap [33]. 2. We study the performance of Dijkstra’s algorithm designed for flat memory relative to versions that try to be cacheefficient. For this, in main part, we study the difference in performance of Dijkstra’s algorithm relative to the cacheefficiency of the priority queue used, both incore and outofcore. We also study the performance of an implementation
RankPairing Heaps
"... Abstract. We introduce the rankpairing heap, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pairing heaps. Unlike all other heap implementations that match the bounds of Fibonacci heaps, our structure needs only one c ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We introduce the rankpairing heap, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pairing heaps. Unlike all other heap implementations that match the bounds of Fibonacci heaps, our structure needs only one cut and no other structural changes per key decrease; the trees representing the heap can evolve to have arbitrary structure. Our initial experiments indicate that rankpairing heaps perform almost as well as pairing heaps on typical input sequences and better on worstcase sequences. 1
Pairing Heaps are Suboptimal
, 1997
"... Pairing heaps were introduced as a selfadjusting alternative to Fibonacci heaps. They provably enjoy log n amortized costs for the standard heap operations. Although it has not been verified that pairing heaps perform the decrease key operation in constant amortized time, this has been conjectured ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Pairing heaps were introduced as a selfadjusting alternative to Fibonacci heaps. They provably enjoy log n amortized costs for the standard heap operations. Although it has not been verified that pairing heaps perform the decrease key operation in constant amortized time, this has been conjectured and extensive experimental evidence supports this conjecture. Moreover, pairing heaps have been observed to be superior to Fibonacci heaps in practice. However, as demonstrated in this paper, pairing heaps do not accommodate decrease key operations in constant amortized time. 1 Introduction Pairing heaps were introduced [1] as a selfadjusting alternative to Fibonacci heaps [2]. They are easy to code and provably enjoy log n amortized costs for the standard heap operations. Although it had not been verified that pairing heaps perform the decrease key operation in constant amortized time (the raison d'etre of Fibonacci heaps), this has been conjectured [1] and extensive experimental eviden...
Discrete Event Systems in Rewriting Logic
, 1996
"... In this note, we report on some work in progress on using rewriting logics for discrete event simulation. The idea is to combine the proofs in the logic with the observations in the simulations to gain a better understanding of the interaction intricacies that seem to occur in complex simulations. I ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this note, we report on some work in progress on using rewriting logics for discrete event simulation. The idea is to combine the proofs in the logic with the observations in the simulations to gain a better understanding of the interaction intricacies that seem to occur in complex simulations. In particular, we use communication protocols as our application domain, since they have all the interaction and unpredictability that makes formal specifications difficult. 1 Problem: Formal Methods in Simulation The historical barriers to the use of formal methods in designing and developing communication protocols derive from their different attitudes: verification models have been used for many years for proofs of behavior (a verification model cannot tell you when the model is wrong), but simulation models are used for observations of behavior (a simulation model cannot tell you when the model is right). These are almost always different models, since they must concentrate on different ...
Pairing Heaps with Costless Meld
, 903
"... Improving the structure and analysis in [1], we give a variation of the pairing heaps that has amortized zero cost per meld (compared to an O(log log n) in [1]) and the same amortized bounds for all other operations. More precisely, the new pairing heap requires: no cost per meld, O(1) per findmin ..."
Abstract
 Add to MetaCart
Improving the structure and analysis in [1], we give a variation of the pairing heaps that has amortized zero cost per meld (compared to an O(log log n) in [1]) and the same amortized bounds for all other operations. More precisely, the new pairing heap requires: no cost per meld, O(1) per findmin and insert, O(log n) per deletemin, and O(log log n) per decreasekey. These bounds are the best known for any selfadjusting heap, and match the lower bound proven by Fredman for a family of such heaps. Moreover, our structure is even simpler than that in [1]. 1
© World Scientific Publishing Company TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS Dedicated to the memory of Markku Tamminen (19451989)
, 1990
"... Different methods for compressing trees are surveyed and developed. Tree compression can be seen as a tradeoff problem between time and space in which we can choose different strategies depending on whether we prefer better compression results or more efficient operations in the compressed structur ..."
Abstract
 Add to MetaCart
Different methods for compressing trees are surveyed and developed. Tree compression can be seen as a tradeoff problem between time and space in which we can choose different strategies depending on whether we prefer better compression results or more efficient operations in the compressed structure. Of special interest is the case where space can be saved while preserving the functionality of the operations; this is called data optimization. The general compression scheme employed here consists of separate linearization of the tree structure and the data stored in the tree. Also some applications of the tree compression methods are explored. These include the syntaxdirected compression of program files, the compression of pixel trees, trie compaction and dictionaries maintained as implicit data structures.
By
, 2005
"... The growing awareness of the network vulnerability draws much attention to security from both the academic community and industrial society. Security is no longer a luxury but an independent and indispensable service to the current Internet. While various security mechanisms such as cryptographic an ..."
Abstract
 Add to MetaCart
The growing awareness of the network vulnerability draws much attention to security from both the academic community and industrial society. Security is no longer a luxury but an independent and indispensable service to the current Internet. While various security mechanisms such as cryptographic and intrusion detection techniques have been proposed, designed, and even deployed in the field, the newly exposed network vulnerabilities and the emerging network technologies create new security challenges which make the existing security solutions either inefficient or insufficient. My Ph D research focuses on the efficient protection on link state routing and the selforganizing and selfdependent hierarchical public key certificate management in the emerging mobile ad hoc networks. The contributions of this thesis include two parts. In the first part, a cost reduced secure link state routing protocol with the capability of detecting disruptive links is proposed to efficiently protect the routing control messages (e.g., LSA) and trace the faulty intermediate routers; then a confidence extended routing mechanism enhanced with secure virtual links is designed to increase network reachability through selectively including the uncertain routers in packet relaying and further continuously
Datum
"... Term rewriting serves as a simple and powerful framework in many areas of theoretical computer science like equational reasoning, deductive programming or computational logic. Unconditional term rewriting systems have been extensively studied in the past decades. Conditional term rewriting provides ..."
Abstract
 Add to MetaCart
Term rewriting serves as a simple and powerful framework in many areas of theoretical computer science like equational reasoning, deductive programming or computational logic. Unconditional term rewriting systems have been extensively studied in the past decades. Conditional term rewriting provides a more compact way to define functions and is an intuitive approach to introduce conditions to rule–based equational reasoning. Furthermore, the operational semantics of functional–logic programming languages is based on conditional narrowing. Conditional term rewriting systems are more difficult to analyze and many notions change their intuitive meaning. As a consequence, there has been a growing effort to develop transformations of conditional term rewriting systems to unconditional ones to adapt properties of unconditional systems to conditional systems. This thesis gives an overview of how such transformations work in general, presents and compares existing approaches and develops some improvements.
The Bounded Sequential Searching (Bss) Priority Queue in Discrete Event Simulation
"... Abstract: In Discrete Event Simulation the whole running time is mainly determined by the type of data structureintended to manage the pending event set. The Bounded Sequential Searching (BSS) Priority Queue is a pending event set implementation proposal for which empirical evidence of good performa ..."
Abstract
 Add to MetaCart
Abstract: In Discrete Event Simulation the whole running time is mainly determined by the type of data structureintended to manage the pending event set. The Bounded Sequential Searching (BSS) Priority Queue is a pending event set implementation proposal for which empirical evidence of good performance, under the Hold Model, is shown. The complexity of BSS associated algorithms are assessed and some implementation guidelines are given. BSS main features are commented and finally a list of open problems and current work is remarked.