Approximate Counting for Spin Systems in Sub-Quadratic Time

Authors: Anand, Konrad, Feng, Weiming, Freifeld, Graham, Guo, Heng, Wang, Jiaheng

Contributors: Konrad Anand and Weiming Feng and Graham Freifeld and Heng Guo and Jiaheng Wang, Bringmann, Karl, Grohe, Martin, Puppis, Gabriele, Svensson, Ola

Source: Leibniz International Proceedings in Informatics (LIPIcs), 297
51st International Colloquium on Automata, Languages, and Programming
TheoretiCS

Subject Terms: FOS: Computer and information sciences, Spin system, Randomised algorithm, Approximate counting, Sub-quadratic algorithm, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004

File Description: application/pdf; application/application/pdf

Access URL: http://arxiv.org/abs/2306.14867
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.11
http://hdl.handle.net/20.500.11850/683858

An Algorithmic Meta Theorem for Homomorphism Indistinguishability

Authors: Seppelt, Tim Frederik

Contributors: Tim Seppelt

Source: Saarbrücken/Wadern, Germany : Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics 306, 82:1-82:19 (2024). doi:10.4230/LIPIcs.MFCS.2024.82
49th International Symposium on Mathematical Foundations of Computer Science : (MFCS 2024), August 26-30, 2024, Bratislava, Slovakia / Edited by Rastislav Královič, Antonín Kučera
49th International Symposium on Mathematical Foundations of Computer Science : (MFCS 2024), August 26-30, 2024, Bratislava, Slovakia / Edited by Rastislav Královič, Antonín Kučera49. International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, Bratislava, Slovakia, 2024-08-26-2024-08-30
49th International Symposium on Mathematical Foundations of Computer Science

Subject Terms: Computer Science - Logic in Computer Science, Mathematics of computing → Graph theory, recognisability, Mathematics of computing → Combinatorics, graph minor, Courcelle's Theorem, Computer Science - Computational Complexity, Theory of computation → Graph algorithms analysis, graph homomorphism, randomised algorithm, Mathematics - Combinatorics, Theory of computation → Parameterized complexity and exact algorithms, homomorphism indistinguishability, ddc:004, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/2402.08989
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.82
https://publications.rwth-aachen.de/record/991819

Approximate Counting for Spin Systems in Sub-Quadratic Time

Authors: Anand, Konrad, Feng, Weiming, Freifeld, Graham, Guo, Heng, Wang, Jiaheng

Contributors: Bringmann, Karl, Grohe, Martin, Puppis, Gabriele, Svensson, Ola

Source: Leibniz International Proceedings in Informatics (LIPIcs), 297 ; 51st International Colloquium on Automata, Languages, and Programming

Subject Terms: Randomised algorithm, Approximate counting, Spin system, Sub-quadratic algorithm

File Description: application/application/pdf

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2306.14867; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-322-5; http://hdl.handle.net/20.500.11850/683858

Availability: https://hdl.handle.net/20.500.11850/683858
https://doi.org/10.3929/ethz-b-000683858

An Algorithmic Meta Theorem for Homomorphism Indistinguishability

Authors: Seppelt, Tim

Contributors: Tim Seppelt

Subject Terms: homomorphism indistinguishability, graph homomorphism, graph minor, recognisability, randomised algorithm, Courcelle’s Theorem

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 306, 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.82

Availability: https://doi.org/10.4230/LIPIcs.MFCS.2024.82
https://nbn-resolving.org/urn:nbn:de:0030-drops-206387
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.82

Diversity, Fairness, and Sustainability in Population Protocols

Authors: Kang, Nan, Mallmann-Trenn, Frederik, Rivera, Nicolás

Source: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. :67-76

Availability: http://dl.acm.org/doi/10.1145/3465084.3467940

The winning percentage in congkak using a randomised strategy

Authors: Chuei Yee Chen, Shahrina Ismail, Fong Peng Lim, Kai Siong Yow

Source: Songklanakarin Journal of Science and Technology (SJST), Vol 44, Iss 5, Pp 1164-1171 (2022)

Subject Terms: mancala, congkak, counting game, first-move advantage, randomised algorithm, winning percentage, Technology, Technology (General), T1-995, Science, Science (General), Q1-390

File Description: electronic resource

Relation: https://sjst.psu.ac.th/journal/44-5/1.pdf; https://doaj.org/toc/0125-3395

Access URL: https://doaj.org/article/77e98f79d811490e817bf3d85fd7f0e4

Almost Logarithmic-Time Space Optimal Leader Election in Population Protocols

Authors: Gąsieniec, Leszek, Stachowiak, Grzegorz, Uznanski, Przemyslaw

Source: The 31st ACM Symposium on Parallelism in Algorithms and Architectures. :93-102

Availability: http://dl.acm.org/doi/10.1145/3323165.3323178

Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election

Authors: Gąsieniec, Leszek, Stachowiak, Grzegorz

Source: Journal of the ACM (JACM). 68(1):1-21

Availability: http://dl.acm.org/doi/10.1145/3424659

Packing degenerate graphs

Authors: Allen, Peter ^{a, ⁎, 1}, Böttcher, Julia ^{a, 2}, Hladký, Jan ^{b, 3}, Piguet, Diana ^{c, 3}

Source: In Advances in Mathematics 1 October 2019 354

Control analysis and design via randomised coordinate polynomial minimisation

Authors: Calafiore G. C., Novara C., Possieri C.

Contributors: Calafiore, G. C., Novara, C., Possieri, C.

Subject Terms: Nonlinear control, optimal control, optimisation method, randomised algorithm, robustness

File Description: ELETTRONICO

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000548068800001; volume:95; issue:1; firstpage:158; lastpage:172; numberofpages:15; journal:INTERNATIONAL JOURNAL OF CONTROL; https://hdl.handle.net/11583/2854580

Availability: https://hdl.handle.net/11583/2854580
https://doi.org/10.1080/00207179.2020.1782476
https://www.tandfonline.com/doi/abs/10.1080/00207179.2020.1782476?journalCode=tcon20

Amplifiers for the Moran Process

Authors: Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby

Contributors: Andreas Galanis and Andreas Göbel and Leslie Ann Goldberg and John Lapinskas and David Richerby

Source: Galanis, A, Göbel, A, Goldberg, L A, Lapinskas, J A & Richerby, D 2017, 'Amplifiers for the Moran process', Journal of the ACM, vol. 64, no. 1, pp. 1. https://doi.org/10.1145/3019609

Subject Terms: Social and Information Networks (cs.SI), FOS: Computer and information sciences, name=Algorithms and Complexity, Discrete Mathematics (cs.DM), Probability (math.PR), Populations and Evolution (q-bio.PE), Computer Science - Social and Information Networks, randomised algorithm on graphs, 0102 computer and information sciences, 16. Peace & justice, 01 natural sciences, FOS: Biological sciences, Moran process, FOS: Mathematics, evolutionary dynamics, ddc:004, Quantitative Biology - Populations and Evolution, Mathematics - Probability, Computer Science - Discrete Mathematics

File Description: application/pdf; text

Access URL: https://drops.dagstuhl.de/opus/volltexte/2016/6222/pdf/LIPIcs-ICALP-2016-62.pdf
http://arxiv.org/abs/1512.05632
https://dl.acm.org/doi/10.1145/3019609
https://dblp.uni-trier.de/db/journals/jacm/jacm64.html#Galanis0GLR17
https://research-information.bris.ac.uk/ws/files/206843134/Full_text_PDF_accepted_author_manuscript_.pdf
https://doi.org/10.1145/3019609
https://research-information.bris.ac.uk/en/publications/amplifiers-for-the-moran-process
https://dl.acm.org/citation.cfm?id=3019609
https://ora.ox.ac.uk/objects/uuid:370cb1f4-d133-4f1b-bc14-66c4af4bc550
https://doi.org/10.4230/lipics.icalp.2016.62
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.62
https://hdl.handle.net/1983/59a1e9ce-6840-43c3-95f3-5b7a3904e9f6
https://research-information.bris.ac.uk/en/publications/59a1e9ce-6840-43c3-95f3-5b7a3904e9f6

Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields

Authors: Nitin Saxena, Gábor Ivanyos, Igor E. Shparlinski, Miklos Santha, Marek Karpinski

Contributors: Santha, Miklos

Source: Algorithmica. 80:560-575

Subject Terms: FOS: Computer and information sciences, rational functions, [INFO] Computer Science [cs], Polynomials, Randomised algorithm, Nullstellensatz, Number theory, Black boxes, Computer Science - Data Structures and Algorithms, Black-box interpolation, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Number Theory (math.NT), quantum algorithms, Rational Function, QA Mathematics / matematika, Mathematics - Number Theory, Hidden polynomial power, Deterministic algorithm, Deterministic algorithms, QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, interpolation, Randomised algorithms, Quantum algorithm, Quantum Theory, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC]

File Description: text

Access URL: http://eprints.sztaki.hu/9543/1/Ivanyos_560_3263802_ny.pdf
http://arxiv.org/abs/1502.06631
https://dblp.uni-trier.de/db/journals/corr/corr1502.html#IvanyosKSSS15
http://theory.cs.uni-bonn.de/ftp/reports/cs-reports/2015/85353-CS.pdf
http://dblp.uni-trier.de/db/journals/corr/corr1502.html#IvanyosKSSS15
https://researchers.mq.edu.au/en/publications/polynomial-interpolation-and-identity-testing-from-high-powers-ov
https://link.springer.com/article/10.1007/s00453-016-0273-1
https://arxiv.org/abs/1502.06631
https://eprints.sztaki.hu/9543/

Patterns from nature: Distributed greedy colouring with simple messages and minimal graph knowledge

Authors: Xu, Lei ^{a, b}, Jeavons, Peter ^{b, ⁎}

Source: In Information Sciences 20 September 2015 316:550-566

Beta Random Projection

Authors: Lu, Yu-En^Aff5, Liò, Pietro^Aff5, Hand, Steven^Aff5

Contributors: Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Liò, Pietro, editor^Aff1, Yoneki, Eiko, editor^Aff2, Crowcroft, Jon, editor^Aff3, Verma, Dinesh C., editor^Aff4

Source: Bio-Inspired Computing and Communication : First Workshop on Bio-Inspired Design of Networks, BIOWIRE 2007 Cambridge, UK, April 2-5, 2007 Revised Selected Papers. 5151:319-331

Randomised broadcasting: Memory vs. randomness

Authors: Berenbrink, Petra ^a, Elsässer, Robert ^b, Sauerwald, Thomas ^{c, ⁎}

Source: In Theoretical Computer Science 6 February 2014 520:27-42

Amplifiers for the Moran Process

Authors: Galanis, Andreas, Göbel, Andreas, Goldberg, Leslie Ann, Lapinskas, John, Richerby, David

Contributors: Andreas Galanis and Andreas Göbel and Leslie Ann Goldberg and John Lapinskas and David Richerby

Subject Terms: Moran process, randomised algorithm on graphs, evolutionary dynamics

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.62

Availability: https://doi.org/10.4230/LIPIcs.ICALP.2016.62
https://nbn-resolving.org/urn:nbn:de:0030-drops-62227
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.62

A randomised approach for NARX model identification based on a multivariate Bernoulli distribution

Authors: BIANCHI, FEDERICO, FALSONE, ALESSANDRO, PRANDINI, MARIA, PIRODDI, LUIGI

Contributors: Bianchi, Federico, Falsone, Alessandro, Prandini, Maria, Piroddi, Luigi

Subject Terms: model structure selection, multivariate Bernoulli distribution, Nonlinear model identification, polynomial NARX model, prediction error minimisation method, randomised algorithm, Control and Systems Engineering, Theoretical Computer Science, Computer Science Applications1707 Computer Vision and Pattern Recognition

File Description: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000396820200008; volume:48; issue:6; firstpage:1203; lastpage:1216; numberofpages:14; journal:INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE; info:eu-repo/grantAgreement/EC/H2020/643921; http://hdl.handle.net/11311/1009157; http://www.tandf.co.uk/journals/titles/00207721.asp

Availability: http://hdl.handle.net/11311/1009157
https://doi.org/10.1080/00207721.2016.1244309
http://www.tandf.co.uk/journals/titles/00207721.asp

Game-theoretic methods for locating camera towers and scheduling surveillance

Authors: Salmeron, Javier, Wood, R. Kevin

Contributors: Naval Postgraduate School (U.S.), Operations Research (OR)

Subject Terms: camera tower, surveillance, column generation, integer programming, randomised algorithm

File Description: 10 P.; application/pdf

Relation: https://hdl.handle.net/10945/62546

Availability: https://hdl.handle.net/10945/62546

IMPROVING THE ACCURACY OF SIGNAL TRANSDUCTION PATHWAY CONSTRUCTION USING LEVEL-2 NEIGHBOURS

Authors: Wong, SCK, Yiu, SM, Lam, TW, Wong, TKF

Source: Regulatory Genomics. :99-107

Subject Terms: Proteomics, 0301 basic medicine, 0303 health sciences, System biology, Cell cycle pathway construction, Protein, Protein pathway construction, Intracellular Signaling Peptides and Proteins, Computational Biology, MAPK pathway, Signal transduction pathway, Protein pathway, Genomics, Level-2 neighbours, MAPK pathway construction, Databases, Randomised algorithm, 03 medical and health sciences, Pathway construction, Intracellular Signaling Peptides and Proteins - chemistry - genetics - metabolism, Databases, Protein, Algorithms, Signal Transduction

Access URL: https://pubmed.ncbi.nlm.nih.gov/21354961
http://www.worldscientific.com/doi/abs/10.1142/9781848162525_0020
http://hdl.handle.net/10722/140788

A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions

Authors: Ulrich Kühn

Source: Discrete Applied Mathematics. 109:177-196

Subject Terms: Randomised algorithm, Applied Mathematics, Computer graphics, computational geometry (digital and algorithmic aspects), Parallel computation, Discrete Mathematics and Combinatorics, Symmetric convex distance function, randomized parallel algorithm, planar Voronoi diagrams, 0102 computer and information sciences, Voronoi diagram, Parallel algorithms in computer science, 0101 mathematics, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/1584612
https://doi.org/10.1016/s0166-218x(00)00235-3
https://www.sciencedirect.com/science/article/pii/S0166218X00002353
https://dblp.uni-trier.de/db/journals/dam/dam109.html#Kuhn01
https://www.sciencedirect.com/science/article/abs/pii/S0166218X00002353