Search Results - "randomised algorithm"

Refine Results
  1. 1
  2. 2

    Source: Saarbrücken/Wadern, Germany : Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 306, 82:1-82:19 (2024). doi:10.4230/LIPIcs.MFCS.2024.82
    49th International Symposium on Mathematical Foundations of Computer Science : (MFCS 2024), August 26-30, 2024, Bratislava, Slovakia / Edited by Rastislav Královič, Antonín Kučera
    49th International Symposium on Mathematical Foundations of Computer Science : (MFCS 2024), August 26-30, 2024, Bratislava, Slovakia / Edited by Rastislav Královič, Antonín Kučera49. International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, Bratislava, Slovakia, 2024-08-26-2024-08-30
    49th International Symposium on Mathematical Foundations of Computer Science

    File Description: application/pdf

  3. 3

    Source: Leibniz International Proceedings in Informatics (LIPIcs), 297 ; 51st International Colloquium on Automata, Languages, and Programming

    File Description: application/application/pdf

    Relation: info:eu-repo/semantics/altIdentifier/arxiv/2306.14867; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-322-5; http://hdl.handle.net/20.500.11850/683858

  4. 4
  5. 5
  6. 6
  7. 7

    Source: Galanis, A, Göbel, A, Goldberg, L A, Lapinskas, J A & Richerby, D 2017, 'Amplifiers for the Moran process', Journal of the ACM, vol. 64, no. 1, pp. 1. https://doi.org/10.1145/3019609

    File Description: application/pdf; text

  8. 8

    Source: Algorithmica. 80:560-575

    File Description: text

  9. 9
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20

    Source: https://tel.archives-ouvertes.fr/tel-01127345 ; Autre [cs.OH]. Université de Bordeaux, 2014. Français. ⟨NNT : 2014BORD0091⟩.