Czumaj, Artur; Davies, Peter; Parter, Merav Component stability in low-space massively parallel computation. (English) Zbl 07824226 Korhonen, Janne H. (ed.), Proceedings of the 40th ACM symposium on principles of distributed computing, PODC ’21, virtual event, Italy, July 26–30, 2021. New York, NY: Association for Computing Machinery (ACM). 481-491 (2021). MSC: 68M14 68W15 PDFBibTeX XMLCite \textit{A. Czumaj} et al., in: Proceedings of the 40th ACM symposium on principles of distributed computing, PODC '21, virtual event, Italy, July 26--30, 2021. New York, NY: Association for Computing Machinery (ACM). 481--491 (2021; Zbl 07824226) Full Text: DOI arXiv
Charikar, Moses; Ma, Weiyun; Tan, Li-Yang Brief announcement. A randomness-efficient massively parallel algorithm for connectivity. (English) Zbl 07824221 Korhonen, Janne H. (ed.), Proceedings of the 40th ACM symposium on principles of distributed computing, PODC ’21, virtual event, Italy, July 26–30, 2021. New York, NY: Association for Computing Machinery (ACM). 431-433 (2021). MSC: 68M14 68W15 PDFBibTeX XMLCite \textit{M. Charikar} et al., in: Proceedings of the 40th ACM symposium on principles of distributed computing, PODC '21, virtual event, Italy, July 26--30, 2021. New York, NY: Association for Computing Machinery (ACM). 431--433 (2021; Zbl 07824221) Full Text: DOI
Balliu, Alkida; Brandt, Sebastian; Kuhn, Fabian; Olivetti, Dennis Improved distributed lower bounds for MIS and bounded (out-)degree dominating sets in trees. (English) Zbl 07824207 Korhonen, Janne H. (ed.), Proceedings of the 40th ACM symposium on principles of distributed computing, PODC ’21, virtual event, Italy, July 26–30, 2021. New York, NY: Association for Computing Machinery (ACM). 283-293 (2021). MSC: 68M14 68W15 PDFBibTeX XMLCite \textit{A. Balliu} et al., in: Proceedings of the 40th ACM symposium on principles of distributed computing, PODC '21, virtual event, Italy, July 26--30, 2021. New York, NY: Association for Computing Machinery (ACM). 283--293 (2021; Zbl 07824207) Full Text: DOI arXiv
Dinç, Yavuz; Pişkin, Erhan; Tunç, Cemil Lower bounds for blow up time of the \(p\)-Laplacian equation with damping term. (English) Zbl 07803862 Math. Morav. 25, No. 2, 29-33 (2021). MSC: 40B05 33E99 PDFBibTeX XMLCite \textit{Y. Dinç} et al., Math. Morav. 25, No. 2, 29--33 (2021; Zbl 07803862) Full Text: DOI
Razgon, Igor Classification of OBDD size for monotone 2-CNFs. (English) Zbl 07803603 Golovach, Petr A. (ed.) et al., 16th international symposium on parameterized and exact computation, IPEC 2021, Lisbon, Portugal, September 8–10, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 214, Article 25, 15 p. (2021). MSC: 68Q25 68Q27 68Wxx PDFBibTeX XMLCite \textit{I. Razgon}, LIPIcs -- Leibniz Int. Proc. Inform. 214, Article 25, 15 p. (2021; Zbl 07803603) Full Text: DOI arXiv
Jelínek, Vít; Opler, Michal; Pekárek, Jakub Long paths make pattern-counting hard, and deep trees make it Harder. (English) Zbl 07803600 Golovach, Petr A. (ed.) et al., 16th international symposium on parameterized and exact computation, IPEC 2021, Lisbon, Portugal, September 8–10, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 214, Article 22, 17 p. (2021). MSC: 68Q25 68Q27 68Wxx PDFBibTeX XMLCite \textit{V. Jelínek} et al., LIPIcs -- Leibniz Int. Proc. Inform. 214, Article 22, 17 p. (2021; Zbl 07803600) Full Text: DOI arXiv
Bonnet, Édouard; Kim, Eun Jung; Reinald, Amadeus; Thomassé, Stéphan; Watrigant, Rémi Twin-width and polynomial kernels. (English) Zbl 07803588 Golovach, Petr A. (ed.) et al., 16th international symposium on parameterized and exact computation, IPEC 2021, Lisbon, Portugal, September 8–10, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 214, Article 10, 16 p. (2021). MSC: 68Q25 68Q27 68Wxx PDFBibTeX XMLCite \textit{É. Bonnet} et al., LIPIcs -- Leibniz Int. Proc. Inform. 214, Article 10, 16 p. (2021; Zbl 07803588) Full Text: DOI
Chillara, Suryajith Functional lower bounds for restricted arithmetic circuits of depth four. (English) Zbl 07799592 Bojańczyk, Mikołaj (ed.) et al., 41st IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2021, virtual conference, December 15–17, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 213, Article 14, 15 p. (2021). MSC: 68N30 68Qxx PDFBibTeX XMLCite \textit{S. Chillara}, LIPIcs -- Leibniz Int. Proc. Inform. 213, Article 14, 15 p. (2021; Zbl 07799592) Full Text: DOI arXiv
Aaronson, Scott BQP after 28 years (Invited Talk). (English) Zbl 07799579 Bojańczyk, Mikołaj (ed.) et al., 41st IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2021, virtual conference, December 15–17, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 213, Article 1, 1 p. (2021). MSC: 68N30 68Qxx PDFBibTeX XMLCite \textit{S. Aaronson}, LIPIcs -- Leibniz Int. Proc. Inform. 213, Article 1, 1 p. (2021; Zbl 07799579) Full Text: DOI
Guo, Lianhong; Li, Yuanfei Blow-up phenomena for higher-dimensional nonlinear divergence form parabolic equations under nonlinear boundary flux. (Chinese. English summary) Zbl 07796202 Acta Math. Appl. Sin. 44, No. 5, 678-689 (2021). MSC: 35B44 35K10 35K20 35K55 PDFBibTeX XMLCite \textit{L. Guo} and \textit{Y. Li}, Acta Math. Appl. Sin. 44, No. 5, 678--689 (2021; Zbl 07796202) Full Text: Link
Le Gall, François; Miyamoto, Masayuki Lower bounds for induced cycle detection in distributed computing. (English) Zbl 07788631 Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 58, 19 p. (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{F. Le Gall} and \textit{M. Miyamoto}, LIPIcs -- Leibniz Int. Proc. Inform. 212, Article 58, 19 p. (2021; Zbl 07788631) Full Text: DOI arXiv
Canonne, Clément L.; Wimmer, Karl Identity testing under label mismatch. (English) Zbl 07788628 Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 55, 17 p. (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{C. L. Canonne} and \textit{K. Wimmer}, LIPIcs -- Leibniz Int. Proc. Inform. 212, Article 55, 17 p. (2021; Zbl 07788628) Full Text: DOI arXiv
Chen, Jianer; Huang, Qin; Kanj, Iyad; Li, Qian; Xia, Ge Streaming algorithms for graph \(k\)-matching with optimal or near-optimal update time. (English) Zbl 07788621 Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 48, 17 p. (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{J. Chen} et al., LIPIcs -- Leibniz Int. Proc. Inform. 212, Article 48, 17 p. (2021; Zbl 07788621) Full Text: DOI arXiv
Schnider, Patrick The complexity of sharing a pizza. (English) Zbl 07788586 Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 13, 15 p. (2021). MSC: 68Q25 68Q17 68U05 91B32 PDFBibTeX XMLCite \textit{P. Schnider}, LIPIcs -- Leibniz Int. Proc. Inform. 212, Article 13, 15 p. (2021; Zbl 07788586) Full Text: DOI
Marciano, Carlos E.; Arantes, Gladstone M. jun.; Lucena, Abilio; Simonetti, Luidi G.; Faria, Luerbio; França, Felipe M. G. Optimizing concurrency under scheduling by edge reversal. (English) Zbl 07775307 Networks 77, No. 4, 520-537 (2021). MSC: 68R10 68Q17 68Q85 68W25 PDFBibTeX XMLCite \textit{C. E. Marciano} et al., Networks 77, No. 4, 520--537 (2021; Zbl 07775307) Full Text: DOI
Goren, Guy; Moses, Yoram; Spiegelman, Alexander Brief announcement: probabilistic indistinguishability and the quality of validity in Byzantine agreement. (English) Zbl 07774308 Gilbert, Seth (ed.), 35th international symposium on distributed computing, DISC 2021, Freiburg, Germany (virtual conference) October 4–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 209, Article 57, 4 p. (2021). MSC: 68M14 68W15 PDFBibTeX XMLCite \textit{G. Goren} et al., LIPIcs -- Leibniz Int. Proc. Inform. 209, Article 57, 4 p. (2021; Zbl 07774308) Full Text: DOI arXiv
Sheng, Yilun; Ellen, Faith Extension-based proofs for synchronous message passing. (English) Zbl 07774287 Gilbert, Seth (ed.), 35th international symposium on distributed computing, DISC 2021, Freiburg, Germany (virtual conference) October 4–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 209, Article 36, 17 p. (2021). MSC: 68M14 68W15 PDFBibTeX XMLCite \textit{Y. Sheng} and \textit{F. Ellen}, LIPIcs -- Leibniz Int. Proc. Inform. 209, Article 36, 17 p. (2021; Zbl 07774287) Full Text: DOI
Assadi, Sepehr; Dudeja, Aditi Ruling sets in random order and adversarial streams. (English) Zbl 07774257 Gilbert, Seth (ed.), 35th international symposium on distributed computing, DISC 2021, Freiburg, Germany (virtual conference) October 4–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 209, Article 6, 18 p. (2021). MSC: 68M14 68W15 PDFBibTeX XMLCite \textit{S. Assadi} and \textit{A. Dudeja}, LIPIcs -- Leibniz Int. Proc. Inform. 209, Article 6, 18 p. (2021; Zbl 07774257) Full Text: DOI
Alistarh, Dan; Gelashvili, Rati; Nadiradze, Giorgi Lower bounds for shared-memory leader election under bounded write contention. (English) Zbl 07774255 Gilbert, Seth (ed.), 35th international symposium on distributed computing, DISC 2021, Freiburg, Germany (virtual conference) October 4–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 209, Article 4, 17 p. (2021). MSC: 68M14 68W15 PDFBibTeX XMLCite \textit{D. Alistarh} et al., LIPIcs -- Leibniz Int. Proc. Inform. 209, Article 4, 17 p. (2021; Zbl 07774255) Full Text: DOI arXiv
Konrad, Christian; Naidu, Kheeran K. On two-pass streaming algorithms for maximum bipartite matching. (English) Zbl 07768364 Wootters, Mary (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 24th international conference, APPROX 2021, and 25th international conference, RANDOM 2021, University of Washington, Seattle, Washington, US (virtual conference), August 16–18, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 207, Article 19, 18 p. (2021). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{C. Konrad} and \textit{K. K. Naidu}, LIPIcs -- Leibniz Int. Proc. Inform. 207, Article 19, 18 p. (2021; Zbl 07768364) Full Text: DOI arXiv
Daskalakis, Constantinos; Skoulakis, Stratis; Zampetakis, Manolis The complexity of constrained min-max optimization. (English) Zbl 07765262 Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 1466-1478 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{C. Daskalakis} et al., in: Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC '21, virtual, Italy, June 21--25, 2021. New York, NY: Association for Computing Machinery (ACM). 1466--1478 (2021; Zbl 07765262) Full Text: DOI arXiv
Haeupler, Bernhard; Wajc, David; Zuzic, Goran Universally-optimal distributed algorithms for known topologies. (English) Zbl 07765240 Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 1166-1179 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{B. Haeupler} et al., in: Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC '21, virtual, Italy, June 21--25, 2021. New York, NY: Association for Computing Machinery (ACM). 1166--1179 (2021; Zbl 07765240) Full Text: DOI arXiv
Cheu, Albert; Ullman, Jonathan The limits of pan privacy and shuffle privacy for learning and estimation. (English) Zbl 07765233 Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 1081-1094 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Cheu} and \textit{J. Ullman}, in: Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC '21, virtual, Italy, June 21--25, 2021. New York, NY: Association for Computing Machinery (ACM). 1081--1094 (2021; Zbl 07765233) Full Text: DOI arXiv
Chattopadhyay, Arkadev; Datta, Rajit; Mukhopadhyay, Partha Lower bounds for monotone arithmetic circuits via communication complexity. (English) Zbl 07765210 Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 786-799 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Chattopadhyay} et al., in: Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC '21, virtual, Italy, June 21--25, 2021. New York, NY: Association for Computing Machinery (ACM). 786--799 (2021; Zbl 07765210) Full Text: DOI
Chen, Lijie; Kol, Gillat; Paramonov, Dmitry; Saxena, Raghuvansh R.; Song, Zhao; Yu, Huacheng Almost optimal super-constant-pass streaming lower bounds for reachability. (English) Zbl 07765194 Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 570-583 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{L. Chen} et al., in: Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC '21, virtual, Italy, June 21--25, 2021. New York, NY: Association for Computing Machinery (ACM). 570--583 (2021; Zbl 07765194) Full Text: DOI
Chen, Lijie; Tell, Roei Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost. (English) Zbl 07765171 Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 283-291 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{L. Chen} and \textit{R. Tell}, in: Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC '21, virtual, Italy, June 21--25, 2021. New York, NY: Association for Computing Machinery (ACM). 283--291 (2021; Zbl 07765171) Full Text: DOI
Santhanam, Rahul; Tzameret, Iddo Iterated lower bound formulas: a diagonalization-based approach to proof complexity. (English) Zbl 07765167 Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 234-247 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{R. Santhanam} and \textit{I. Tzameret}, in: Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC '21, virtual, Italy, June 21--25, 2021. New York, NY: Association for Computing Machinery (ACM). 234--247 (2021; Zbl 07765167) Full Text: DOI
de Rezende, Susanna F.; Göös, Mika; Nordström, Jakob; Pitassi, Toniann; Robere, Robert; Sokolov, Dmitry Automating algebraic proof systems is NP-hard. (English) Zbl 07765165 Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 209-222 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. F. de Rezende} et al., in: Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC '21, virtual, Italy, June 21--25, 2021. New York, NY: Association for Computing Machinery (ACM). 209--222 (2021; Zbl 07765165) Full Text: DOI
Korotyaev, Evgeny L. Eigenvalues of Schrödinger operators on finite and infinite intervals. (English) Zbl 1525.34122 Math. Nachr. 294, No. 11, 2188-2199 (2021). MSC: 34L15 34B24 34L40 PDFBibTeX XMLCite \textit{E. L. Korotyaev}, Math. Nachr. 294, No. 11, 2188--2199 (2021; Zbl 1525.34122) Full Text: DOI arXiv
Daneshpajouh, Hamid Reza; Meunier, Frédéric; Mizrahi, Guilhem Colorings of complements of line graphs. (English) Zbl 1522.05106 J. Graph Theory 98, No. 2, 216-233 (2021). MSC: 05C15 05C76 68Q17 PDFBibTeX XMLCite \textit{H. R. Daneshpajouh} et al., J. Graph Theory 98, No. 2, 216--233 (2021; Zbl 1522.05106) Full Text: DOI arXiv
Bulteau, Laurent; Fertin, Guillaume; Labarre, Anthony; Rizzi, Romeo; Rusu, Irena Decomposing subcubic graphs into claws, paths or triangles. (English) Zbl 1522.05365 J. Graph Theory 98, No. 4, 557-588 (2021). MSC: 05C70 68Q17 PDFBibTeX XMLCite \textit{L. Bulteau} et al., J. Graph Theory 98, No. 4, 557--588 (2021; Zbl 1522.05365) Full Text: DOI
Dvořák, Pavel; Koucký, Michal; Král, Karel; Slívová, Veronika Data structures lower bounds and popular conjectures. (English) Zbl 07740894 Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 39, 15 p. (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{P. Dvořák} et al., LIPIcs -- Leibniz Int. Proc. Inform. 204, Article 39, 15 p. (2021; Zbl 07740894) Full Text: DOI arXiv
Cygan, Marek; Kulikov, Alexander S.; Mihajlin, Ivan; Nikolaev, Maksim; Reznikov, Grigory Minimum common string partition: exact algorithms. (English) Zbl 07740890 Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 35, 16 p. (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{M. Cygan} et al., LIPIcs -- Leibniz Int. Proc. Inform. 204, Article 35, 16 p. (2021; Zbl 07740890) Full Text: DOI
Sharma, Amit; Venkata Subba Reddy, P. Algorithmic aspects of outer-independent total Roman domination in graphs. (English) Zbl 1522.68424 Int. J. Found. Comput. Sci. 32, No. 3, 331-339 (2021). MSC: 68R10 05C69 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. Sharma} and \textit{P. Venkata Subba Reddy}, Int. J. Found. Comput. Sci. 32, No. 3, 331--339 (2021; Zbl 1522.68424) Full Text: DOI
Gawrychowski, Paweł; Manea, Florin; Siemer, Stefan Matching patterns with variables under Hamming distance. (English) Zbl 07724221 Bonchi, Filippo (ed.) et al., 46th international symposium on mathematical foundations of computer science, MFCS 2021, August 23–27, 2021, Tallinn, Estonia. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 202, Article 48, 24 p. (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Gawrychowski} et al., LIPIcs -- Leibniz Int. Proc. Inform. 202, Article 48, 24 p. (2021; Zbl 07724221) Full Text: DOI arXiv
Chapman, Brynmor K.; Williams, R. Ryan Black-box hypotheses and lower bounds. (English) Zbl 07724202 Bonchi, Filippo (ed.) et al., 46th international symposium on mathematical foundations of computer science, MFCS 2021, August 23–27, 2021, Tallinn, Estonia. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 202, Article 29, 22 p. (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{B. K. Chapman} and \textit{R. R. Williams}, LIPIcs -- Leibniz Int. Proc. Inform. 202, Article 29, 22 p. (2021; Zbl 07724202) Full Text: DOI
Kothari, Pravesh K.; Manohar, Peter A stress-free sum-of-squares lower bound for coloring. (English) Zbl 07711605 Kabanets, Valentine (ed.), 36th computational complexity conference, CCC 2021, Toronto, Ontario, Canada, virtual conference, July 20–23, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 200, Article 23, 21 p. (2021). MSC: 68Q25 PDFBibTeX XMLCite \textit{P. K. Kothari} and \textit{P. Manohar}, LIPIcs -- Leibniz Int. Proc. Inform. 200, Article 23, 21 p. (2021; Zbl 07711605) Full Text: DOI arXiv
Sofronova, Anastasia; Sokolov, Dmitry Branching programs with bounded repetitions and flow formulas. (English) Zbl 07711599 Kabanets, Valentine (ed.), 36th computational complexity conference, CCC 2021, Toronto, Ontario, Canada, virtual conference, July 20–23, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 200, Article 17, 25 p. (2021). MSC: 68Q25 PDFBibTeX XMLCite \textit{A. Sofronova} and \textit{D. Sokolov}, LIPIcs -- Leibniz Int. Proc. Inform. 200, Article 17, 25 p. (2021; Zbl 07711599) Full Text: DOI
Kumar, Mrinal; Volk, Ben Lee A lower bound on determinantal complexity. (English) Zbl 07711586 Kabanets, Valentine (ed.), 36th computational complexity conference, CCC 2021, Toronto, Ontario, Canada, virtual conference, July 20–23, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 200, Article 4, 12 p. (2021). MSC: 68Q25 PDFBibTeX XMLCite \textit{M. Kumar} and \textit{B. L. Volk}, LIPIcs -- Leibniz Int. Proc. Inform. 200, Article 4, 12 p. (2021; Zbl 07711586) Full Text: DOI
Blocki, Jeremiah; Lee, Seunghoon; Zhou, Samson On the security of proofs of sequential work in a post-quantum world. (English) Zbl 1527.81039 Tessaro, Stefano (ed.), 2nd conference on information-theoretic cryptography. ITC 2021, July 23–26, 2021, virtual conference. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 199, Article 22, 27 p. (2021). MSC: 81P94 94A60 81Q93 PDFBibTeX XMLCite \textit{J. Blocki} et al., LIPIcs -- Leibniz Int. Proc. Inform. 199, Article 22, 27 p. (2021; Zbl 1527.81039) Full Text: DOI arXiv
Arnon, Gal; Rothblum, Guy N. On prover-efficient public-coin emulation of interactive proofs. (English) Zbl 1517.94056 Tessaro, Stefano (ed.), 2nd conference on information-theoretic cryptography. ITC 2021, July 23–26, 2021, virtual conference. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 199, Article 3, 15 p. (2021). MSC: 94A60 68Q17 PDFBibTeX XMLCite \textit{G. Arnon} and \textit{G. N. Rothblum}, LIPIcs -- Leibniz Int. Proc. Inform. 199, Article 3, 15 p. (2021; Zbl 1517.94056) Full Text: DOI
Damgård, Ivan Bjerre; Li, Boyang; Schwartzbach, Nikolaj Ignatieff More communication lower bounds for information-theoretic MPC. (English) Zbl 1517.94088 Tessaro, Stefano (ed.), 2nd conference on information-theoretic cryptography. ITC 2021, July 23–26, 2021, virtual conference. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 199, Article 2, 18 p. (2021). MSC: 94A60 68P25 68M14 PDFBibTeX XMLCite \textit{I. B. Damgård} et al., LIPIcs -- Leibniz Int. Proc. Inform. 199, Article 2, 18 p. (2021; Zbl 1517.94088) Full Text: DOI
Liu, Yupan StoqMA meets distribution testing. (English) Zbl 07701524 Hsieh, Min-Hsiu (ed.), 16th conference on the theory of quantum computation, communication and cryptography, virtual conference, TQC 2021, July 5–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 197, Article 4, 22 p. (2021). MSC: 81P68 68Q17 PDFBibTeX XMLCite \textit{Y. Liu}, LIPIcs -- Leibniz Int. Proc. Inform. 197, Article 4, 22 p. (2021; Zbl 07701524) Full Text: DOI arXiv
Banik, Subhadeep; Barooti, Khashayar; Vaudenay, Serge; Yan, Hailun New attacks on LowMC instances with a single plaintext/ciphertext pair. (English) Zbl 1514.94036 Tibouchi, Mehdi (ed.) et al., Advances in cryptology – ASIACRYPT 2021. 27th international conference on the theory and application of cryptology and information security, Singapore, December 6–10, 2021. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 13090, 303-331 (2021). MSC: 94A60 68P25 68Q17 PDFBibTeX XMLCite \textit{S. Banik} et al., Lect. Notes Comput. Sci. 13090, 303--331 (2021; Zbl 1514.94036) Full Text: DOI
Beznosikov, Aleksandr; Rogozin, Alexander; Kovalev, Dmitry; Gasnikov, Alexander Near-optimal decentralized algorithms for saddle point problems over time-varying networks. (English) Zbl 1527.90252 Olenev, Nicholas N. (ed.) et al., Optimization and applications. 12th international conference, OPTIMA 2021, Petrovac, Montenegro, September 27 – October 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13078, 246-257 (2021). MSC: 90C47 90B10 90C25 PDFBibTeX XMLCite \textit{A. Beznosikov} et al., Lect. Notes Comput. Sci. 13078, 246--257 (2021; Zbl 1527.90252) Full Text: DOI arXiv
Rich, Patricia; Blokpoel, Mark; de Haan, Ronald; Otworowska, Maria; Sweers, Marieke; Wareham, Todd; van Rooij, Iris Naturalism, tractability and the adaptive toolbox. (English) Zbl 1507.03064 Synthese 198, No. 6, 5749-5784 (2021). MSC: 03A10 68Q01 68Q17 PDFBibTeX XMLCite \textit{P. Rich} et al., Synthese 198, No. 6, 5749--5784 (2021; Zbl 1507.03064) Full Text: DOI
Han, Lu; Wu, Chenchen; Xu, Yicheng Approximate the lower-bounded connected facility location problem. (English) Zbl 07670487 Chen, Chi-Yeh (ed.) et al., Computing and combinatorics. 27th international conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13025, 487-498 (2021). MSC: 68Rxx PDFBibTeX XMLCite \textit{L. Han} et al., Lect. Notes Comput. Sci. 13025, 487--498 (2021; Zbl 07670487) Full Text: DOI
Gupta, Neelima; Grover, Sapna; Dabas, Rajni Respecting lower bounds in uniform lower and upper bounded facility location problem. (English) Zbl 07670485 Chen, Chi-Yeh (ed.) et al., Computing and combinatorics. 27th international conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13025, 463-475 (2021). MSC: 68Rxx PDFBibTeX XMLCite \textit{N. Gupta} et al., Lect. Notes Comput. Sci. 13025, 463--475 (2021; Zbl 07670485) Full Text: DOI
Dyer, Martin; Heinrich, Marc; Jerrum, Mark; Müller, Haiko Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs. (English) Zbl 1511.68343 Comb. Probab. Comput. 30, No. 6, 905-921 (2021). MSC: 68W25 05C76 68Q17 68W20 68W40 82B20 PDFBibTeX XMLCite \textit{M. Dyer} et al., Comb. Probab. Comput. 30, No. 6, 905--921 (2021; Zbl 1511.68343) Full Text: DOI arXiv
Pach, János; Tardos, Gábor; Tóth, Géza Disjointness graphs of segments in the space. (English) Zbl 1510.05083 Comb. Probab. Comput. 30, No. 4, 498-512 (2021). MSC: 05C15 05C62 05C85 68Q17 PDFBibTeX XMLCite \textit{J. Pach} et al., Comb. Probab. Comput. 30, No. 4, 498--512 (2021; Zbl 1510.05083) Full Text: DOI
Bürgisser, Peter (ed.); Dinur, Irit (ed.); Vadhan, Salil (ed.) Complexity theory. Abstracts from the workshop held November 14–20, 2021 (hybrid meeting). (English) Zbl 1506.00050 Oberwolfach Rep. 18, No. 4, 2955-3005 (2021). MSC: 00B05 00B25 68-06 68Q01 68Q17 68Q15 PDFBibTeX XMLCite \textit{P. Bürgisser} (ed.) et al., Oberwolfach Rep. 18, No. 4, 2955--3005 (2021; Zbl 1506.00050) Full Text: DOI
Shakiba, Ali Distributed decision making with S-approximation spaces. (English) Zbl 1504.68229 Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 29, No. 2, 281-311 (2021). MSC: 68T37 68Q17 68T35 91B06 PDFBibTeX XMLCite \textit{A. Shakiba}, Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 29, No. 2, 281--311 (2021; Zbl 1504.68229) Full Text: DOI
Gnatenko, A. R.; Zakharov, V. A. On the satisfiability and model checking for one parameterized extension of linear-time temporal logic. (Russian. English summary) Zbl 1517.68237 Model. Anal. Inf. Sist. 28, No. 4, 356-371 (2021). MSC: 68Q60 03B44 68Q17 68Q25 68Q45 PDFBibTeX XMLCite \textit{A. R. Gnatenko} and \textit{V. A. Zakharov}, Model. Anal. Inf. Sist. 28, No. 4, 356--371 (2021; Zbl 1517.68237) Full Text: DOI MNR
Smirnov, A. V. NP-completeness of the minimum spanning tree problem of a multiple graph of multiplicity \(k \geqslant 3\). (Russian. English summary) Zbl 1504.68077 Model. Anal. Inf. Sist. 28, No. 1, 22-37 (2021). MSC: 68Q17 68R10 PDFBibTeX XMLCite \textit{A. V. Smirnov}, Model. Anal. Inf. Sist. 28, No. 1, 22--37 (2021; Zbl 1504.68077) Full Text: DOI MNR
Függer, Matthias; Nowak, Thomas; Schwarz, Manfred Tight bounds for asymptotic and approximate consensus. (English) Zbl 1499.68034 J. ACM 68, No. 6, Paper No. 46, 35 p. (2021). MSC: 68M14 68M10 68M15 68Q17 68W15 PDFBibTeX XMLCite \textit{M. Függer} et al., J. ACM 68, No. 6, Paper No. 46, 35 p. (2021; Zbl 1499.68034) Full Text: DOI
Balliu, Alkida; Brandt, Sebastian; Hirvonen, Juho; Olivetti, Dennis; Rabie, Mikaël; Suomela, Jukka Lower bounds for maximal matchings and maximal independent sets. (English) Zbl 1499.68248 J. ACM 68, No. 5, Paper No. 39, 30 p. (2021). MSC: 68R10 05C69 05C70 68Q17 68W15 PDFBibTeX XMLCite \textit{A. Balliu} et al., J. ACM 68, No. 5, Paper No. 39, 30 p. (2021; Zbl 1499.68248) Full Text: DOI arXiv
Gottlob, Georg; Lanzinger, Matthias; Pichler, Reinhard; Razgon, Igor Complexity analysis of generalized and fractional hypertree decompositions. (English) Zbl 1499.68272 J. ACM 68, No. 5, Paper No. 38, 50 p. (2021). MSC: 68R10 05C65 68Q17 PDFBibTeX XMLCite \textit{G. Gottlob} et al., J. ACM 68, No. 5, Paper No. 38, 50 p. (2021; Zbl 1499.68272) Full Text: DOI arXiv
Blondin, Michael; Englert, Matthias; Finkel, Alain; Göller, Stefan; Haase, Christoph; Lazić, Ranko; Mckenzie, Pierre; Totzke, Patrick The reachability problem for two-dimensional vector addition systems with states. (English) Zbl 1499.68219 J. ACM 68, No. 5, Paper No. 34, 43 p. (2021). MSC: 68Q85 68Q17 PDFBibTeX XMLCite \textit{M. Blondin} et al., J. ACM 68, No. 5, Paper No. 34, 43 p. (2021; Zbl 1499.68219) Full Text: DOI
Cohen-Addad, Vincent; de Verdière, Éric Colin; Marx, Dániel; de Mesmay, Arnaud Almost tight lower bounds for hard cutting problems in embedded graphs. (English) Zbl 1499.68264 J. ACM 68, No. 4, Paper No. 30, 26 p. (2021). MSC: 68R10 05C10 68Q17 68Q27 PDFBibTeX XMLCite \textit{V. Cohen-Addad} et al., J. ACM 68, No. 4, Paper No. 30, 26 p. (2021; Zbl 1499.68264) Full Text: DOI
Barto, Libor; Bulín, Jakub; Krokhin, Andrei; Opršal, Jakub Algebraic approach to promise constraint satisfaction. (English) Zbl 1499.68140 J. ACM 68, No. 4, Paper No. 28, 66 p. (2021). MSC: 68Q25 05C15 08A70 68Q17 PDFBibTeX XMLCite \textit{L. Barto} et al., J. ACM 68, No. 4, Paper No. 28, 66 p. (2021; Zbl 1499.68140) Full Text: DOI
Atserias, Albert; Bonacina, Ilario; De Rezende, Susanna F.; Lauria, Massimo; Nordström, Jakob; Razborov, Alexander Clique is hard on average for regular resolution. (English) Zbl 1499.68129 J. ACM 68, No. 4, Paper No. 23, 26 p. (2021). MSC: 68Q17 03F20 05C69 05C80 68W40 PDFBibTeX XMLCite \textit{A. Atserias} et al., J. ACM 68, No. 4, Paper No. 23, 26 p. (2021; Zbl 1499.68129) Full Text: DOI
Buss, Sam; Itsykson, Dmitry; Knop, Alexander; Riazanov, Artur; Sokolov, Dmitry Lower bounds on OBDD proofs with several orders. (English) Zbl 1505.03127 ACM Trans. Comput. Log. 22, No. 4, Article No. 26, 30 p. (2021). MSC: 03F20 68Q11 PDFBibTeX XMLCite \textit{S. Buss} et al., ACM Trans. Comput. Log. 22, No. 4, Article No. 26, 30 p. (2021; Zbl 1505.03127) Full Text: DOI
Hertling, Peter; Krommes, Gisela EXPSPACE-completeness of the logics \(K4 \times S5\) and \(S4 \times S5\) and the logic of subset spaces. (English) Zbl 1505.03053 ACM Trans. Comput. Log. 22, No. 4, Article No. 24, 71 p. (2021). MSC: 03B45 68Q17 68Q25 PDFBibTeX XMLCite \textit{P. Hertling} and \textit{G. Krommes}, ACM Trans. Comput. Log. 22, No. 4, Article No. 24, 71 p. (2021; Zbl 1505.03053) Full Text: DOI
Arenas, Marcelo; Barceló, Pablo; Monet, Mikaël The complexity of counting problems over incomplete databases. (English) Zbl 1508.68083 ACM Trans. Comput. Log. 22, No. 4, Article No. 21, 52 p. (2021). MSC: 68P15 68Q17 68Q25 PDFBibTeX XMLCite \textit{M. Arenas} et al., ACM Trans. Comput. Log. 22, No. 4, Article No. 21, 52 p. (2021; Zbl 1508.68083) Full Text: DOI arXiv
Bartlett, Peter L.; Long, Philip M. Failures of model-dependent generalization bounds for least-norm interpolation. (English) Zbl 07626719 J. Mach. Learn. Res. 22, Paper No. 204, 15 p. (2021). MSC: 68T05 PDFBibTeX XMLCite \textit{P. L. Bartlett} and \textit{P. M. Long}, J. Mach. Learn. Res. 22, Paper No. 204, 15 p. (2021; Zbl 07626719) Full Text: arXiv Link
Fang, Mingjuan; Yang, Ying; Tang, Ming Residual-type a posteriori error estimates for steady-state Poisson-Nernst-Planck equations. (Chinese. English summary) Zbl 1513.65462 Math. Numer. Sin. 43, No. 1, 17-32 (2021). MSC: 65N30 65N15 65N50 35Q82 PDFBibTeX XMLCite \textit{M. Fang} et al., Math. Numer. Sin. 43, No. 1, 17--32 (2021; Zbl 1513.65462) Full Text: DOI
Ficara, Annamaria; Saitta, Rebecca; Fiumara, Giacomo; De Meo, Pasquale; Liotta, Antonio Game of thieves and WERW-Kpath: two novel measures of node and edge centrality for mafia networks. (English) Zbl 1504.91213 Teixeira, Andreia Sofia (ed.) et al., Complex networks XII. Proceedings of the 12th conference on complex networks CompleNet 2021, May 24–26, 2021. Cham: Springer. Springer Proc. Complex., 12-23 (2021). MSC: 91D30 68Q17 PDFBibTeX XMLCite \textit{A. Ficara} et al., in: Complex networks XII. Proceedings of the 12th conference on complex networks CompleNet 2021, May 24--26, 2021. Cham: Springer. 12--23 (2021; Zbl 1504.91213) Full Text: DOI
Huseynov, Hidayat M.; Abbasova, Khatira E. On the completeness of the system of Weber functions. (English) Zbl 1513.34355 Trans. Natl. Acad. Sci. Azerb., Ser. Phys.-Tech. Math. Sci. 41, No. 4, Math., 78-82 (2021). MSC: 34L40 34B09 34L15 PDFBibTeX XMLCite \textit{H. M. Huseynov} and \textit{K. E. Abbasova}, Trans. Natl. Acad. Sci. Azerb., Ser. Phys.-Tech. Math. Sci. 41, No. 4, Math., 78--82 (2021; Zbl 1513.34355) Full Text: Link
Hadiyeva, Sevinj S. Some spectral properties of Sturm-Liouville problem with a spectral parameter in the boundary conditions. (English) Zbl 1513.34121 Trans. Natl. Acad. Sci. Azerb., Ser. Phys.-Tech. Math. Sci. 41, No. 4, Math., 60-68 (2021). MSC: 34B24 34L10 34B07 34L15 34L20 PDFBibTeX XMLCite \textit{S. S. Hadiyeva}, Trans. Natl. Acad. Sci. Azerb., Ser. Phys.-Tech. Math. Sci. 41, No. 4, Math., 60--68 (2021; Zbl 1513.34121) Full Text: Link
Caminata, Alessio; Gorla, Elisa The complexity of MinRank. (English) Zbl 1504.94111 Cojocaru, Alina Carmen (ed.) et al., Women in numbers Europe III. Research directions in number theory. Selected papers based on the presentations at the 3rd conference, WINE 3, La Hublais, Center in Cesson-Sévigné, Bretagne, France, August 26–30, 2019. Cham: Springer. Assoc. Women Math. Ser. 24, 163-169 (2021). MSC: 94A60 13P10 13P15 14G50 13P25 68Q17 PDFBibTeX XMLCite \textit{A. Caminata} and \textit{E. Gorla}, Assoc. Women Math. Ser. 24, 163--169 (2021; Zbl 1504.94111) Full Text: DOI arXiv
Uğurlu, Ekin; Tas, Kenan Dependence of eigenvalues of some boundary value problems. (English) Zbl 1498.34074 Appl. Math. E-Notes 21, 81-88 (2021). MSC: 34B09 34L15 34L40 PDFBibTeX XMLCite \textit{E. Uğurlu} and \textit{K. Tas}, Appl. Math. E-Notes 21, 81--88 (2021; Zbl 1498.34074) Full Text: Link
Berman, Abraham; Borer, Franziska; Hungerbühler, Norbert Lights Out on graphs. (English) Zbl 1502.05162 Math. Semesterber. 68, No. 2, 237-255 (2021). Reviewer: V. Yegnanarayanan (Chennai) MSC: 05C57 15A99 15B33 68Q17 91A43 PDFBibTeX XMLCite \textit{A. Berman} et al., Math. Semesterber. 68, No. 2, 237--255 (2021; Zbl 1502.05162) Full Text: DOI arXiv
Song, Xi; Chen, Qin Semitotal bondage numbers of graphs. (Chinese. English summary) Zbl 1513.05298 Adv. Math., Beijing 50, No. 6, 877-886 (2021). MSC: 05C69 68Q17 PDFBibTeX XMLCite \textit{X. Song} and \textit{Q. Chen}, Adv. Math., Beijing 50, No. 6, 877--886 (2021; Zbl 1513.05298) Full Text: DOI
Grüttemeier, Niels; Komusiewicz, Christian; Schestag, Jannik; Sommer, Frank Destroying bicolored \(P_3\)s by deleting few edges. (English) Zbl 1498.05097 Discrete Math. Theor. Comput. Sci. 23, No. 1, Paper No. 14, 25 p. (2021). MSC: 05C15 05C75 05C85 68Q17 PDFBibTeX XMLCite \textit{N. Grüttemeier} et al., Discrete Math. Theor. Comput. Sci. 23, No. 1, Paper No. 14, 25 p. (2021; Zbl 1498.05097) Full Text: DOI Link
Hellmuth, Marc; Seemann, Carsten R.; Stadler, Peter F. Generalized Fitch graphs. III: Symmetrized Fitch maps and sets of symmetric binary relations that are explained by unrooted edge-labeled trees. (English) Zbl 1498.05058 Discrete Math. Theor. Comput. Sci. 23, No. 1, Paper No. 13, 20 p. (2021). MSC: 05C05 05C78 05C85 68Q17 92D10 PDFBibTeX XMLCite \textit{M. Hellmuth} et al., Discrete Math. Theor. Comput. Sci. 23, No. 1, Paper No. 13, 20 p. (2021; Zbl 1498.05058) Full Text: DOI arXiv Link
Liu, Xiaoyun; Shi, Guoliang; Yan, Jun Dependence of the eigenvalue \(\lambda_{n,r}\) of self-adjoint vectorial Sturm-Liouville problems. (Chinese. English summary) Zbl 1513.34122 Chin. Ann. Math., Ser. A 42, No. 3, 289-304 (2021). MSC: 34B24 34L15 34L10 34C10 34B08 PDFBibTeX XMLCite \textit{X. Liu} et al., Chin. Ann. Math., Ser. A 42, No. 3, 289--304 (2021; Zbl 1513.34122) Full Text: DOI
Chillara, Suryajith On computing multilinear polynomials using multi-\(r\)-ic depth four circuits. (English) Zbl 1495.68061 ACM Trans. Comput. Theory 13, No. 3, Paper No. 16, 21 p. (2021). MSC: 68Q06 PDFBibTeX XMLCite \textit{S. Chillara}, ACM Trans. Comput. Theory 13, No. 3, Paper No. 16, 21 p. (2021; Zbl 1495.68061) Full Text: DOI
Aktaş, Mustafa Fahri On Lyapunov-type inequalities for \((n+1)\)st order nonlinear differential equations with the anti-periodic boundary conditions. (English) Zbl 1493.34065 Turk. J. Math. 45, No. 6, 2614-2622 (2021). MSC: 34B15 34C10 34L15 PDFBibTeX XMLCite \textit{M. F. Aktaş}, Turk. J. Math. 45, No. 6, 2614--2622 (2021; Zbl 1493.34065) Full Text: DOI
Aliyev, Ziyatkhan S.; Mehraliyev, Yashar T.; Yusifova, Elmira H. On some nonlocal inverse boundary problem for partial differential equations of third order. (English) Zbl 1493.34055 Turk. J. Math. 45, No. 4, 1871-1886 (2021). MSC: 34B09 34B27 34L15 35G31 35J40 35R30 PDFBibTeX XMLCite \textit{Z. S. Aliyev} et al., Turk. J. Math. 45, No. 4, 1871--1886 (2021; Zbl 1493.34055) Full Text: DOI
Çetinkaya, Fatma Ayça; Golmankaneh, Alireza Khalili General characteristics of a fractal Sturm-Liouville problem. (English) Zbl 1515.34032 Turk. J. Math. 45, No. 4, 1835-1846 (2021). MSC: 34B24 34A08 28A80 34L15 34L10 PDFBibTeX XMLCite \textit{F. A. Çetinkaya} and \textit{A. K. Golmankaneh}, Turk. J. Math. 45, No. 4, 1835--1846 (2021; Zbl 1515.34032) Full Text: DOI
Houlari, Tahereh; Dehghan, Mohammad; Biazar, Jafar; Nouri, Alireza Theory and numerical approaches of high order fractional Sturm-Liouville problems. (English) Zbl 07578305 Turk. J. Math. 45, No. 4, 1564-1579 (2021). MSC: 34B24 34A08 34L15 34L16 PDFBibTeX XMLCite \textit{T. Houlari} et al., Turk. J. Math. 45, No. 4, 1564--1579 (2021; Zbl 07578305) Full Text: DOI
Zhao, Yingchun; Sun, Jiong; Yao, Siqin; Burenmandula Non-real eigenvalues of a class of indefinite Sturm-Liouville operators with discontinuity at interior points. (Chinese. English summary) Zbl 1513.34125 Acta Math. Sci., Ser. A, Chin. Ed. 41, No. 6, 1643-1656 (2021). MSC: 34B24 34L15 34A36 PDFBibTeX XMLCite \textit{Y. Zhao} et al., Acta Math. Sci., Ser. A, Chin. Ed. 41, No. 6, 1643--1656 (2021; Zbl 1513.34125) Full Text: Link
Arya, Alka; Singh, Sanjeet Development of two-stage parallel-series system with fuzzy data: a fuzzy DEA approach. (English) Zbl 1491.90091 Soft Comput. 25, No. 4, 3225-3245 (2021). MSC: 90B50 90C70 91G05 PDFBibTeX XMLCite \textit{A. Arya} and \textit{S. Singh}, Soft Comput. 25, No. 4, 3225--3245 (2021; Zbl 1491.90091) Full Text: DOI
Song, Bosheng; Zeng, Xiangxiang Solving a PSPACE-complete problem by symport/antiport P systems with promoters and membrane division. (English) Zbl 1490.68102 J. Membr. Comput. 3, No. 4, 296-302 (2021). MSC: 68Q07 68Q17 68Q25 PDFBibTeX XMLCite \textit{B. Song} and \textit{X. Zeng}, J. Membr. Comput. 3, No. 4, 296--302 (2021; Zbl 1490.68102) Full Text: DOI
Gazdag, Zsolt; Hajagos, Károly; Iván, Szabolcs On the power of P systems with active membranes using weak non-elementary membrane division. (English) Zbl 1490.68098 J. Membr. Comput. 3, No. 4, 258-269 (2021). MSC: 68Q07 68Q17 68Q25 PDFBibTeX XMLCite \textit{Z. Gazdag} et al., J. Membr. Comput. 3, No. 4, 258--269 (2021; Zbl 1490.68098) Full Text: DOI
Silva, Janio Carlos Nascimento; Souza, Uéverton S.; Ochi, Luiz Satoru Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case. (English) Zbl 1498.68107 Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 380-391 (2021). MSC: 68Q06 68Q17 68Q27 PDFBibTeX XMLCite \textit{J. C. N. Silva} et al., Lect. Notes Comput. Sci. 13153, 380--391 (2021; Zbl 1498.68107) Full Text: DOI
Hong, Yi; Luo, Chuanwen; Chen, Zhibo; Wang, Xiyun; Li, Xiao Maximizing energy efficiency for charger scheduling of WRSNs. (English) Zbl 1498.68039 Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 111-122 (2021). MSC: 68M18 68M20 68Q17 68R10 68W05 90C27 PDFBibTeX XMLCite \textit{Y. Hong} et al., Lect. Notes Comput. Sci. 13153, 111--122 (2021; Zbl 1498.68039) Full Text: DOI
Lu, Lingfa; Zhang, Liqi; Ou, Jinwen Single machine scheduling with rejection to minimize the weighted makespan. (English) Zbl 1498.90092 Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 96-110 (2021). MSC: 90B35 68Q17 68W25 90C39 PDFBibTeX XMLCite \textit{L. Lu} et al., Lect. Notes Comput. Sci. 13153, 96--110 (2021; Zbl 1498.90092) Full Text: DOI
Harutyunyan, Hovhannes A.; Li, Zhiyuan The complexity of finding a broadcast center. (English) Zbl 1498.68204 Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 57-70 (2021). MSC: 68R10 68Q17 90B18 90C35 PDFBibTeX XMLCite \textit{H. A. Harutyunyan} and \textit{Z. Li}, Lect. Notes Comput. Sci. 13153, 57--70 (2021; Zbl 1498.68204) Full Text: DOI
Evans, William; Gethner, Ellen; Spalding-Jamieson, Jack; Wolff, Alexander Angle covers: algorithms and complexity. (English) Zbl 1489.05144 J. Graph Algorithms Appl. 25, No. 2, 643-661 (2021). MSC: 05C85 68Q17 PDFBibTeX XMLCite \textit{W. Evans} et al., J. Graph Algorithms Appl. 25, No. 2, 643--661 (2021; Zbl 1489.05144) Full Text: DOI
Angelini, Patrizio; Rutter, Ignaz; Sandhya, T. P. Extending partial orthogonal drawings. (English) Zbl 1489.05135 J. Graph Algorithms Appl. 25, No. 1, 581-602 (2021). MSC: 05C85 05C10 68Q17 PDFBibTeX XMLCite \textit{P. Angelini} et al., J. Graph Algorithms Appl. 25, No. 1, 581--602 (2021; Zbl 1489.05135) Full Text: DOI
Figiel, Aleksander; Himmel, Anne-Sophie; Nichterlein, André; Niedermeier, Rolf On 2-clubs in graph-based data clustering: theory and algorithm engineering. (English) Zbl 1489.05145 J. Graph Algorithms Appl. 25, No. 1, 521-547 (2021). MSC: 05C85 68Q17 PDFBibTeX XMLCite \textit{A. Figiel} et al., J. Graph Algorithms Appl. 25, No. 1, 521--547 (2021; Zbl 1489.05145) Full Text: DOI arXiv
Hertz, Alain Decycling bipartite graphs. (English) Zbl 1489.05147 J. Graph Algorithms Appl. 25, No. 1, 461-480 (2021). MSC: 05C85 05C38 68Q17 PDFBibTeX XMLCite \textit{A. Hertz}, J. Graph Algorithms Appl. 25, No. 1, 461--480 (2021; Zbl 1489.05147) Full Text: DOI
Bentert, Matthias; Weller, Mathias Tree containment with soft polytomies. (English) Zbl 1489.05136 J. Graph Algorithms Appl. 25, No. 1, 417-436 (2021). MSC: 05C85 68Q17 PDFBibTeX XMLCite \textit{M. Bentert} and \textit{M. Weller}, J. Graph Algorithms Appl. 25, No. 1, 417--436 (2021; Zbl 1489.05136) Full Text: DOI
Juedes, David W.; Jones, Jeffrey S. A generic framework for approximation analysis of greedy algorithms for star bicoloring. (English) Zbl 1490.68300 Optim. Methods Softw. 36, No. 4, 869-890 (2021). MSC: 68W25 05C15 68Q17 68R10 68W40 PDFBibTeX XMLCite \textit{D. W. Juedes} and \textit{J. S. Jones}, Optim. Methods Softw. 36, No. 4, 869--890 (2021; Zbl 1490.68300) Full Text: DOI
Könemann, Jochen; Toth, Justin; Zhou, Felix On the complexity of nucleolus computation for bipartite \(b\)-matching games. (English) Zbl 1492.91032 Caragiannis, Ioannis (ed.) et al., Algorithmic game theory. 14th international symposium, SAGT 2021, Aarhus, Denmark, September 21–24, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12885, 171-185 (2021). MSC: 91A12 91A43 91A68 68Q17 PDFBibTeX XMLCite \textit{J. Könemann} et al., Lect. Notes Comput. Sci. 12885, 171--185 (2021; Zbl 1492.91032) Full Text: DOI arXiv
Gupta, Sushmita; Jain, Pallavi; Panolan, Fahad; Roy, Sanjukta; Saurabh, Saket Gerrymandering on graphs: computational complexity and parameterized algorithms. (English) Zbl 1491.91101 Caragiannis, Ioannis (ed.) et al., Algorithmic game theory. 14th international symposium, SAGT 2021, Aarhus, Denmark, September 21–24, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12885, 140-155 (2021). MSC: 91F10 91B12 91A68 68Q17 PDFBibTeX XMLCite \textit{S. Gupta} et al., Lect. Notes Comput. Sci. 12885, 140--155 (2021; Zbl 1491.91101) Full Text: DOI arXiv
Pişkin, Erhan; Yavuz, Dinç; Cemil, Tunç Lower and upper bounds for the blow up time for generalized heat equations with variable exponents. (English) Zbl 1490.35054 Palest. J. Math. 10, No. 2, 601-608 (2021). MSC: 35B44 35K51 35K92 PDFBibTeX XMLCite \textit{E. Pişkin} et al., Palest. J. Math. 10, No. 2, 601--608 (2021; Zbl 1490.35054) Full Text: Link
Massah, Maralani Elnaz; Dastmalchi, Saei Farhad; Akbarfam, Ali Asghar Jodayree; Ghanbari, Kazem Eigenvalues of fractional Sturm-Liouville problems by successive method. (English) Zbl 1513.34029 Comput. Methods Differ. Equ. 9, No. 4, 1163-1175 (2021). MSC: 34A08 34B24 34L15 34A45 33E12 PDFBibTeX XMLCite \textit{M. E. Massah} et al., Comput. Methods Differ. Equ. 9, No. 4, 1163--1175 (2021; Zbl 1513.34029) Full Text: DOI
Weerasena, Lakmali; Belinskiy, Boris P.; Hiestand, James W. Optimal effectiveness and efficiency of a fin in steady-state: multiobjective approach. (English) Zbl 1492.90167 Optim. Eng. 22, No. 2, 1157-1180 (2021). MSC: 90C29 34B24 74P99 34L15 PDFBibTeX XMLCite \textit{L. Weerasena} et al., Optim. Eng. 22, No. 2, 1157--1180 (2021; Zbl 1492.90167) Full Text: DOI