Gerencsér, Balázs; Várkonyi, Zsombor Fast synchronization of inhomogenous random automata. (English) Zbl 07790923 Inf. Comput. 296, Article ID 105129, 4 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{B. Gerencsér} and \textit{Z. Várkonyi}, Inf. Comput. 296, Article ID 105129, 4 p. (2024; Zbl 07790923) Full Text: DOI arXiv
Feng, Weiming; Guo, Heng; Wang, Jiaheng Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields. (English) Zbl 07742404 Inf. Comput. 294, Article ID 105066, 34 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{W. Feng} et al., Inf. Comput. 294, Article ID 105066, 34 p. (2023; Zbl 07742404) Full Text: DOI arXiv
Cai, Jin-Yi; Fu, Zhiguo Complexity classification of the eight-vertex model. (English) Zbl 07713428 Inf. Comput. 293, Article ID 105064, 38 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{J.-Y. Cai} and \textit{Z. Fu}, Inf. Comput. 293, Article ID 105064, 38 p. (2023; Zbl 07713428) Full Text: DOI arXiv
Arvind, V.; Fuhlbrück, Frank; Köbler, Johannes; Verbitsky, Oleg On the Weisfeiler-Leman dimension of fractional packing. (English) Zbl 07601280 Inf. Comput. 288, Article ID 104803, 17 p. (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{V. Arvind} et al., Inf. Comput. 288, Article ID 104803, 17 p. (2022; Zbl 07601280) Full Text: DOI
Schoenebeck, Grant; Tao, Biaoshuai; Yu, Fang-Yi Think globally, act locally: on the optimal seeding for nonsubmodular influence maximization. (English) Zbl 1492.91251 Inf. Comput. 285, Part B, Article ID 104919, 22 p. (2022). MSC: 91D30 PDFBibTeX XMLCite \textit{G. Schoenebeck} et al., Inf. Comput. 285, Part B, Article ID 104919, 22 p. (2022; Zbl 1492.91251) Full Text: DOI arXiv
Galanis, Andreas; Goldberg, Leslie Ann; Stewart, James Fast mixing via polymers for random graphs with unbounded degree. (English) Zbl 1504.68285 Inf. Comput. 285, Part B, Article ID 104894, 16 p. (2022). MSC: 68W25 05C80 82B20 82D40 PDFBibTeX XMLCite \textit{A. Galanis} et al., Inf. Comput. 285, Part B, Article ID 104894, 16 p. (2022; Zbl 1504.68285) Full Text: DOI arXiv
Zehmakan, Ahad N. On the spread of influence in graphs. (English) Zbl 1520.91290 Inf. Comput. 281, Article ID 104808, 19 p. (2021). MSC: 91D30 05C90 PDFBibTeX XMLCite \textit{A. N. Zehmakan}, Inf. Comput. 281, Article ID 104808, 19 p. (2021; Zbl 1520.91290) Full Text: DOI
Berndt, Sebastian; Liśkiewicz, Maciej On the universal steganography of optimal rate. (English) Zbl 1500.94019 Inf. Comput. 275, Article ID 104632, 24 p. (2020). MSC: 94A60 PDFBibTeX XMLCite \textit{S. Berndt} and \textit{M. Liśkiewicz}, Inf. Comput. 275, Article ID 104632, 24 p. (2020; Zbl 1500.94019) Full Text: DOI
Fuller, Benjamin; Meng, Xianrui; Reyzin, Leonid Computational fuzzy extractors. (English) Zbl 1492.94108 Inf. Comput. 275, Article ID 104602, 21 p. (2020). MSC: 94A60 94B99 PDFBibTeX XMLCite \textit{B. Fuller} et al., Inf. Comput. 275, Article ID 104602, 21 p. (2020; Zbl 1492.94108) Full Text: DOI
Genuzio, Marco; Ottaviano, Giuseppe; Vigna, Sebastiano Fast scalable construction of ([compressed] static | minimal perfect hash) functions. (English) Zbl 1446.68038 Inf. Comput. 273, Article ID 104517, 17 p. (2020). MSC: 68P05 68P30 PDFBibTeX XMLCite \textit{M. Genuzio} et al., Inf. Comput. 273, Article ID 104517, 17 p. (2020; Zbl 1446.68038) Full Text: DOI
Chen, Yijia; Flum, Jörg Some lower bounds in parameterized \(\mathrm{AC}^{0}\). (English) Zbl 1423.68196 Inf. Comput. 267, 116-134 (2019). Reviewer: Ioan Tomescu (Bucureşti) MSC: 68Q19 05C69 68Q15 68Q17 68Q25 68R10 PDFBibTeX XMLCite \textit{Y. Chen} and \textit{J. Flum}, Inf. Comput. 267, 116--134 (2019; Zbl 1423.68196) Full Text: DOI
Song, Renjie; Yin, Yitong; Zhao, Jinman Counting hypergraph matchings up to uniqueness threshold. (English) Zbl 1423.05084 Inf. Comput. 266, 75-96 (2019). MSC: 05C30 05C65 05C70 PDFBibTeX XMLCite \textit{R. Song} et al., Inf. Comput. 266, 75--96 (2019; Zbl 1423.05084) Full Text: DOI
Gąsieniec, Leszek; Jurdzinski, Tomasz; Martin, Russell; Stachowiak, Grzegorz Communication and location discovery in geometric ring networks. (English) Zbl 1421.68005 Inf. Comput. 266, 19-48 (2019). MSC: 68M14 68W15 PDFBibTeX XMLCite \textit{L. Gąsieniec} et al., Inf. Comput. 266, 19--48 (2019; Zbl 1421.68005) Full Text: DOI
Cai, Jin-Yi; Fu, Zhiguo; Xia, Mingji Complexity classification of the six-vertex model. (English) Zbl 1388.68107 Inf. Comput. 259, Part 1, 130-141 (2018). MSC: 68Q25 PDFBibTeX XMLCite \textit{J.-Y. Cai} et al., Inf. Comput. 259, Part 1, 130--141 (2018; Zbl 1388.68107) Full Text: DOI arXiv
Cai, Jin-Yi; Guo, Heng; Williams, Tyson Holographic algorithms beyond matchgates. (English) Zbl 1390.68338 Inf. Comput. 259, Part 1, 102-129 (2018). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{J.-Y. Cai} et al., Inf. Comput. 259, Part 1, 102--129 (2018; Zbl 1390.68338) Full Text: DOI arXiv
Bennett, Patrick; Bonacina, Ilario; Galesi, Nicola; Huynh, Tony; Molloy, Mike; Wollan, Paul Space proof complexity for random 3-CNFs. (English) Zbl 1423.03242 Inf. Comput. 255, Part 1, 165-176 (2017). MSC: 03F20 05C70 PDFBibTeX XMLCite \textit{P. Bennett} et al., Inf. Comput. 255, Part 1, 165--176 (2017; Zbl 1423.03242) Full Text: DOI arXiv
Chlebus, Bogdan S.; Gąsieniec, Leszek; Kowalski, Dariusz R.; Schwarzmann, Alexander A. Doing-it-all with bounded work and communication. (English) Zbl 1370.68314 Inf. Comput. 254, Part 1, 1-40 (2017). MSC: 68W15 68M20 68W40 PDFBibTeX XMLCite \textit{B. S. Chlebus} et al., Inf. Comput. 254, Part 1, 1--40 (2017; Zbl 1370.68314) Full Text: DOI arXiv
Lin, Bingkai; Chen, Yijia The parameterized complexity of \(k\)-edge induced subgraphs. (English) Zbl 1355.68127 Inf. Comput. 252, 138-160 (2017). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{B. Lin} and \textit{Y. Chen}, Inf. Comput. 252, 138--160 (2017; Zbl 1355.68127) Full Text: DOI
Galanis, Andreas; Goldberg, Leslie Ann The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs. (English) Zbl 1353.68128 Inf. Comput. 251, 36-66 (2016). MSC: 68Q25 05C65 68Q17 82B20 82C20 PDFBibTeX XMLCite \textit{A. Galanis} and \textit{L. A. Goldberg}, Inf. Comput. 251, 36--66 (2016; Zbl 1353.68128) Full Text: DOI arXiv
Nellore, Abhinav; Ward, Rachel Recovery guarantees for exemplar-based clustering. (English) Zbl 1333.62165 Inf. Comput. 245, 165-180 (2015). MSC: 62H30 90C05 90C09 PDFBibTeX XMLCite \textit{A. Nellore} and \textit{R. Ward}, Inf. Comput. 245, 165--180 (2015; Zbl 1333.62165) Full Text: DOI arXiv
Pettie, Seth; Su, Hsin-Hao Distributed coloring algorithms for triangle-free graphs. (English) Zbl 1327.68330 Inf. Comput. 243, 263-280 (2015). MSC: 68W15 05C15 05C85 PDFBibTeX XMLCite \textit{S. Pettie} and \textit{H.-H. Su}, Inf. Comput. 243, 263--280 (2015; Zbl 1327.68330) Full Text: DOI
Bläser, Markus Noncommutativity makes determinants hard. (English) Zbl 1327.68124 Inf. Comput. 243, 133-144 (2015). MSC: 68Q25 15A15 68Q17 PDFBibTeX XMLCite \textit{M. Bläser}, Inf. Comput. 243, 133--144 (2015; Zbl 1327.68124) Full Text: DOI
Gurvits, Leonid Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications. (English) Zbl 1312.68092 Inf. Comput. 240, 42-55 (2015). MSC: 68Q17 15B34 65F30 PDFBibTeX XMLCite \textit{L. Gurvits}, Inf. Comput. 240, 42--55 (2015; Zbl 1312.68092) Full Text: DOI
Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Richerby, David The complexity of approximating bounded-degree Boolean \(\#\)CSP. (English) Zbl 1282.68136 Inf. Comput. 220-221, 1-14 (2012). MSC: 68Q25 68Q17 68W25 68R10 PDFBibTeX XMLCite \textit{M. Dyer} et al., Inf. Comput. 220--221, 1--14 (2012; Zbl 1282.68136) Full Text: DOI
Battaglia, Giovanni; Grossi, Roberto; Scutellà, Noemi Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings. (English) Zbl 1252.68133 Inf. Comput. 219, 58-70 (2012). MSC: 68Q17 68W32 68R10 PDFBibTeX XMLCite \textit{G. Battaglia} et al., Inf. Comput. 219, 58--70 (2012; Zbl 1252.68133) Full Text: DOI
Tewari, Raghunath; Vinodchandran, N. V. Green’s theorem and isolation in planar graphs. (English) Zbl 1251.05041 Inf. Comput. 215, 1-7 (2012). MSC: 05C10 26B20 68Q25 PDFBibTeX XMLCite \textit{R. Tewari} and \textit{N. V. Vinodchandran}, Inf. Comput. 215, 1--7 (2012; Zbl 1251.05041) Full Text: DOI
Chechik, Shiri; Emek, Yuval; Patt-Shamir, Boaz; Peleg, David Sparse reliable graph backbones. (English) Zbl 1242.05144 Inf. Comput. 210, 31-39 (2012). MSC: 05C40 05C31 05C42 68R10 68W20 90B15 PDFBibTeX XMLCite \textit{S. Chechik} et al., Inf. Comput. 210, 31--39 (2012; Zbl 1242.05144) Full Text: DOI
Tzameret, Iddo Algebraic proofs over noncommutative formulas. (English) Zbl 1251.03072 Inf. Comput. 209, No. 10, 1269-1292 (2011). MSC: 03F20 PDFBibTeX XMLCite \textit{I. Tzameret}, Inf. Comput. 209, No. 10, 1269--1292 (2011; Zbl 1251.03072) Full Text: DOI
Fortnow, Lance; Hitchcock, John M.; Pavan, A.; Vinodchandran, N. V.; Wang, Fengming Extracting Kolmogorov complexity with applications to dimension zero-one laws. (English) Zbl 1215.68114 Inf. Comput. 209, No. 4, 627-636 (2011). MSC: 68Q30 03D32 68Q15 PDFBibTeX XMLCite \textit{L. Fortnow} et al., Inf. Comput. 209, No. 4, 627--636 (2011; Zbl 1215.68114) Full Text: DOI
Goldberg, Leslie Ann; Jerrum, Mark Inapproximability of the Tutte polynomial. (English) Zbl 1153.68039 Inf. Comput. 206, No. 7, 908-929 (2008). MSC: 68R10 05C30 68Q17 68Q25 PDFBibTeX XMLCite \textit{L. A. Goldberg} and \textit{M. Jerrum}, Inf. Comput. 206, No. 7, 908--929 (2008; Zbl 1153.68039) Full Text: DOI arXiv
Ailon, Nir; Alon, Noga Hardness of fully dense problems. (English) Zbl 1121.68054 Inf. Comput. 205, No. 8, 1117-1129 (2007). MSC: 68Q17 68W25 68R10 PDFBibTeX XMLCite \textit{N. Ailon} and \textit{N. Alon}, Inf. Comput. 205, No. 8, 1117--1129 (2007; Zbl 1121.68054) Full Text: DOI
Bulatov, Andrei A.; Dalmau, Víctor Towards a dichotomy theorem for the counting constraint satisfaction problem. (English) Zbl 1115.68141 Inf. Comput. 205, No. 5, 651-678 (2007). MSC: 68T20 68Q25 PDFBibTeX XMLCite \textit{A. A. Bulatov} and \textit{V. Dalmau}, Inf. Comput. 205, No. 5, 651--678 (2007; Zbl 1115.68141) Full Text: DOI Link
Duchon, Philippe; Hanusse, Nicolas; Saheb, Nasser; Zemmari, Akka Broadcast in the rendezvous model. (English) Zbl 1101.68487 Inf. Comput. 204, No. 5, 697-712 (2006). MSC: 68P05 68W05 PDFBibTeX XMLCite \textit{P. Duchon} et al., Inf. Comput. 204, No. 5, 697--712 (2006; Zbl 1101.68487) Full Text: DOI
Kowalski, Dariusz R.; Shvartsman, Alex A. Performing work with asynchronous processors: Message-delay-sensitive bounds. (English) Zbl 1083.68004 Inf. Comput. 203, No. 2, 181-210 (2005). MSC: 68M14 PDFBibTeX XMLCite \textit{D. R. Kowalski} and \textit{A. A. Shvartsman}, Inf. Comput. 203, No. 2, 181--210 (2005; Zbl 1083.68004) Full Text: DOI
Allender, Eric; Mahajan, Meena The complexity of planarity testing. (English) Zbl 1072.68045 Inf. Comput. 189, No. 1, 117-134 (2004). MSC: 68Q15 68Q17 68R10 05C85 05C10 PDFBibTeX XMLCite \textit{E. Allender} and \textit{M. Mahajan}, Inf. Comput. 189, No. 1, 117--134 (2004; Zbl 1072.68045) Full Text: DOI
Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark Counting and sampling \(H\)-colourings. (English) Zbl 1082.68079 Inf. Comput. 189, No. 1, 1-16 (2004). MSC: 68R10 05C15 PDFBibTeX XMLCite \textit{M. Dyer} et al., Inf. Comput. 189, No. 1, 1--16 (2004; Zbl 1082.68079) Full Text: DOI
Bartlett, Peter L.; Fischer, Paul; Höffgen, Klaus-Uwe Exploiting random walks for learning. (English) Zbl 1012.68150 Inf. Comput. 176, No. 2, 121-135 (2002). MSC: 68T05 60G50 62M20 62P15 93E35 PDFBibTeX XMLCite \textit{P. L. Bartlett} et al., Inf. Comput. 176, No. 2, 121--135 (2002; Zbl 1012.68150) Full Text: DOI
Sieling, Detlef The nonapproximability of OBDD minimization. (English) Zbl 1009.68057 Inf. Comput. 172, No. 2, 103-138 (2002). MSC: 68Q17 68Q05 PDFBibTeX XMLCite \textit{D. Sieling}, Inf. Comput. 172, No. 2, 103--138 (2002; Zbl 1009.68057) Full Text: DOI Link
Naor, Moni; Ruah, Sitvanit On the decisional complexity of problems over the reals. (English) Zbl 1007.68076 Inf. Comput. 167, No. 1, 27-45 (2001). MSC: 68Q25 68W20 PDFBibTeX XMLCite \textit{M. Naor} and \textit{S. Ruah}, Inf. Comput. 167, No. 1, 27--45 (2001; Zbl 1007.68076) Full Text: DOI Link