Suchergebnisse - Constant-time randomised algorithms

Constant-Time Randomized Parallel String Matching: Constant-time randomized parallel string matching

Autoren: Wojciech Rytter Maxime Crochemore Leszek Gasieniec et al.

Weitere Verfasser: Wojciech Rytter Maxime Crochemore Leszek Gasieniec et al.

Quelle: SIAM Journal on Computing. 26:950-960

Schlagwörter: Combinatorics on words, Analysis of algorithms and problem complexity, randomized algorithms, Distributed algorithms, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], parallel string matching, deterministic samples

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1116362
https://doi.org/10.1137/s009753979528007x
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_1331521
http://pubman.mpdl.mpg.de/pubman/item/escidoc:1331521
https://epubs.siam.org/doi/10.1137/S009753979528007X
https://augusta.pure.elsevier.com/en/publications/constant-time-randomized-parallel-string-matching
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp26.html#CrochemoreGGPR97
https://hal.science/hal-00619561v1

Irrigating ad hoc networks in constant time

Autoren: D. Dubhashi O. Haeggstroem C. Johansson et al.

Quelle: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures. :106-115

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, ad hoc networks, distributed algorithms, overlay networks, randomized protocols, wireless net-works

Zugangs-URL: https://core.ac.uk/display/70561758
https://dblp.uni-trier.de/db/conf/spaa/spaa2005.html#DubhashiJHPS05
https://dl.acm.org/citation.cfm?doid=1073970.1073986
http://portal.acm.org/citation.cfm?doid=1073970.1073986
https://doi.org/10.1145/1073970.1073986
https://dl.acm.org/doi/10.1145/1073970.1073986
http://www.scopus.com/inward/record.url?eid=2-s2.0-32144462287&partnerID=65&md5=33385407e29ad738e2585cc70ef8c6cf
https://hdl.handle.net/11573/195221
https://doi.org/10.1145/1073970.1073986

A fast network-decomposition algorithm and its applications to constant-time distributed computation: (Extended Abstract)

Autoren: Michael Elkin Leonid Barenboim Cyril Gavoille

Quelle: Lecture Notes in Computer Science ISBN: 9783319252575

Schlagwörter: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), 0102 computer and information sciences, 16. Peace & justice, 01 natural sciences

Zugangs-URL: http://arxiv.org/pdf/1505.05697
http://arxiv.org/abs/1505.05697
https://dblp.uni-trier.de/db/journals/tcs/tcs751.html#BarenboimEG18
https://www.sciencedirect.com/science/article/abs/pii/S030439751630319X

Constant-Time Dynamic $(\Delta+1)$-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing

Autoren: Henzinger, Monika Peng, Pan

Index Begriffe: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/1907.04745

Uniform Hashing in Constant Time and Optimal Space

Autoren: Pagh, Anna Östlin Pagh, Rasmus

Quelle: SIAM Journal on Computing. 38:85-96

Schlagwörter: randomized algorithms, 0202 electrical engineering, electronic engineering, information engineering, hash function, 0102 computer and information sciences, 02 engineering and technology, uniform hashing, 01 natural sciences

Zugangs-URL: https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp38.html#PaghP08
https://doi.org/10.1137/060658400
http://www.it-c.dk/people/pagh/papers/uniform-jour.pdf
https://core.ac.uk/display/50525137
https://epubs.siam.org/doi/10.1137/060658400
http://www.itu.dk/people/pagh/papers/uniform-jour.pdf

On Universal Classes of Extremely Random Constant-Time Hash Functions: On universal classes of extremely random constant-time hash functions

Autoren: Alan Siegel

Quelle: SIAM Journal on Computing. 33:505-543

Schlagwörter: limited independence, optimal speedup, Randomized algorithms, hash functions, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, hashing, storage-time tradeoff, PRAM emulation, Information storage and retrieval of data, Graph theory (including graph drawing) in computer science, 0202 electrical engineering, electronic engineering, information engineering, Analysis of algorithms, universal hash functions, Parallel algorithms in computer science

Dateibeschreibung: application/xml

Randomized Exploration for Reinforcement Learning with Multinomial Logistic Function Approximation

Autoren: Cho, Wooseong Hwang, Taehyun Lee, Joongkyu et al.

Index Begriffe: Statistics - Machine Learning, Computer Science - Machine Learning, text

URL: http://arxiv.org/abs/2405.20165

Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time

Autoren: Mostefaoui, Achour Raynal, Michel Frey, Davide et al.

Weitere Verfasser: Mostefaoui, Achour Raynal, Michel Frey, Davide et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783319252575

Schlagwörter: Multivalued consensus, [INFO.INFO-DC]Computer Science [cs]/Distributed, Randomized binary consensus, Consensus, Byzantine process, Distributed algorithm, [INFO.INFO-CE]Computer Science [cs]/Computational Engineering, 1. No poverty, Optimal resilience, [INFO.INFO-CE] Computer Science [cs]/Computational Engineering, Finance, and Science [cs.CE], 16. Peace & justice, Parallel, Intrusion tolerance, 7. Clean energy, Asynchronous message-passing system, and Cluster Computing [cs.DC], Broadcast abstraction, 8. Economic growth, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Signature-free algorithm, and Science [cs.CE], Finance, Reduction

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.inria.fr/hal-03427171/file/Final-Acta-Informatica-17-april-2016.pdf
https://link.springer.com/article/10.1007/s00236-016-0269-y
https://dblp.uni-trier.de/db/conf/sirocco/sirocco2015.html#MostefaouiR15
https://rd.springer.com/chapter/10.1007/978-3-319-25258-2_14
https://inria.hal.science/hal-03427171v1

A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation

Autoren: Barenboim, Leonid Elkin, Michael Gavoille, Cyril

Index Begriffe: Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/1505.05697

Breaking Randomized Mixed-Radix Scalar Multiplication Algorithms

Autoren: Detrey, Jérémie Imbert, Laurent

Weitere Verfasser: Detrey, Jérémie Imbert, Laurent

Quelle: Lecture Notes in Computer Science ISBN: 9783030305291

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-02309203/file/attack-csc.pdf
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02309203v1/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02309203v1
https://doi.org/10.1007/978-3-030-30530-7_2
https://rd.springer.com/chapter/10.1007/978-3-030-30530-7_2
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02309203
https://dblp.uni-trier.de/db/conf/latincrypt/latincrypt2019.html#DetreyI19
https://link.springer.com/chapter/10.1007%2F978-3-030-30530-7_2
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02309203/document

LevAttention: Time, Space, and Streaming Efficient Algorithm for Heavy Attentions

Autoren: Kannan, Ravindran Bhattacharyya, Chiranjib Kacham, Praneeth et al.

Index Begriffe: Computer Science - Machine Learning, Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2410.05462

Almost Stable Matchings by Truncating the Gale–Shapley Algorithm.

Autoren: Floréen, Patrik Kaski, Petteri Polishchuk, Valentin et al.

Quelle: Algorithmica. Sep2010, Vol. 58 Issue 1, p102-118. 17p.

Schlagwörter: *MATCHING theory, *ALGORITHMS, *MARRIAGE theorem, *GRAPHIC methods, *APPROXIMATION algorithms

Robust and Speculative Byzantine Randomized Consensus with Constant Time Complexity in Normal Conditions

Autoren: Bruno Vavala Nuno Neves

Quelle: 2012 IEEE 31st Symposium on Reliable Distributed Systems. :161-170

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: http://www.di.fc.ul.pt/%7Enuno/PAPERS/SRDS12.pdf
http://www.di.fc.ul.pt/~nuno/PAPERS/SRDS12.pdf
https://www.computer.org/csdl/proceedings/srds/2012/2397/00/4784a161.pdf
https://ieeexplore.ieee.org/document/6424850/
https://dblp.uni-trier.de/db/conf/srds/srds2012.html#VavalaN12
http://ieeexplore.ieee.org/document/6424850/

Constant-Time Dynamic Weight Approximation for Minimum Spanning Forest

Autoren: Henzinger, Monika Peng, Pan

Index Begriffe: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2011.00977

constant time retrieval with o log m extra bits

Autoren: Dietzfelbinger, Martin Walzer, Stefan Martin Dietzfelbinger and Stefan Walzer

Weitere Verfasser: Dietzfelbinger, Martin Walzer, Stefan Martin Dietzfelbinger and Stefan Walzer

Schlagwörter: Retrieval, Hashing, Method of Four Russians, ddc:004, Randomised Data Structure, Succinct Data Structure, Structured Gaussian Elimination

Dateibeschreibung: application/pdf

Zugangs-URL: https://www.db-thueringen.de/receive/dbt_mods_00041242
https://dblp.uni-trier.de/db/conf/stacs/stacs2019.html#DietzfelbingerW19
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.24

Smooth Nash Equilibria: Algorithms and Complexity

Autoren: Daskalakis, Constantinos Golowich, Noah Haghtalab, Nika et al.

Index Begriffe: Computer Science - Computer Science and Game Theory, Computer Science - Data Structures and Algorithms, Computer Science - Machine Learning, text

URL: http://arxiv.org/abs/2309.12226

Constant Time Updates in Hierarchical Heavy Hitters

Autoren: Erez Waisbard Marcelo Caggiani Luizelli Roy Friedman et al.

Quelle: Proceedings of the Conference of the ACM Special Interest Group on Data Communication. :127-140

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 02 engineering and technology, 16. Peace & justice

Zugangs-URL: http://arxiv.org/pdf/1707.06778
http://arxiv.org/abs/1707.06778
https://arxiv.org/pdf/1707.06778.pdf
https://arxiv.org/abs/1707.06778

Constant-time dynamic weight approximation for minimum spanning forest

Autoren: Monika Henzinger Pan Peng

Quelle: Information and Computation. 281:104805

Schlagwörter: FOS: Computer and information sciences, Dynamic graph algorithms, ALGORITHMS, SPARSIFICATION, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, LOWER BOUNDS, Minimum spanning forest, 102031 Theoretische Informatik, Sublinear-time algorithms, Cell-probe lower bounds, CONNECTIVITY, 102031 Theoretical computer science, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), TREE

Zugangs-URL: http://arxiv.org/pdf/2011.00977
http://arxiv.org/abs/2011.00977
https://dblp.uni-trier.de/db/journals/corr/corr2011.html#abs-2011-00977
https://www.sciencedirect.com/science/article/pii/S0890540121001218

Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time

Autoren: Loukas Georgiadis Giuseppe F. Italiano Evangelos Kosinas

Quelle: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS). :62-85

Schlagwörter: connectivity, directed graphs, graph algorithms

Dateibeschreibung: application/pdf

Zugangs-URL: https://hdl.handle.net/11385/246046

Generating k-Independent Variables in Constant Time

Autoren: Christiani, Tobias Lybecker Pagh, Rasmus

Quelle: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science

Schlagwörter: FOS: Computer and information sciences, 0102 computer and information sciences, 02 engineering and technology, Expanders, 7. Clean energy, 01 natural sciences, Generators, 13. Climate action, Hashing, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), k-independence, Pseudorandomness, Randomness

Zugangs-URL: http://arxiv.org/pdf/1408.2157
http://arxiv.org/abs/1408.2157
http://www.itu.dk/people/pagh/papers/krng-slides.pdf
https://ieeexplore.ieee.org/abstract/document/6979004
https://dblp.uni-trier.de/db/journals/corr/corr1408.html#ChristianiP14