-
1Academic Journal
Authors: Mavronicolas, Marios, Sauerwald, T.
Source: Annual ACM Symposium on Parallelism in Algorithms and Architectures
21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'09Subject Terms: Optimization, Stochastic systems, Data structures, Combinatorial mathematics, Sorting, C.2.4 [Distributed systems]: Distributed applications - Load balancing, Random processes, Distributed applications, 0102 computer and information sciences, Distributed systems, Computer science, 01 natural sciences, Stochastic process, Probability and statistics, 03 medical and health sciences, 0302 clinical medicine, Combinatorics, Wire, G.2.1 [Mathematics of computing]: Combinatorics - Combinatorial algorithms, Combinatorial algorithm, Theory, Load-Balancing, G.3 [Probability and statistics]: Stochastic processes, Balancing, Algorithms
Access URL: http://www.icsi.berkeley.edu/pubs/
algorithms /arandomized09.pdf
https://dblp.uni-trier.de/db/conf/spaa/spaa2009.html#MavronicolasS09
https://core.ac.uk/display/23866066
http://www.cs.ucy.ac.cy/%7Emavronic/pdf/spaa050-mavronicolas.pdf
https://doi.org/10.1145/1583991.1584043
https://dl.acm.org/doi/10.1145/1583991.1584043
http://www.icsi.berkeley.edu/pubs/algorithms /arandomized09.pdf
http://gnosis.library.ucy.ac.cy/handle/7/54523 -
2Dissertation/ Thesis
Authors: Pape-Lange, Julian
Thesis Advisors: Goerdt, Andreas, Bartholdi, Laurent, Meer, Klaus, Technische Universität Chemnitz
Subject Terms: Combinatorics, Combinatorial Algorithms, Highly Compressible Strings, Discrete Acyclic Convolution, Maximal delta-Repetitions, Maximal Repetitions, Maximal Subrepetitions, Cadences, Subcadences, Maximal Pairs, Maximal Repeats, info:eu-repo/classification/ddc/004, ddc:004, Kombinatorik, Algorithmus, Textkompression, Mustererkennung
-
3Academic Journal
Authors: Saks, M., Srinivasan, A., Zhou, S.
Contributors: INFORMATION SYSTEMS & COMPUTER SCIENCE
Source: Journal of the ACM. 45:123-154
Subject Terms: 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
File Description: application/xml
Access URL: 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-degreeLinked Full Text -
4Academic Journal
Authors: Jan Kratochvíl, Zsuzsanna Lipták
Source: European Journal of Combinatorics. 68:1-2
Subject Terms: combinatorics, combinatorial algorithms, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences
File Description: application/pdf
Linked Full TextAccess URL: https://iris.univr.it/handle/11562/972640
-
5Academic Journal
Authors: Deeparnab Chakrabarty, C. Seshadhri
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: ics, Combinatorics—Combinatorial algorithms General Terms
File Description: application/pdf
-
6Academic Journal
Authors: Yefim Dinitz, Shay Solomon
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Optimality proofs, Tower of Hanoi ACM Reference Format
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.2358; http://www.cs.bgu.ac.il/~shayso/Papers/ds08.pdf
-
7Academic Journal
Authors: Aleksandrs Slivkins
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: ACM Categories and Subject Descriptors. E.1 [Data Structures, Distributed data structures, Graphs and networks, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems – Computations on discrete structures, Routing and layout, G.2 [Discrete Mathematics, G.2.1 Combinatorics – Combinatorial algorithms, G.2.2 Graph Theory – Graph algorithms, Graph labeling, Network problems. C.2.2 [Computer- Communication Networks, Network Protocols – Routing protocols. ACM General Terms. Algorithms, Performance, Theory Keywords. Routing schemes, multi-cast trees, distance labeling, triangulation, grid dimension, growthconstrained metrics, locality-awareness
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.1460; http://research.microsoft.com/users/slivkins/podc07_full.pdf
-
8Academic Journal
Authors: Bodo Manthey
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: Combinatorial Optimization, Graph Algorithms, Approximation Algorithms, Inapproximability, Cycle Covers, Two-Factors. ACM Computing Classification, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial algorithms, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, path and circuit problems
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.4448; http://arxiv.org/pdf/cs/0609103v2.pdf
-
9Academic Journal
Authors: Susanne Albers, HIROSHI FUJIWARA
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: Categories and Subject Descriptors, F.2.2 [Analyis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Sequencing and scheduling, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Variable-speed processor, flow time, online algorithms, competitive analysis, offline algorithms, dynamic programming ACM Reference Format
File Description: application/pdf
-
10Academic Journal
Authors: David W. Krumme, Diane L. Souvaine, Eynat Rafalin, Csaba D. Tóth
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: Nonnumerical Algorithms and Problems—Geometrical problems and computations, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms
File Description: application/pdf
-
11Academic Journal
Authors: Bodo Manthey
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: Combinatorial Optimisation, Graph Algorithms, Approximation Algorithms, Cycle Covers, Two-Factors. ACM Computing Classification, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial algorithms, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, path and
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.8615; http://arxiv.org/pdf/cs/0604020v2.pdf
-
12Academic Journal
Authors: Bodo Manthey
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: Combinatorial Optimization, Graph Algorithms, Approximation Algorithms, Inapproximability, Cycle Covers, Two-Factors. ACM Computing Classification, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial algorithms, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, path and circuit problems
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.3691; http://arxiv.org/pdf/cs/0609103v1.pdf
-
13Academic Journal
Authors: Ivona Bezáková, Varsha Dani
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, G.2.1 [Discrete Mathematics, Combinatorics – Combinatorial Algorithms, G.2.2 [Discrete Mathematics, Graph Theory – Graph Algorithms General Terms, Algorithms, Economics, Theory Additional Key Words and Phrases, Approximation Algorithms, Cake-cutting, Fairness, Game Theory, Truthfulness
File Description: application/pdf
-
14Academic Journal
Authors: Lucas Bordeaux, Youssef Hamadi, Lintao Zhang
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: Features—Constraints, G.2.1 [Discrete Mathematicals, Combinatorics—Combinatorial algorithms General Terms, Algorithms Additional Key Words and Phrases, Search, constraint satisfaction, SAT ACM Reference Format
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.1790; http://research.microsoft.com/users/lintaoz/papers/survey_2006.pdf
-
15Academic Journal
Authors: Toshiya Itoh
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: Combinatorics—Combinatorial algorithms
File Description: application/pdf
-
16Academic Journal
Authors: Christian Blum, Andrea Roli
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: Categories and Subject Descriptors, G.2.1 [Discrete Mathematics, Combinatorics— combinatorial algorithms, I.2.8 [Artificial Intelligence, Problem Solving, Control Methods, and Search—heuristic methods General Terms, Algorithms Additional Key Words and Phrases, Metaheuristics, combinatorial optimization, intensification, diversification. C. Blum acknowledges support by the “Metaheuristics Network, ” a Research Training Network funded by
File Description: application/pdf
-
17Academic Journal
Authors: Kui Zhang, Fengzhu Sun, Michael S. Waterman, Ting Chen
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: Optimization. G.2.1 [Combinatorics] Combinatorial Algorithms
File Description: application/pdf
-
18Academic Journal
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: traveling salesman problem, combinatorial NP-hard problems, decomposition, large-scale. ACM Classification Keywords, G.2.1 Combinatorics- Combinatorial algorithms, I.2.8 Problem Solving, Control Methods, and Search- Heuristic methods
File Description: application/pdf
-
19Academic Journal
Authors: Antonio Mucherino, Carlile Lavor, Leo Liberti, Nelson Maculan
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: distance geometry, discretization, combinatorial optimization, discretizing orderings, symmetries. ACMClassification Keywords, G.2.1 Combinatorics- Combinatorial algorithms, B.5.2 Design Aids- Optimization, J.3 Life and Medical Sciences- Biology and genetics
File Description: application/pdf
-
20Academic Journal
Authors: Ingo Petzold, Gerhard Gröger, Lutz Plümer
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: Categories and Subject Descriptors G.2.1 [Discrete Mathematics, Combinatorics – combinatorial algorithms, G.2.2 [Discrete Mathematics, Combinatorics – network problems, H.2.8 [Database Management, Database Applications – spatial databases and GIS, I.2.8 [Artificial
File Description: application/pdf