المؤلفون: Mutzel, Petra, Pagh, Rasmus, Herman, Grzegorz

مصطلحات موضوعية: Theory of computation → Pseudorandomness and derandomization, Theory of computation → Computational geometry, Security and privacy → Pseudonymity, anonymity and untraceability, Mathematics of computing → Graph enumeration, Mathematics of computing → Paths and connectivity problems, Theory of computation → Algorithmic game theory, Mathematics of computing → Random graphs, Theory of computation → Parameterized complexity and exact algorithms, Computing methodologies → Search methodologies, Front Matter, Theory of computation → Semidefinite programming, Table of Contents, Theory of computation → Shortest paths, Theory of computation → Machine learning theory, Theory of computation → Sparsification and spanners, Computing methodologies → Feature selection, Mathematics of computing → Discrete mathematics, Mathematics of computing → Topology, Theory of computation → Problems, reductions and completeness, Mathematics of computing → Algebraic topology, Theory of computation → Online algorithms, Mathematics of computing → Graphs and surfaces, Theory of computation → Packing and covering problems, Theory of computation → Graph algorithms analysis, Theory of computation → Cell probe models and lower bounds, Theory of computation → Quantum computation theory, Mathematics of computing → Permutations and combinations, Mathematics of computing → Graph coloring, Computing methodologies → Concurrent computing methodologies, Theory of computation → Data compression, Mathematics of computing → Trees, Theory of computation → Network optimization, Theory of computation → Data structures design and analysis, Mathematics of computing → Graph algorithms, Theory of computation → Scheduling algorithms, Theory of computation → Approximation algorithms analysis, Theory of computation → Fixed parameter tractability, Theory of computation → Algorithmic mechanism design, Theory of computation → Dynamic programming, Theory of computation → Pattern matching, Theory of computation → Backtracking, Theory of computation → Rounding techniques, Theory of computation → Dynamic graph algorithms, Mathematics of computing → Approximation algorithms, Mathematics of computing → Distribution functions, Theory of computation → Models of computation, Theory of computation → Design and analysis of algorithms, Mathematics of computing → Probabilistic algorithms, Theory of computation → Random network models, Theory of computation → Shared memory algorithms, Theory of computation → Quantum complexity theory, Theory of computation → Network flows, Conference Organization, Mathematics of computing → Matroids and greedoids, Preface, Networks → Network algorithms, Theory of computation → Algorithm design techniques, Theory of computation → Computational complexity and cryptography

الوصول الحر: https://explore.openaire.euTest/search/publication?articleId=doi_________::680fffb25a506337a0daa8b00debae2e

المؤلفون: Mutzel, Petra, Pagh, Rasmus, Herman, Grzegorz

مصطلحات موضوعية: Theory of computation → Pseudorandomness and derandomization, Theory of computation → Computational geometry, Security and privacy → Pseudonymity, anonymity and untraceability, Mathematics of computing → Graph enumeration, Mathematics of computing → Paths and connectivity problems, Theory of computation → Algorithmic game theory, Mathematics of computing → Random graphs, Theory of computation → Parameterized complexity and exact algorithms, Computing methodologies → Search methodologies, Theory of computation → Semidefinite programming, Theory of computation → Shortest paths, Theory of computation → Machine learning theory, Theory of computation → Sparsification and spanners, Computing methodologies → Feature selection, Mathematics of computing → Discrete mathematics, Mathematics of computing → Topology, Theory of computation → Problems, reductions and completeness, Mathematics of computing → Algebraic topology, Theory of computation → Online algorithms, Mathematics of computing → Graphs and surfaces, Theory of computation → Packing and covering problems, Theory of computation → Graph algorithms analysis, Theory of computation → Cell probe models and lower bounds, Theory of computation → Quantum computation theory, Mathematics of computing → Permutations and combinations, Mathematics of computing → Graph coloring, Computing methodologies → Concurrent computing methodologies, Theory of computation → Data compression, Mathematics of computing → Trees, Theory of computation → Network optimization, Theory of computation → Data structures design and analysis, Data processing Computer science, Mathematics of computing → Graph algorithms, Theory of computation → Scheduling algorithms, Theory of computation → Approximation algorithms analysis, Theory of computation → Fixed parameter tractability, LIPIcs, Volume 204, ESA 2021, Complete Volume, Theory of computation → Algorithmic mechanism design, Theory of computation → Dynamic programming, Theory of computation → Pattern matching, Theory of computation → Backtracking, Theory of computation → Rounding techniques, Theory of computation → Dynamic graph algorithms, Mathematics of computing → Approximation algorithms, Mathematics of computing → Distribution functions, Theory of computation → Models of computation, Theory of computation → Design and analysis of algorithms, Mathematics of computing → Probabilistic algorithms, Theory of computation → Random network models, Theory of computation → Shared memory algorithms, Theory of computation → Quantum complexity theory, Theory of computation → Network flows, Mathematics of computing → Matroids and greedoids, ddc:004, Networks → Network algorithms, Theory of computation → Algorithm design techniques, Theory of computation → Computational complexity and cryptography

وصف الملف: application/pdf

الوصول الحر: https://explore.openaire.euTest/search/publication?articleId=doi_dedup___::a473de808f7f82a1dee1c640d7ddabfd