A randomized, o(log w)-depth 2 smoothing network

Συγγραφείς: Mavronicolas, Marios, Sauerwald, T.

Πηγή: Annual ACM Symposium on Parallelism in Algorithms and Architectures
21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'09

Θεματικοί όροι: 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

Σύνδεσμος πρόσβασης: 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

Combinatorial Properties of Periodic Patterns in Compressed Strings

Συγγραφείς: Pape-Lange, Julian

Thesis Advisors: Goerdt, Andreas, Bartholdi, Laurent, Meer, Klaus, Technische Universität Chemnitz

Θεματικοί όροι: 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

Διαθεσιμότητα: https://monarch.qucosa.de/id/qucosa%3A87911
https://monarch.qucosa.de/api/qucosa%3A87911/attachment/ATT-0/
https://monarch.qucosa.de/api/qucosa%3A87911/attachment/ATT-1/

Explicit OR-dispersers with polylogarithmic degree

Συγγραφείς: Saks, M., Srinivasan, A., Zhou, S.

Συνεισφορές: INFORMATION SYSTEMS & COMPUTER SCIENCE

Πηγή: Journal of the ACM. 45:123-154

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: 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

Preface

Συγγραφείς: Jan Kratochvíl, Zsuzsanna Lipták

Πηγή: European Journal of Combinatorics. 68:1-2

Θεματικοί όροι: combinatorics, combinatorial algorithms, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://iris.univr.it/handle/11562/972640

Optimal bounds for monotonicity and Lipschitz testing over the hypercube and hypergrids

Συγγραφείς: Deeparnab Chakrabarty, C. Seshadhri

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.princeton.edu/~csesha/pubs/conf-derivative-testing.pdf.

Θεματικοί όροι: ics, Combinatorics—Combinatorial algorithms General Terms

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.487.196

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.487.196
http://www.cs.princeton.edu/~csesha/pubs/conf-derivative-testing.pdf

Optimality of an Algorithm Solving the Bottleneck Tower of Hanoi Problem

Συγγραφείς: Yefim Dinitz, Shay Solomon

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.bgu.ac.il/~shayso/Papers/ds08.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: 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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.2358
http://www.cs.bgu.ac.il/~shayso/Papers/ds08.pdf

Towards Fast Decentralized Construction of Locality-Aware Overlay Networks

Συγγραφείς: Aleksandrs Slivkins

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://research.microsoft.com/users/slivkins/podc07_full.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: 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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.1460
http://research.microsoft.com/users/slivkins/podc07_full.pdf

Minimum-weight Cycle Covers and Their Approximability

Συγγραφείς: Bodo Manthey

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://arxiv.org/pdf/cs/0609103v2.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.4448; http://arxiv.org/pdf/cs/0609103v2.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.4448
http://arxiv.org/pdf/cs/0609103v2.pdf

Energy-Efficient Algorithms for . . .

Συγγραφείς: Susanne Albers, HIROSHI FUJIWARA

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.pitt.edu/~kirk/cs3150spring2010/a49-albers.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.6036

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.6036
http://www.cs.pitt.edu/~kirk/cs3150spring2010/a49-albers.pdf

Tight bounds for connecting sites across barrieres

Συγγραφείς: David W. Krumme, Diane L. Souvaine, Eynat Rafalin, Csaba D. Tóth

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.tufts.edu/research/geometry/pdf/p439-krumme.pdf.

Θεματικοί όροι: Nonnumerical Algorithms and Problems—Geometrical problems and computations, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.1265

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.1265
http://www.cs.tufts.edu/research/geometry/pdf/p439-krumme.pdf

Approximation algorithms for restricted cycle covers based on cycle decompositions

Συγγραφείς: Bodo Manthey

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://arxiv.org/pdf/cs/0604020v2.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.8615; http://arxiv.org/pdf/cs/0604020v2.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.8615
http://arxiv.org/pdf/cs/0604020v2.pdf

Approximability of Minimum-weight Cycle Covers

Συγγραφείς: Bodo Manthey

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://arxiv.org/pdf/cs/0609103v1.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.3691; http://arxiv.org/pdf/cs/0609103v1.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.3691
http://arxiv.org/pdf/cs/0609103v1.pdf

Allocating indivisible goods

Συγγραφείς: Ivona Bezáková, Varsha Dani

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.sigecom.org/exchanges/volume_5/5.3-Bezakova.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.4975

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.4975
http://www.sigecom.org/exchanges/volume_5/5.3-Bezakova.pdf

Propositional satisfiability and constraint programming: A comparative survey

Συγγραφείς: Lucas Bordeaux, Youssef Hamadi, Lintao Zhang

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://research.microsoft.com/users/lintaoz/papers/survey_2006.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: 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

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.1790
http://research.microsoft.com/users/lintaoz/papers/survey_2006.pdf

On the sample size of k-restricted min-wise independent permutations and other k-wise distributions

Συγγραφείς: Toshiya Itoh

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.jtlab.ice.uec.ac.jp/~tarui/itoh-takei-tarui-stoc03.pdf.

Θεματικοί όροι: Combinatorics—Combinatorial algorithms

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.98.7894

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.98.7894
http://www.jtlab.ice.uec.ac.jp/~tarui/itoh-takei-tarui-stoc03.pdf

Metaheuristics in combinatorial optimization: Overview and conceptual comparison

Συγγραφείς: Christian Blum, Andrea Roli

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://iridia.ulb.ac.be/~meta/newsite/downloads/ACSUR-blum-roli.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.7958

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.7958
http://iridia.ulb.ac.be/~meta/newsite/downloads/ACSUR-blum-roli.pdf

Dynamic Programming Algorithms for Haplotype Block Partitioning: Applications to Human Chromosome 21 Haplotype Data

Συγγραφείς: Kui Zhang, Fengzhu Sun, Michael S. Waterman, Ting Chen

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www-hto.usc.edu/~fsun/Publication/SNP/p172-zhang.pdf.

Θεματικοί όροι: Optimization. G.2.1 [Combinatorics] Combinatorial Algorithms

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.1172

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.1172
http://www-hto.usc.edu/~fsun/Publication/SNP/p172-zhang.pdf

Artificial Intelligence Methods and Techniques for Business and Engineering Applications 148 ARTIFICIAL INTELLIGENCE IN MODELING AND SIMULATION DECOMPOSITION METHODS FOR LARGE-SCALE TSP

Συγγραφείς: Roman Bazylevych, Marek Pałasiński, Roman Kutelmakh, Bohdan Kuz, Lubov Bazylevych

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.foibg.com/ibs_isc/ibs-26/ibs-26-p10.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.919

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.919
http://www.foibg.com/ibs_isc/ibs-26/ibs-26-p10.pdf

ON THE DISCRETIZATION OF DISTANCE GEOMETRY PROBLEMS

Συγγραφείς: Antonio Mucherino, Carlile Lavor, Leo Liberti, Nelson Maculan

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p16.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.306.9267

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.306.9267
http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p16.pdf

Network Planning using Geomorphology

Συγγραφείς: Ingo Petzold, Gerhard Gröger, Lutz Plümer

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.ikg.uni-bonn.de/uploads/tx_ikgpublication/acm_gis_2001.pdf.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.3107

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.3107
http://www.ikg.uni-bonn.de/uploads/tx_ikgpublication/acm_gis_2001.pdf