Výsledky vyhledávání - Combinatorics—combinatorial algorithms*

Combinatorial Algorithms

Autoři: Charles J. Colbourn Roberto Grossi Nadia Pisanti

Resource Type: eBook.

Témata: Computer science—Mathematics, Discrete mathematics, Algorithms, Artificial intelligence—Data processing, Computer arithmetic and logic units, Computer graphics

Categories: COMPUTERS / Computer Science, COMPUTERS / Artificial Intelligence / General, COMPUTERS / Software Development & Engineering / Computer Graphics, COMPUTERS / Database Administration & Management, COMPUTERS / Logic Design, COMPUTERS / Programming / Algorithms, MATHEMATICS / Discrete Mathematics

Approximation algorithms for restricted cycle covers based on cycle decompositions

Autoři: Bodo Manthey The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Bodo Manthey The Pennsylvania State University CiteSeerX Archives

Zdroj: http://arxiv.org/pdf/cs/0604020v2.pdf.

Témata: 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

Popis souboru: application/pdf

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

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

Energy-Efficient Algorithms for . . .

Autoři: Susanne Albers HIROSHI FUJIWARA The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Susanne Albers HIROSHI FUJIWARA The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.pitt.edu/~kirk/cs3150spring2010/a49-albers.pdf.

Témata: 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

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.6036
http://www.cs.pitt.edu/~kirk/cs3150spring2010/a49-albers.pdf

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

Autoři: Kui Zhang Fengzhu Sun Michael S. Waterman a další

Přispěvatelé: Kui Zhang Fengzhu Sun Michael S. Waterman a další

Zdroj: http://www-hto.usc.edu/~fsun/Publication/SNP/p172-zhang.pdf.

Témata: Optimization. G.2.1 [Combinatorics] Combinatorial Algorithms

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.1172
http://www-hto.usc.edu/~fsun/Publication/SNP/p172-zhang.pdf

Combinatorial Algorithms : 29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018, Proceedings

Autoři: Costas Iliopoulos Hon Wai Leong Wing-Kin Sung

Resource Type: eBook.

Témata: Computer science—Mathematics, Discrete mathematics, Data protection, Software engineering, Image processing—Digital techniques, Computer vision, Data structures (Computer science), Information theory

Categories: COMPUTERS / Computer Science, COMPUTERS / Image Processing, COMPUTERS / Artificial Intelligence / Computer Vision & Pattern Recognition, COMPUTERS / Database Administration & Management, COMPUTERS / Information Theory, COMPUTERS / Software Development & Engineering / General, COMPUTERS / Security / General, MATHEMATICS / Discrete Mathematics

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

Autoři: Mavronicolas, Marios Sauerwald, T.

Zdroj: Annual ACM Symposium on Parallelism in Algorithms and Architectures
21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'09

Témata: 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

Přístupová URL adresa: 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

WALCOM: Algorithms and Computation

Autoři: Ryuhei Uehara Katsuhisa Yamanaka Hsu-Chun Yen

Resource Type: eBook.

Témata: Computer science, Computer science—Mathematics, Discrete mathematics, Numerical analysis, Algorithms, Computer graphics, Information technology—Management

Categories: COMPUTERS / Computer Science, COMPUTERS / Business & Productivity Software / General, COMPUTERS / Software Development & Engineering / Computer Graphics, MATHEMATICS / Discrete Mathematics, MATHEMATICS / Numerical Analysis

WALCOM: Algorithms and Computation

Autoři: Ryuhei Uehara Seok-Hee Hong Subhas C. Nandy

Resource Type: eBook.

Témata: Computer algorithms--Congresses

Categories: COMPUTERS / Computer Science, COMPUTERS / Business & Productivity Software / General, COMPUTERS / Software Development & Engineering / Computer Graphics, COMPUTERS / Database Administration & Management, COMPUTERS / Information Theory, MATHEMATICS / Discrete Mathematics

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

Combinatorial Properties of Periodic Patterns in Compressed Strings

Autoři: Pape-Lange, Julian

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

Témata: 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

Dostupnost: 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/

Towards Fast Decentralized Construction of Locality-Aware Overlay Networks

Autoři: Aleksandrs Slivkins The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Aleksandrs Slivkins The Pennsylvania State University CiteSeerX Archives

Zdroj: http://research.microsoft.com/users/slivkins/podc07_full.pdf.

Témata: 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

Popis souboru: 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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.1460
http://research.microsoft.com/users/slivkins/podc07_full.pdf

Preface

Autoři: Jan Kratochvíl Zsuzsanna Lipták

Zdroj: European Journal of Combinatorics. 68:1-2

Témata: combinatorics, combinatorial algorithms, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: https://iris.univr.it/handle/11562/972640

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

Autoři: Deeparnab Chakrabarty C. Seshadhri The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Deeparnab Chakrabarty C. Seshadhri The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.princeton.edu/~csesha/pubs/conf-derivative-testing.pdf.

Témata: ics, Combinatorics—Combinatorial algorithms General Terms

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.487.196
http://www.cs.princeton.edu/~csesha/pubs/conf-derivative-testing.pdf

Approximability of Minimum-weight Cycle Covers

Autoři: Bodo Manthey The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Bodo Manthey The Pennsylvania State University CiteSeerX Archives

Zdroj: http://arxiv.org/pdf/cs/0609103v1.pdf.

Témata: 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

Popis souboru: application/pdf

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

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

Allocating indivisible goods

Autoři: Ivona Bezáková Varsha Dani The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Ivona Bezáková Varsha Dani The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.sigecom.org/exchanges/volume_5/5.3-Bezakova.pdf.

Témata: 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

Popis souboru: application/pdf

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

Dostupnost: 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

Autoři: Lucas Bordeaux Youssef Hamadi Lintao Zhang a další

Přispěvatelé: Lucas Bordeaux Youssef Hamadi Lintao Zhang a další

Zdroj: http://research.microsoft.com/users/lintaoz/papers/survey_2006.pdf.

Témata: 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

Popis souboru: 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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.1790
http://research.microsoft.com/users/lintaoz/papers/survey_2006.pdf

Approximation algorithms for restricted cycle covers based on cycle decompositions

Autoři: Bodo Manthey The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Bodo Manthey The Pennsylvania State University CiteSeerX Archives

Zdroj: http://arxiv.org/pdf/cs/0604020v1.pdf.

Témata: 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

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.6266
http://arxiv.org/pdf/cs/0604020v1.pdf

Optimality of an Algorithm Solving the Bottleneck Tower of Hanoi Problem

Autoři: Yefim Dinitz Shay Solomon The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Yefim Dinitz Shay Solomon The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.bgu.ac.il/~shayso/Papers/ds08.pdf.

Témata: 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

Popis souboru: 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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.2358
http://www.cs.bgu.ac.il/~shayso/Papers/ds08.pdf

Minimum-weight Cycle Covers and Their Approximability

Autoři: Bodo Manthey The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Bodo Manthey The Pennsylvania State University CiteSeerX Archives

Zdroj: http://arxiv.org/pdf/cs/0609103v2.pdf.

Témata: 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

Popis souboru: application/pdf

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

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

Tight bounds for connecting sites across barrieres

Autoři: David W. Krumme Diane L. Souvaine Eynat Rafalin a další

Přispěvatelé: David W. Krumme Diane L. Souvaine Eynat Rafalin a další

Zdroj: http://www.cs.tufts.edu/research/geometry/pdf/p439-krumme.pdf.

Témata: Nonnumerical Algorithms and Problems—Geometrical problems and computations, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.1265
http://www.cs.tufts.edu/research/geometry/pdf/p439-krumme.pdf