Výsledky vyhledávání - "G.2.1 [Discrete Mathematics]: Combinatorics-combinatorial algorithms"

Explicit OR-dispersers with polylogarithmic degree

Autoři: Saks, M. Srinivasan, A. Zhou, S. a další

Přispěvatelé: Saks, M. Srinivasan, A. Zhou, S. a další

Zdroj: Journal of the ACM. 45:123-154

Témata: F.1.3 [Computaion by Abstract Devices]: Complexity Classes - relations among randomized complexity classes, G.2.1 [Discrete Mathematics]: Combinatorics - combinatorial algorithms, Complexity classes (hierarchies, relations among complexity classes, etc.), 0102 computer and information sciences, RP algorithms, G.3 [Probability and Statistics]: probabilistic algorithms, 01 natural sciences, Algorithms, bipartite multigraph

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1190615
https://doi.org/10.1145/273865.273915
https://dl.acm.org/doi/10.1145/273865.273915
https://dblp.uni-trier.de/db/journals/jacm/jacm45.html#SaksSZ98
https://www.researchwithrutgers.com/en/publications/explicit-or-dispersers-with-polylogarithmic-degree

An Approximation Algorithm for Scheduling Malleable Tasks under General Precedence Constraints.

Autoři: Jansen, Klaus Zhang, Hu

Zdroj: ACM Transactions on Algorithms; 2006, Vol. 2 Issue 3, p416-434, 19p

Témata: ALGORITHMS, COMPUTATIONAL mathematics, ALGEBRA, COMPUTER programming, MATHEMATICAL analysis, INFORMATION technology

A Constructive Proof of the General Lovász Local Lemma.

Autoři: MOSER, ROBIN A. TARDOS, GÁBOR

Zdroj: Journal of the ACM; Jan2010, Vol. 57 Issue 2, p11-11:15, 15p, 1 Diagram

Témata: ALGORITHMS, COMBINATORIAL identities, COMBINATORICS, COMBINATORIAL probabilities, PROBABILITY theory

People: BECK, Jozsef

A Dichotomy Theorem for Constraint Satisfaction Problems on a 3-Element Set.

Autoři: Bulatov, Andrei A.

Zdroj: Journal of the ACM; Jan2006, Vol. 53 Issue 1, p66-120, 55p

Témata: CONSTRAINT satisfaction, BINARY principle (Linguistics), POLYNOMIALS, ALGORITHMS, HOMOMORPHISMS

Almost Tight Upper Bounds for Vertical Decompositions in Four Dimensions.

Autoři: Koltun, Vladlen

Zdroj: Journal of the ACM; Sep2004, Vol. 51 Issue 5, p699-730, 32p, 12 Diagrams

Témata: ALGEBRA, ALGORITHMS, GEOMETRY, MATHEMATICAL optimization, ARITHMETIC

XML stream processing using tree-edit distance embeddings

Autoři: Amit Kumar The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Amit Kumar The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.berkeley.edu/~minos/Papers/tods05xml.pdf.

Témata: General Terms, Algorithms, Performance, Theory Additional Key Words and Phrases, XML, data streams, data synopses, approximate query processing, tree-edit

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.9638; http://www.cs.berkeley.edu/~minos/Papers/tods05xml.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.9638
http://www.cs.berkeley.edu/~minos/Papers/tods05xml.pdf

Polynomial Kernels for Dominating Set in Graphs of Bounded Degeneracy and Beyond.

Autoři: PHILIP, GEEVARGHESE RAMAN, VENKATESH SIKDAR, SOMNATH

Zdroj: ACM Transactions on Algorithms; 2012, Vol. 9 Issue 1, p1-23, 23p

Témata: POLYNOMIALS, KERNEL functions, SET theory, GRAPH theory, ALGORITHMS, TOPOLOGY

Santa Claus Meets Hypergraph Matchings.

Autoři: Asadpour, Arash Feige, Uriel Saberi, Amin

Zdroj: ACM Transactions on Algorithms; 2012, Vol. 8 Issue 3, p1-9, 9p

Témata: HYPERGRAPHS, SANTA Claus, MATCHING theory, BIPARTITE graphs, PATHS & cycles in graph theory, PROOF theory, COMPUTATIONAL complexity, SEARCH algorithms

Centralized and Distributed Task Allocation in Multi-Robot Teams via a Stochastic Clustering Auction.

Autoři: Zhang, Kai Collins, Emmanuel G. Shi, Dongqing

Zdroj: ACM Transactions on Autonomous & Adaptive Systems; 2012, Vol. 7 Issue 2, p21-21:22, 22p

Témata: ASSIGNMENT problems (Programming), ROBOTS, ALGORITHMS, STOCHASTIC analysis, MAXIMA & minima, MARKOV processes, PERFORMANCE evaluation, EXPERIMENTS

Partial Convex Recolorings of Trees and Galled Networks: Tight Upper and Lower Bounds.

Autoři: MORAN, SHLOMO SNIR, SAGI SUNG WING-KIN

Zdroj: ACM Transactions on Algorithms; 2011, Vol. 7 Issue 4, p42-42:20, 20p

Témata: GRAPH coloring, TREE graphs, PHYLOGENY, ALGORITHMS, GENERALIZATION, TRANSPORTATION

Complexity of Conservative Constraint Satisfaction Problems.

Autoři: BULATOV, ANDREI A.

Zdroj: ACM Transactions on Computational Logic; Jul2011, Vol. 12 Issue 4, p24-24:66, 66p

Témata: COMPUTATIONAL complexity, CONSTRAINT satisfaction, MATHEMATICAL variables, NP-complete problems, GRAPH coloring, POLYNOMIALS, DIRECTED graphs, HOMOMORPHISMS

Tree Exploration with Logarithmic Memory.

Autoři: AMBÜHL, CHRISTOPH GĄSIENIEC, LESZEK PELC, ANDRZEJ a další

Zdroj: ACM Transactions on Algorithms; 2011, Vol. 7 Issue 2, p17:1-17:21, 21p

Témata: TREE graphs, MOBILE agent systems, COMPUTER storage devices, PATHS & cycles in graph theory, TOPOLOGY, DISTRIBUTED algorithms, GRAPH theory, MATHEMATICAL models

Length-Bounded Cuts and Flows.

Zdroj: ACM Transactions on Algorithms; 2010, Vol. 7 Issue 1, p4:1-4:27, 27p

Témata: GRAPH theory, COMPUTATIONAL mathematics, COMPUTATIONAL complexity, APPROXIMATION algorithms, MATHEMATICAL decomposition, MATHEMATICAL analysis

Clustering for Metric and Nonmetric Distance Measures.

Autoři: ACKERMANN, MARCEL R. BLÖMER, JOHANNES SOHLER, CHRISTIAN

Zdroj: ACM Transactions on Algorithms; 2010, Vol. 6 Issue 4, p59:1-59:26, 26p, 1 Diagram

Témata: METRIC spaces, MEDIAN (Mathematics), ALGORITHMS, LINEAR time invariant systems, STATISTICS

An Approximation Algorithm for the Maximum Leaf Spanning Arborescence Problem.

Autoři: DRESCHER, MATTHEW VETTA, ADRIAN

Zdroj: ACM Transactions on Algorithms; 2010, Vol. 6 Issue 3, p46:1-46:18, 18p, 4 Diagrams

Témata: APPROXIMATION theory, ALGORITHMS, LEAVES, GRAPHIC methods, CHARTS, diagrams, etc., WILLOWS

An Explicit Universal Cycle for the (n - 1)-Permutations of an n-Set.

Autoři: RUSKEY, FRANK WILLIAMS, AARON

Zdroj: ACM Transactions on Algorithms; 2010, Vol. 6 Issue 3, p45:1-45:12, 12p, 1 Diagram, 2 Charts

Témata: PATHS & cycles in graph theory, SYSTEMATIC instruction, RECURSION theory, ALGORITHMS, PERMUTATIONS

Optimization Problems in Multiple-Interval Graphs.

Autoři: Nutman, Ayelet Hermelin, Danny Lewenstein, Moshi a další

Zdroj: ACM Transactions on Algorithms; 2010, Vol. 6 Issue 2, p40:1-40:18, 18p, 6 Diagrams

Témata: MATHEMATICAL optimization, ALGORITHMS, INTERVAL functions, INTERVAL analysis, GRAPH theory, GRAPHIC methods

Time-Dependent Multi-Scheduling of Multicast.

Autoři: Cohen, Rami Rawitz, Dror Raz, Danny

Zdroj: ACM Transactions on Algorithms; 2009, Vol. 6 Issue 1, p14:1-14:22, 22p, 5 Diagrams, 2 Charts

Témata: MULTICASTING (Computer networks), COMPUTER networks, DIGITAL communications, ELECTRONIC data processing, ELECTRONIC systems, DATA transmission systems

Optimizing Throughput and Energy in Online Deadline Scheduling.

Autoři: Ho-Leung Chan Joseph Wun-Tat Chan Tak-Wah Lam a další

Zdroj: ACM Transactions on Algorithms; 2009, Vol. 6 Issue 1, p10:1-10:22, 22p, 1 Chart

Témata: ONLINE data processing, ALGORITHMS, ELECTRONIC data processing, DATA mining, INFORMATION science

An Optimal Decomposition Algorithm for Tree Edit Distance.

Autoři: Demaine, Erik D. Mozes, Shay Rossman, Benjamin a další

Zdroj: ACM Transactions on Algorithms; 2009, Vol. 6 Issue 1, p2:1-2:19, 19p, 7 Diagrams

Témata: ALGORITHMS, EDITING, READING, AUTHORSHIP, COMPREHENSION