Search Results - Constant-time randomised algorithms

Refine Results
  1. 1

    Almost Stable Matchings by Truncating the Gale–Shapley Algorithm by Floréen, Patrik, Kaski, Petteri, Polishchuk, Valentin, Suomela, Jukka

    ISSN: 0178-4617, 1432-0541
    Published: New York Springer-Verlag 01.09.2010
    Published in Algorithmica (01.09.2010)
    “… We apply our results to give a distributed (2+ ε )-approximation algorithm for maximum-weight matching in bicoloured graphs and a centralised randomised constant-time approximation scheme for estimating the size of a stable matching…”
    Get full text
    Journal Article
  2. 2

    Dynamic normal forms and dynamic characteristic polynomial by Frandsen, Gudmund Skovbjerg, Sankowski, Piotr

    ISSN: 0304-3975, 1879-2294
    Published: Elsevier B.V 01.04.2011
    Published in Theoretical computer science (01.04.2011)
    “… In the generic symmetric case, our algorithm supports rank-one updates in O(n2logn) randomized time and queries in constant time, whereas in the general case the algorithm works in O(n2klogn…”
    Get full text
    Journal Article
  3. 3

    Constant Time Updates in Hierarchical Heavy Hitters by Ran Ben Basat, Einziger, Gil, Friedman, Roy, Luizelli, Marcelo Caggiani, Waisbard, Erez

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 21.07.2017
    Published in arXiv.org (21.07.2017)
    “… In this paper, we propose a randomized constant time algorithm for HHH. We prove probabilistic precision bounds backed by an empirical evaluation…”
    Get full text
    Paper
  4. 4

    No sublogarithmic-time approximation scheme for bipartite vertex cover by Göös, Mika, Suomela, Jukka

    ISSN: 0178-2770, 1432-0452
    Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2014
    Published in Distributed computing (01.12.2014)
    “…—that no sublogarithmic-time approximation scheme exists for the dual problem: there is a constant δ > 0 so that no randomised distributed algorithm with running time o ( log n ) can find a ( 1 + δ…”
    Get full text
    Journal Article
  5. 5

    A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation by Barenboim, Leonid, Elkin, Michael, Gavoille, Cyril

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 25.03.2017
    Published in arXiv.org (25.03.2017)
    “… (2012) devised a distributed randomized constant-time algorithm for computing strong network decompositions with \(d = O(1…”
    Get full text
    Paper
  6. 6

    A constant-time sampling algorithm for binary Gaussian distribution over the integers by Du, Yusong, Fan, Baoying, Wei, Baodian

    ISSN: 0020-0190, 1872-6119
    Published: Elsevier B.V 01.06.2022
    Published in Information processing letters (01.06.2022)
    “…•Sampling binary Gaussian can be done in constant-time without precomputation storage…”
    Get full text
    Journal Article
  7. 7

    Construct a perfect word hash function in time independent of the size of integers by Han, Yijie

    ISSN: 0020-0190, 1872-6119
    Published: Elsevier B.V 01.12.2017
    Published in Information processing letters (01.12.2017)
    “…) time algorithm is known for constructing a perfect hash function, the hash function constructed is not a word hash function and it cannot hash multiple integers packed in one word in constant time…”
    Get full text
    Journal Article
  8. 8

    Uniform Hashing in Constant Time and Optimal Space by Pagh, Anna, Pagh, Rasmus

    ISSN: 0097-5397, 1095-7111
    Published: Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2008
    Published in SIAM journal on computing (01.01.2008)
    “… set of $n$ inputs, behaves like a truly random function with high probability, can be evaluated in constant time on a RAM and can be stored in $(1+\epsilon)n\log |V| + O(n+\log\log |U|)$ bits. Here $\epsilon…”
    Get full text
    Journal Article
  9. 9

    Constant time approximation scheme for largest well predicted subset by Fu, Bin, Wang, Lusheng

    ISSN: 1382-6905, 1573-2886
    Published: Boston Springer US 01.04.2013
    Published in Journal of combinatorial optimization (01.04.2013)
    “…The largest well predicted subset problem is formulated for comparison of two predicted 3D protein structures from the same sequence. A 3D protein structure is…”
    Get full text
    Journal Article
  10. 10

    Monitoring Schedules for Randomly Deployed Sensor Networks Without Geographic Information by Calinescu, G.

    ISBN: 1467350648, 9781467350648
    ISSN: 1087-4089
    Published: IEEE 01.12.2012
    “… We present distributed algorithms for Monitoring Schedule under the following assumptions: 1) identical sensors can each monitor all targets within a certain radius, 2…”
    Get full text
    Conference Proceeding
  11. 11

    Robust and Speculative Byzantine Randomized Consensus with Constant Time Complexity in Normal Conditions by Vavala, B., Neves, N.

    ISBN: 9781467323970, 1467323977
    ISSN: 1060-9857
    Published: IEEE 01.10.2012
    “…Randomized Byzantine Consensus can be an interesting building block in the implementation of asynchronous distributed systems…”
    Get full text
    Conference Proceeding
  12. 12

    Distributed throughput-optimal scheduling framework with delay analysis in multi-hop wireless networks by Tran, Nguyen H., Hong, Choong Seon, Lee, Sungwon

    ISSN: 0895-7177, 1872-9479
    Published: Elsevier Ltd 01.06.2011
    Published in Mathematical and computer modelling (01.06.2011)
    “…In wireless networks, due to the shared medium, we require sophisticated algorithms to schedule concurrent transmissions that meet the interference constraint where two nodes cannot transmit…”
    Get full text
    Journal Article
  13. 13

    Smooth Nash Equilibria: Algorithms and Complexity by Daskalakis, Constantinos, Golowich, Noah, Haghtalab, Nika, Shetty, Abhishek

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 20.07.2024
    Published in arXiv.org (20.07.2024)
    “…A fundamental shortcoming of the concept of Nash equilibrium is its computational intractability: approximating Nash equilibria in normal-form games is…”
    Get full text
    Paper
  14. 14

    On the Practical Detection of Hierarchical Heavy Hitters by Moraney, Jalil, Raz, Danny

    Published: IFIP 01.06.2020
    “… A randomized constant-time algorithm was proposed recently; however, it is only applicable to extremely…”
    Get full text
    Conference Proceeding
  15. 15

    Almost stable matchings in constant time by Floréen, Patrik, Kaski, Petteri, Polishchuk, Valentin, Suomela, Jukka

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 29.12.2008
    Published in arXiv.org (29.12.2008)
    “…We show that the ratio of matched individuals to blocking pairs grows linearly with the number of propose--accept rounds executed by the Gale--Shapley algorithm for the stable marriage problem…”
    Get full text
    Paper
  16. 16

    RANDOMIZATION OF CSIDH ALGORITHM ON QUADRATIC AND TWISTED EDWARDS CURVES by Bessalov, Anatoliy, Kovalchuk, Ludmila, Abramov, Sergey

    ISSN: 2663-4023, 2663-4023
    Published: 2022
    “… A modification of the CSIDH algorithm based on odd degree isogenies of these curves is considered…”
    Get full text
    Journal Article
  17. 17

    Constant-Time Dynamic Weight Approximation for Minimum Spanning Forest by Henzinger, Monika, Pan, Peng

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 28.09.2021
    Published in arXiv.org (28.09.2021)
    “…\). We further show that any deterministic data structure that dynamically maintains the \((1+\varepsilon)\)-approximate weight of an MSF requires super constant time per operation…”
    Get full text
    Paper
  18. 18

    Comparison of two devices for automated oxygen control in preterm infants: a randomised crossover trial by Salverda, Hylke H, Cramer, Sophie J E, Witlox, Ruben S G M, Gale, Timothy J, Dargaville, Peter A, Pauws, Steffen C, te Pas, Arjan B

    ISSN: 1359-2998, 1468-2052, 1468-2052
    Published: England BMJ Publishing Group Ltd and Royal College of Paediatrics and Child Health 01.01.2022
    “…ObjectiveTo compare the effect of two different automated oxygen control devices on target range (TR) time and occurrence of hypoxaemic and hyperoxaemic…”
    Get full text
    Journal Article
  19. 19

    Constant-Time Randomized Parallel String Matching by Crochemore, Maxime, Galil, Zvi, Gasieniec, Leszek, Park, Kunsoo, Rytter, Wojciech

    ISSN: 0097-5397, 1095-7111
    Published: Philadelphia, PA Society for Industrial and Applied Mathematics 01.08.1997
    Published in SIAM journal on computing (01.08.1997)
    “…Given a pattern string of length m for the string-matching problem, we design an algorithm that computes deterministic samples of a sufficiently long substring of the pattern in constant time…”
    Get full text
    Journal Article
  20. 20

    On Universal Classes of Extremely Random Constant-Time Hash Functions by Siegel, Alan

    ISSN: 0097-5397, 1095-7111
    Published: Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2004
    Published in SIAM journal on computing (01.01.2004)
    “… of $\h$-wise independent functions that can be evaluated in constant time for the standard random access model of computation…”
    Get full text
    Journal Article