„Randomized Algorithms“

Suchergebnisse

1.000+ Treffer

• 08201 Abstracts Collection – Design and Analysis of Randomized and Approximation Algorithms
  Dyer, Martin ; Jerrum, Mark ; Karpinski, Marek
• Optimal Summation and Integration by Deterministic, Randomized, and Quantum Algorithms
  Heinrich, Stefan ; Novak, Erich 2017 Technische Universität Kaiserslautern, Fachbereich Informatik
• Randomized online algorithms for maximizing busy time interval scheduling
  Faigle, Ulrich ; Garbe, R. ; Kern, W.
• An Optimal Decentralized (Δ + 1)-Coloring Algorithm
  Bertschinger, Daniel ; Lengler, Johannes ; Martinsson, Anders ; Meier, Robert ; Steger, Angelika ; Trujić, Miloš ; Welzl, Emo 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Randomized algorithms for fully online multiprocessor scheduling with testing
  Gong, Mingyang ; Chen, Zhi-Zhong ; Chen, Guangting ; Lin, Guohui ; Wang, Lusheng
• An Optimal Randomized Algorithm for Finding the Saddlepoint
  Dallant, Justin ; Haagensen, Frederik ; Jacob, Riko ; Kozma, László ; Wild, Sebastian 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Local Problems in Trees Across a Wide Range of Distributed Models
  Dhar, Anubhav ; Kujawa, Eli ; Lievonen, Henrik ; Modanese, Augusto ; Muftuoglu, Mikail ; Studený, Jan ; Suomela, Jukka 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fast equality test for straight-line compressed strings
  Schmidt-Schauß, Manfred ; Schnitger, Georg 2011 Univ.-Bibliothek Frankfurt am Main
• Prediction of hot-rolled strip crown based on Boruta and extremely randomized trees algorithms
  Wang, Li ; He, Song-lin ; Zhao, Zhi-ting ; Zhang, Xian-du
• Randomized Algorithms for Analysis and Control of Uncertain Systems
  2005 Springer London
• Variety Membership Testing in Algebraic Complexity Theory
  Pandey, Anurag 2021 Saarländische Universitäts- und Landesbibliothek
• Randomized Algorithms for High-Dimensional Integration and Approximation
  Marcin, Wnuk ; Michael, Gnewuch ; Arnand, Srivastav 2019 Universitätsbibliothek Kiel
• On the Analysis of Two Fundamental Randomized Algorithms - Multi-Pivot Quicksort and Efficient Hash Functions
  Aumüller, Martin ; Dietzfelbinger, Martin ; Wölfel, Philipp ; Pagh, Rasmus 2015 Universitätsbibliothek Ilmenau
• Randomized Approximation and Online Algorithms for Assignment Problems
  Bender, Marco 2015 Verlag Dr. Hut
• Randomized Approximation and Online Algorithms for Assignment Problems
  Bender, Marco ; Westphal, Stephan ; Vredeveld, Tjark ; Schöbel, Anita 2015 Niedersächsische Staats- und Universitätsbibliothek Göttingen
• Randomized Approximation for the Matching and Vertex Cover Problem in Hypergraphs: Complexity and Algorithms
  Ouali, Mourad ˜elœ 2013 Universitätsbibliothek Kiel
• Probabilistic matching of solid shapes in arbitrary dimension
  Schymura, Daria 2011 Freie Universität Berlin
• Complexity Theory
  Sina, Lucien 2025 epubli
• Improved Upper Bounds on Multiflow-Multicut Gaps in Cactus Graphs
  Kalantarzadeh, Sina ; Kumar, Nikhil 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Distributed Computing – 28th International Symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014. Proceedings
  Kuhn, Fabian 2014 Springer Berlin Heidelberg