„Algorithm Analysis and Problem Complexity.“

Suchergebnisse

1.000+ Treffer

• 08201 Abstracts Collection – Design and Analysis of Randomized and Approximation Algorithms
  Dyer, Martin ; Jerrum, Mark ; Karpinski, Marek
• 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06)
  Jacob, Riko ; Müller-Hannemann, Matthias 2006 Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
• Nonsequential and Distributed Programming with Go – Synchronization of Concurrent Processes
  Maurer, Christian 2025 Springer
• Gaming Prediction Markets: Equilibrium Strategies with a Market Maker
  Chen, Yiling ; Dimitrov, Stanko ; Sami, Rahul ; Reeves, Daniel M. ; Pennock, David M. ; Hanson, Robin ; Fortnow, Lance ; Gonen, Rica
• Online Multistage Subset Maximization Problems
  Bampis, Evripidis ; Escoffier, Bruno ; Schewior, Kevin ; Teiller, Alexandre
• Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints
  Kacem, Imed ; Kellerer, Hans
• Transactions on Large-Scale Data- and Knowledge-Centered Systems XXIV – Special Issue on Database- and Expert-Systems Applications
  Hameurlain, Abdelkader ; Küng, Josef ; Wagner, Roland ; Decker, Hendrik ; Lhotská, Lenka ; Link, Sebastian 2016 Springer Berlin Heidelberg
• Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games
  Caragiannis, Ioannis ; Fanelli, Angelo ; Gravin, Nikolai
• OpenMP: Heterogenous Execution and Data Movements – 11th International Workshop on OpenMP, IWOMP 2015, Aachen, Germany, October 1–2, 2015, Proceedings
  Terboven, Christian ; De Supinski, Bronis R. ; Reble, Pablo ; Chapman, Barbara ; Müller, Matthias S. 2015 Springer International Publishing
• Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs
  Egidi, Lavinia ; Louza, Felipe A. ; Manzini, Giovanni
• A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs
  Madathil, Jayakrishnan ; Sharma, Roohani ; Zehavi, Meirav
• Integrating Web-Based Collaborative Live Editing and Wireframing into a Model-Driven Web Engineering Process
  Lange, Peter de ; Nicolaescu, Petru ; Neumann, Alexander Tobias ; Klamma, Ralf
• Approximability of Clique Transversal in Perfect Graphs
  Fiorini, Samuel ; Krithika, R. ; Narayanaswamy, N. S. ; Raman, Venkatesh
• Can Finite Samples Detect Singularities of Real-Valued Functions?
  Ben-David, S.
• The Consecutive Ones Submatrix Problem for Sparse Matrices
  Tan, Jinsong ; Zhang, Louxin
• Multiplicative Up-Drift
  Doerr, Benjamin ; Kötzing, Timo
• Finding and Counting Permutations via CSPs
  Berendsohn, Benjamin Aram ; Kozma, László ; Marx, Dániel
• Correction to: Smooth and Strong PCPs
  Paradise, Orr
• Algorithmic aspects of manipulation and anonymization in social choice and social networks
  Talmon, Nimrod ; Niedermeier, Rolf ; Rosenschein, Jeffrey S. ; Shachnai, Hadas 2016 Universitätsverlag der TU Berlin
• The Complexity of Approximating complex-valued Ising and Tutte partition functions
  Goldberg, Leslie Ann ; Guo, Heng