Results 1 - 10 of 293

Amortized Complexity of Data Structures

by Rajamani Sundar , 1991
"... This thesis investigates the amortized complexity of some fundamental data structure problems and introduces interesting ideas for proving lower bounds on amortized complexity and for performing amortized analysis. The problems are as follows: ffl Dictionary Problem: A dictionary is a dynamic set t ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
This thesis investigates the amortized complexity of some fundamental data structure problems and introduces interesting ideas for proving lower bounds on amortized complexity and for performing amortized analysis. The problems are as follows: ffl Dictionary Problem: A dictionary is a dynamic set

On the amortized complexity of zero-knowledge protocols

by Ronald Cramer, Valerio Pastro - of Lecture Notes in Computer Science , 2009
"... Abstract. We present a protocol that allows to prove in zero-knowledge that committed values xi, yi, zi, i = 1,..., l satisfy xiyi = zi, where the values are taken from a finite field K, or are integers. The amortized communication complexity per instance proven is O(κ + l) for an error probability ..."
Abstract - Cited by 19 (2 self) - Add to MetaCart
Abstract. We present a protocol that allows to prove in zero-knowledge that committed values xi, yi, zi, i = 1,..., l satisfy xiyi = zi, where the values are taken from a finite field K, or are integers. The amortized communication complexity per instance proven is O(κ + l) for an error probability

Data Structures and Amortized Complexity in a Functional Setting

by Berry Schoenmakers , 1992
"... ..."
Abstract - Cited by 13 (3 self) - Add to MetaCart
Abstract not found

Amortized Efficiency of List Update and Paging Rules

by Daniel D. Sleator, Robert E. Tarjan , 1985
"... In this article we study the amortized efficiency of the “move-to-front” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that move-to-front is within a constant factor of optimum amo ..."
Abstract - Cited by 824 (8 self) - Add to MetaCart
paging, a setting in which the access cost is not convex. The paging rule corresponding to move-to-front is the “least recently used” (LRU) replacement rule. We analyze the amortized complexity of LRU, showing that its efficiency differs from that of the offline paging rule (Belady’s MIN algorithm) by a

Non-Blocking Doubly-Linked Lists with Good Amortized Complexity

by Niloufar Shafiei
"... We present a new non-blocking doubly-linked list implementation for an asynchronous shared-memory system. It is the first such implementation for which an upper bound on amortized time complexity has been proved. In our implementation, operations access the list via cursors. Each cursor is associate ..."
Abstract - Add to MetaCart
We present a new non-blocking doubly-linked list implementation for an asynchronous shared-memory system. It is the first such implementation for which an upper bound on amortized time complexity has been proved. In our implementation, operations access the list via cursors. Each cursor

0 AN AMORTIZED-COMPLEXITY METHOD TO COMPUTE THE RIEMANN ZETA FUNCTION

by Ghaith A. Hiary
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

4 A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis

by Moritz Sinn, Florian Zuleger, Helmut Veith, Tu Vienna
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

View-Dependent Refinement of Progressive Meshes

by Hugues Hoppe
"... Level-of-detail (LOD) representations are an important tool for realtime rendering of complex geometric environments. The previously introduced progressive mesh representation defines for an arbitrary triangle mesh a sequence of approximating meshes optimized for view-independent LOD. In this paper, ..."
Abstract - Cited by 459 (5 self) - Add to MetaCart
Level-of-detail (LOD) representations are an important tool for realtime rendering of complex geometric environments. The previously introduced progressive mesh representation defines for an arbitrary triangle mesh a sequence of approximating meshes optimized for view-independent LOD. In this paper

Information Equals Amortized Communication

by Mark Braverman, Anup Rao , 2010
"... We show how to efficiently simulate the sending of a message M to a receiver who has partial information about the message, sothat the expected number of bits communicated in the simulationis closeto the amount ofadditionalinformationthatthemessagerevealstothereceiver. Thisisageneralizationandstreng ..."
Abstract - Cited by 38 (6 self) - Add to MetaCart
complexity of a function, and its information complexity. We prove that for any given distribution on inputs, the internal information cost (namely the information revealed to the parties) involved in computing any relation or function using a two party interactive protocol is exactly equal to the amortized

Quantum information complexity and amortized communication

by Dave Touchette , 2014
"... We define a new notion of information cost for quantum protocols, and a corre-sponding notion of quantum information complexity for bipartite quantum channels, and then investigate the properties of such quantities. These are the fully quantum generalizations of the analogous quantities for bipartit ..."
Abstract - Cited by 7 (2 self) - Add to MetaCart
: we show that it is exactly equal to the amortized quantum communication complexity of a bipartite channel on a given state. This generalizes a result of Braverman and Rao to quantum protocols, and even strengthens the classical result in a bounded round scenario. Also, this provides an analogue
Results 1 - 10 of 293