53,546 Hits in 3.0 sec

Between Linearizability and Quiescent Consistency [chapter]

Radha Jagadeesan, James Riely
2014 Lecture Notes in Computer Science  
Global constraints that are solvable because of "flow" properties Proofs and counterexamples for tree-based structures Increment/decrement N-counter (weak QC) Increment-only N-counter (QQC)  ...  are solvable because of "flow" properties Proofs and counterexamples for tree-based structures Increment/decrement N-counter (weak QC) Increment-only N-counter (QQC) General N-stack (QC) "Properly popped  ...  because of "flow" properties Proofs and counterexamples for tree-based structures  ... 
doi:10.1007/978-3-662-43951-7_19 fatcat:m52zvkqffbb5hibkzynybyfz7q

Time Transitive Functions for Zero Knowledge Proofs [article]

Ekleen Kaur, Gokul Alex
2021 arXiv   pre-print
Verifiable delay functions have found a lot of applications in blockchain technology in recent times.  ...  Continuous verifiable delay functions are an improvement over the basic notion of VDFs with recursive capabilities.  ...  For an incremental proof of sequential work (IPoS), Dottling [15] proposes provers to individually compute the defined number of steps of the computation to be further carried on by subsequent prover's  ... 
arXiv:2108.06389v1 fatcat:dc4hp5hvnbeyloziw3losi6ddu

Parallelism in Randomized Incremental Algorithms

Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun
2016 Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures - SPAA '16  
In this paper we show that many sequential randomized incremental algorithms are in fact parallel.  ...  Using the framework gives work-efficient polylogarithmic-depth parallel algorithms for most of the problems that we study.  ...  We apply our approach to show that the sequential incremental algorithm is also efficient in parallel. Algorithm 1 gives pseudocode that works either sequentially or in parallel.  ... 
doi:10.1145/2935764.2935766 dblp:conf/spaa/Blelloch0SS16 fatcat:aeviwcwkovcxhhernkee7rjpjm

On the Cryptographic Hardness of Local Search

Nir Bitansky, Idan Gerichter, Michael Wagner
2020 Innovations in Theoretical Computer Science  
The reliance on proofs of sequential work, in fact, translates to a result on the hardness of parallelizing local search.  ...  Whereas their construction is based on the sum-check protocol [39] (which explains the non-black-box reliance on #SAT hardness), ours comes from recent advancements in proofs of sequential work motivated  ...  Construction In this section, we present a modified version of the incremental proof of sequential work (iPoSW) due to [20] .  ... 
doi:10.4230/lipics.itcs.2020.6 dblp:conf/innovations/BitanskyG20 fatcat:u3zkhpiiv5cc7fwnmsrltpo4ny

Parallelism in Randomized Incremental Algorithms [article]

Guy E. Blelloch and Yan Gu and Julian Shun and Yihan Sun
2018 arXiv   pre-print
In this paper we show that many sequential randomized incremental algorithms are in fact parallel.  ...  This result is important since most implementations of parallel Delaunay triangulation use the incremental approach.  ...  The advantage of this method is that one can use standard sequential Table 1 : Work and depth bounds for our parallel randomized incremental algorithms.  ... 
arXiv:1810.05303v1 fatcat:ytaq55blivcxlloikclsqmi6ie

Construction of Retractile Proof Structures [chapter]

Roberto Maieli
2014 Lecture Notes in Computer Science  
In this work we present a paradigm of focusing proof search based on an incremental construction of retractile (i.e, correct or sequentializable) proof structures of the pure (units free) multiplicative  ...  The correctness of proof construction steps (or expansion steps) is ensured by means of a system of graph retraction rules; this graph rewriting system is shown to be convergent, that is, terminating and  ...  This work was partially supported by the PRIN Research Program Logical Methods of Information Management.  ... 
doi:10.1007/978-3-319-08918-8_22 fatcat:hgldpdtlyjdr5liag7iwwnncle

Incremental Mining of Sequential Patterns Using Weights

Archana Kollu
2013 IOSR Journal of Computer Engineering  
In this work we have approached using weight constraints, in time and space, of an idea of already existing algorithm called WSM.  ...  Real life sequential databases are usually not static. They tend to grow incrementally.  ...  This work can be further extended to develop an incremental mining algorithm for time-interval sequential patterns. We also have the concept of closed sequential patterns.  ... 
doi:10.9790/0661-1457073 fatcat:frgryxz2afdd3dlcjt5p7nxbou

Modelling and verification of parameterized architectures: A functional approach

Salah Merniz, Saad Harous
2021 IET Computers & Digital Techniques  
in any medium, provided the original work is properly cited.  ...  However, the use of higher order types makes their correctness proof very difficult.  ...  Throughout this work, the sequential microarchitecture implementation will be assumed correct. A detailed proof about sequential microarchitectures is given in our previous work [39] .  ... 
doi:10.1049/cdt2.12024 fatcat:g3ygb65a7ngm3p2ywyhmph4gr4

When to Update the sequential patterns of stream data? [article]

Qingguo Zheng, Ke Xu, Shilong Ma
2003 arXiv   pre-print
of increasingly updating algorithms and the difference of sequential patterns.  ...  The experiments for the incremental updating algorithm IUS on two data sets show that generally, as the size of incremental windows grows, the values of the speedup and the values of the difference will  ...  The rest of this paper is organized as follows. In Section 2 we compare our work with the related work of the incremental mining for stream data.  ... 
arXiv:cs/0203028v3 fatcat:yrxqy66ybbblpl2gq5zwo3qgqu

Verifiable Delay Functions [chapter]

Dan Boneh, Joseph Bonneau, Benedikt Bünz, Ben Fisch
2018 Lecture Notes in Computer Science  
A VDF requires a specified number of sequential steps to evaluate, yet produces a unique output that can be efficiently and publicly verified.  ...  VDFs have many applications in decentralized systems, including public randomness beacons, leader election in consensus protocols, and proofs of replication.  ...  This work was supported by NSF, a grant from ONR, the Simons Foundation, and a Google faculty fellowship.  ... 
doi:10.1007/978-3-319-96884-1_25 fatcat:dmqgme5jnzgpvhppmnnrapm5lm

Historical introduction to "concrete domains" by G. Kahn and G.D. Plotkin

Stephen Brookes
1993 Theoretical Computer Science  
The original version of this paper appeared as a technical report 15 years ago [28], based on the work carried out at Edinburgh University in the Fall of 1975.  ...  The purpose of this introduction is to sketch the background for this research and to mention briefly some of this later work, thus placing the paper in context.  ...  Acknowledgment I would like to thank Samson Abramsky, GCrard Berry, Pierre-Louis Curien, Gilles Kahn, Gordon Plotkin and Glynn Winskel for helping to clarify the history behind this work and for suggesting  ... 
doi:10.1016/0304-3975(93)90089-c fatcat:mmkq4foztvfqnan3uydh5ekzpe

Pervasive Parallelism in Highly-Trustable Interactive Theorem Proving Systems [chapter]

Bruno Barras, Lourdes del Carmen González Huesca, Hugo Herbelin, Yann Régis-Gianas, Enrico Tassi, Makarius Wenzel, Burkhart Wolff
2013 Lecture Notes in Computer Science  
Despite this success, the operational model of interactive proof checking was limited by sequential ML evaluation and the sequential read-eval-print loop, as inherited from LCF.  ...  Project Aims The project intends to overcome the sequential model both for Coq and Isabelle, to make the resources of multi-core hardware available for even larger proof developments.  ...  several logics; (iv) to implement a generic incremental proof-checker.  ... 
doi:10.1007/978-3-642-39320-4_29 fatcat:qk5g463ni5gthj2sya2rgbhgri

Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers

Dan Alistarh, Giorgi Nadiradze, Nikita Koval
2019 The 31st ACM on Symposium on Parallelism in Algorithms and Architectures - SPAA '19  
a maximum amount of wasted work of O(log(n) poly (k) ), where n is the number of tasks to be executed.  ...  While the sequential variant of such algorithms usually specifies a fixed (but sometimes random) order in which the tasks should be performed, a standard approach to parallelizing such algorithms is to  ...  Schardl, and Matthew Kilgore for useful discussions in the incipent stages of this work,  ... 
doi:10.1145/3323165.3323201 dblp:conf/spaa/AlistarhNK19 fatcat:cbp43t644jds7fyg434lb34vqa

Nearly Linear-Work Algorithms for Mixed Packing/Covering and Facility-Location Linear Programs [article]

Neal E. Young
2014 arXiv   pre-print
The algorithms compute (1+ϵ)-approximate solutions in time (and work) O^*(N/ϵ^2), where N is the number of non-zeros in the constraint matrix.  ...  For facility location, N is the number of eligible client/facility pairs.  ...  Proof of part (i), sequential algorithm Alg. 2, which we use to prove part (i) of Thm. 1, repeats these two operations in a particular way.  ... 
arXiv:1407.3015v3 fatcat:lepw5segbrdu7h4fuip3yau4ke

Pervasive Parallelism in Highly-Trustable Interactive Theorem Proving Systems [article]

Bruno Barras and Lourdes del Carmen González Huesca and Hugo Herbelin and Yann Régis-Gianas and Enrico Tassi and Makarius Wenzel and Burkhart Wolff
2013 arXiv   pre-print
This is an overview of the Paral-ITP project, which intents to make the proof assistants Isabelle and Coq fit for the multicore era.  ...  several logics; (iv) to implement a generic incremental proof-checker.  ...  Ongoing work investigates further sub-structural parallelism of proof elements, and improved real-time reactivity of the implementation.  ... 
arXiv:1305.7360v1 fatcat:gw6qef56hrfdtor7qa5vhqxu7e
« Previous Showing results 1 — 15 out of 53,546 results