Kol, Gillat; Raz, Ran; Tal, Avishay Time-space hardness of learning sparse parities. (English) Zbl 1370.68132 Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 1067-1080 (2017). MSC: 68Q25 68P05 68P25 68Q17 68T05 PDFBibTeX XMLCite \textit{G. Kol} et al., in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 1067--1080 (2017; Zbl 1370.68132) Full Text: DOI
Cevher, Volkan; Kapralov, Michael; Scarlett, Jonathan; Zandieh, Amir An adaptive sublinear-time block sparse Fourier transform. (English) Zbl 1372.65360 Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 702-715 (2017). MSC: 65T50 65Y20 PDFBibTeX XMLCite \textit{V. Cevher} et al., in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 702--715 (2017; Zbl 1372.65360) Full Text: DOI arXiv
Angel, Omer; Bubeck, Sébastien; Peres, Yuval; Wei, Fan Local max-cut in smoothed polynomial time. (English) Zbl 1369.68226 Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 429-437 (2017). MSC: 68Q25 68T20 91A10 PDFBibTeX XMLCite \textit{O. Angel} et al., in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 429--437 (2017; Zbl 1369.68226) Full Text: DOI arXiv
Calude, Cristian S.; Jain, Sanjay; Khoussainov, Bakhadyr; Li, Wei; Stephan, Frank Deciding parity games in quasipolynomial time. (English) Zbl 1369.68234 Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 252-263 (2017). MSC: 68Q25 91A43 PDFBibTeX XMLCite \textit{C. S. Calude} et al., in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 252--263 (2017; Zbl 1369.68234) Full Text: DOI
Curticapean, Radu; Dell, Holger; Marx, Dániel Homomorphisms are a good basis for counting small subgraphs. (English) Zbl 1369.05191 Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 210-223 (2017). MSC: 05C85 05C60 68Q17 68Q25 PDFBibTeX XMLCite \textit{R. Curticapean} et al., in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 210--223 (2017; Zbl 1369.05191) Full Text: DOI arXiv Link
Ohlberger, Mario Book review of: A. Quarteroni et al., Reduced basis methods for partial differential equations. An introduction. (English) Zbl 1369.00049 SIAM Rev. 59, No. 3, 690-692 (2017). MSC: 00A17 65Mxx 65Nxx 65-01 65Y20 80A20 80Mxx PDFBibTeX XMLCite \textit{M. Ohlberger}, SIAM Rev. 59, No. 3, 690--692 (2017; Zbl 1369.00049) Full Text: DOI
Gaspar, Francisco J.; Rodrigo, Carmen Multigrid waveform relaxation for the time-fractional heat equation. (English) Zbl 1371.65103 SIAM J. Sci. Comput. 39, No. 4, A1201-A1224 (2017). MSC: 65M55 35K05 35R11 65Y20 PDFBibTeX XMLCite \textit{F. J. Gaspar} and \textit{C. Rodrigo}, SIAM J. Sci. Comput. 39, No. 4, A1201--A1224 (2017; Zbl 1371.65103) Full Text: DOI arXiv
Li, Buyang; Liu, Jun; Xiao, Mingqing A new multigrid method for unconstrained parabolic optimal control problems. (English) Zbl 1370.65032 J. Comput. Appl. Math. 326, 358-373 (2017). MSC: 65K10 49J20 49M25 65Y20 PDFBibTeX XMLCite \textit{B. Li} et al., J. Comput. Appl. Math. 326, 358--373 (2017; Zbl 1370.65032) Full Text: DOI
Gao, Su; Ziegler, Caleb On polynomial-time relation reducibility. (English) Zbl 1425.03015 Notre Dame J. Formal Logic 58, No. 2, 271-285 (2017). Reviewer: Peter Kostolányi (Bratislava) MSC: 03D15 68Q15 PDFBibTeX XMLCite \textit{S. Gao} and \textit{C. Ziegler}, Notre Dame J. Formal Logic 58, No. 2, 271--285 (2017; Zbl 1425.03015) Full Text: DOI Link
Edirisinghe, Chanaka; Jeong, Jaehwan Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time. (English) Zbl 1387.90156 Math. Program. 164, No. 1-2 (A), 193-227 (2017). Reviewer: Radu Ioan Bot (Wien) MSC: 90C11 90C20 90C26 PDFBibTeX XMLCite \textit{C. Edirisinghe} and \textit{J. Jeong}, Math. Program. 164, No. 1--2 (A), 193--227 (2017; Zbl 1387.90156) Full Text: DOI
Grochow, Joshua A.; Qiao, Youming Algorithms for group isomorphism via group extensions and cohomology. (English) Zbl 1475.20001 SIAM J. Comput. 46, No. 4, 1153-1216 (2017). MSC: 20-08 68W30 68Q25 PDFBibTeX XMLCite \textit{J. A. Grochow} and \textit{Y. Qiao}, SIAM J. Comput. 46, No. 4, 1153--1216 (2017; Zbl 1475.20001) Full Text: DOI arXiv
Guo, Daniel X. On stability and convergence of semi-Lagrangian methods for the first-order time-dependent nonlinear partial differential equations in 1D. (English) Zbl 1365.76034 J. Comput. Appl. Math. 324, 72-84 (2017). MSC: 76D05 74H15 68Q25 65Y20 PDFBibTeX XMLCite \textit{D. X. Guo}, J. Comput. Appl. Math. 324, 72--84 (2017; Zbl 1365.76034) Full Text: DOI
Chitnis, Rajesh; Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Pranabendu; Ramanujan, M. S.; Saurabh, Saket Faster exact algorithms for some terminal set problems. (English) Zbl 1371.05283 J. Comput. Syst. Sci. 88, 195-207 (2017). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{R. Chitnis} et al., J. Comput. Syst. Sci. 88, 195--207 (2017; Zbl 1371.05283) Full Text: DOI Link
Steinberg, Florian Computational complexity theory for advanced function spaces in analysis. (English) Zbl 1370.46002 Darmstadt: TU Darmstadt, Fachbereich Mathematik (Diss.). vi, 132 p. (2017). MSC: 46-02 46E30 46E35 03D15 68Q15 PDFBibTeX XMLCite \textit{F. Steinberg}, Computational complexity theory for advanced function spaces in analysis. Darmstadt: TU Darmstadt, Fachbereich Mathematik (Diss.) (2017; Zbl 1370.46002) Full Text: Link Link
Dolgui, Alexander; Kovalyov, Mikhail Y.; Quilliot, Alain Knapsack problem with objective value gaps. (English) Zbl 1373.90127 Optim. Lett. 11, No. 1, 31-39 (2017). MSC: 90C27 PDFBibTeX XMLCite \textit{A. Dolgui} et al., Optim. Lett. 11, No. 1, 31--39 (2017; Zbl 1373.90127) Full Text: DOI HAL
Bellomo, N.; Brezzi, F. Mathematical models of self-propelled particles. (English) Zbl 1370.82034 Math. Models Methods Appl. Sci. 27, No. 6, 997-1004 (2017). MSC: 82C22 91D10 92D50 PDFBibTeX XMLCite \textit{N. Bellomo} and \textit{F. Brezzi}, Math. Models Methods Appl. Sci. 27, No. 6, 997--1004 (2017; Zbl 1370.82034) Full Text: DOI
Kuznetsov, Vitaly; Mohri, Mehryar Generalization bounds for non-stationary mixing processes. (English) Zbl 1412.68186 Mach. Learn. 106, No. 1, 93-117 (2017). MSC: 68T05 PDFBibTeX XMLCite \textit{V. Kuznetsov} and \textit{M. Mohri}, Mach. Learn. 106, No. 1, 93--117 (2017; Zbl 1412.68186) Full Text: DOI
Louridas, Panos Real-world algorithms. A beginner’s guide. (English) Zbl 1373.68004 Cambridge, MA: MIT Press (ISBN 978-0-262-03570-5/hbk; 978-0-262-33814-1/ebook). xvi, 509 p. (2017). Reviewer: Irina Ioana Mohorianu (Norwich) MSC: 68-01 05C85 68P05 68P10 68P25 68P30 68T05 68Wxx PDFBibTeX XMLCite \textit{P. Louridas}, Real-world algorithms. A beginner's guide. Cambridge, MA: MIT Press (2017; Zbl 1373.68004)
Kratsch, Stefan; Milanič, Martin On the complexity of the identifiable subgraph problem, revisited. (English) Zbl 1365.05230 Discrete Appl. Math. 226, 78-86 (2017). MSC: 05C70 68Q25 68Q17 PDFBibTeX XMLCite \textit{S. Kratsch} and \textit{M. Milanič}, Discrete Appl. Math. 226, 78--86 (2017; Zbl 1365.05230) Full Text: DOI arXiv
Dong, Jianming; Hu, Jueliang; Kovalyov, Mikhail Y.; Lin, Guohui; Luo, Taibo; Tong, Weitian; Wang, Xueshi; Xu, Yinfeng Corrigendum to: “An FPTAS for the parallel two-stage flowshop problem”. (English) Zbl 1371.68044 Theor. Comput. Sci. 687, 93-94 (2017). MSC: 68M20 68Q25 68W25 90B35 90C39 90C59 PDFBibTeX XMLCite \textit{J. Dong} et al., Theor. Comput. Sci. 687, 93--94 (2017; Zbl 1371.68044) Full Text: DOI
Arvind, V. Finding fixed point free elements and small bases in permutation groups. (English) Zbl 1371.68100 Theor. Comput. Sci. 687, 70-78 (2017). MSC: 68Q25 20B05 20B40 68W20 PDFBibTeX XMLCite \textit{V. Arvind}, Theor. Comput. Sci. 687, 70--78 (2017; Zbl 1371.68100) Full Text: DOI
Yu, Ting; Liu, Mengchi A linear time algorithm for maximal clique enumeration in large sparse graphs. (English) Zbl 1416.05146 Inf. Process. Lett. 125, 35-40 (2017). MSC: 05C30 05C69 68Q25 PDFBibTeX XMLCite \textit{T. Yu} and \textit{M. Liu}, Inf. Process. Lett. 125, 35--40 (2017; Zbl 1416.05146) Full Text: DOI
Chen, Ho-Lin; Doty, David Parallelism and time in hierarchical self-assembly. (English) Zbl 1408.68060 SIAM J. Comput. 46, No. 2, 661-709 (2017). MSC: 68Q05 68Q10 68Q25 PDFBibTeX XMLCite \textit{H.-L. Chen} and \textit{D. Doty}, SIAM J. Comput. 46, No. 2, 661--709 (2017; Zbl 1408.68060) Full Text: DOI Link
Lingas, Andrzej; Persson, Mia; Sledneu, Dzmitry Bounds for semi-disjoint bilinear forms in a unit-cost computational model. (English) Zbl 1460.68045 Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 14th annual conference, TAMC 2017, Bern, Switzerland, April 20–22, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10185, 412-424 (2017). MSC: 68Q25 15A63 65F99 68R05 PDFBibTeX XMLCite \textit{A. Lingas} et al., Lect. Notes Comput. Sci. 10185, 412--424 (2017; Zbl 1460.68045) Full Text: DOI
Ota, Makoto; Seki, Shinnosuke Rule set design problems for oritatami systems. (English) Zbl 1370.68096 Theor. Comput. Sci. 671, 26-35 (2017). MSC: 68Q05 68Q10 68Q25 68U05 92D20 PDFBibTeX XMLCite \textit{M. Ota} and \textit{S. Seki}, Theor. Comput. Sci. 671, 26--35 (2017; Zbl 1370.68096) Full Text: DOI
Földvári, Attila The complexity of the equation solvability problem over semipattern groups. (English) Zbl 1368.20034 Int. J. Algebra Comput. 27, No. 2, 259-272 (2017). MSC: 20F10 68Q17 68Q25 20E22 20G40 16N40 PDFBibTeX XMLCite \textit{A. Földvári}, Int. J. Algebra Comput. 27, No. 2, 259--272 (2017; Zbl 1368.20034) Full Text: DOI arXiv
Kowaluk, Mirosław; Lingas, Andrzej A fast deterministic detection of small pattern graphs in graphs without large cliques. (English) Zbl 1464.68290 Poon, Sheung-Hung (ed.) et al., WALCOM: algorithms and computation. 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10167, 217-227 (2017). MSC: 68R10 05C50 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{M. Kowaluk} and \textit{A. Lingas}, Lect. Notes Comput. Sci. 10167, 217--227 (2017; Zbl 1464.68290) Full Text: DOI
Brandstädt, Andreas; Mosca, Raffaele Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time. (English) Zbl 1360.68497 Algorithmica 77, No. 4, 1283-1302 (2017). MSC: 68Q25 05C70 05C85 PDFBibTeX XMLCite \textit{A. Brandstädt} and \textit{R. Mosca}, Algorithmica 77, No. 4, 1283--1302 (2017; Zbl 1360.68497) Full Text: DOI arXiv
Chitnis, Rajesh; Esfandiari, Hossein; Hajiaghayi, MohammadTaghi; Khandekar, Rohit; Kortsarz, Guy; Seddighin, Saeed A tight algorithm for strongly connected Steiner subgraph on two terminals with demands. (English) Zbl 1364.68225 Algorithmica 77, No. 4, 1216-1239 (2017). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{R. Chitnis} et al., Algorithmica 77, No. 4, 1216--1239 (2017; Zbl 1364.68225) Full Text: DOI Link
Kostitsyna, Irina; Löffler, Maarten; Polishchuk, Valentin; Staals, Frank On the complexity of minimum-link path problems. (English) Zbl 1362.65027 J. Comput. Geom. 8, No. 2, 80-108 (2017). MSC: 65D18 68U05 65Y20 PDFBibTeX XMLCite \textit{I. Kostitsyna} et al., J. Comput. Geom. 8, No. 2, 80--108 (2017; Zbl 1362.65027) Full Text: DOI arXiv
Boland, Natashia; Kalinowski, Thomas; Rigterink, Fabian A polynomially solvable case of the pooling problem. (English) Zbl 1365.90212 J. Glob. Optim. 67, No. 3, 621-630 (2017). MSC: 90C26 90C60 PDFBibTeX XMLCite \textit{N. Boland} et al., J. Glob. Optim. 67, No. 3, 621--630 (2017; Zbl 1365.90212) Full Text: DOI arXiv
Chen, Lily; Li, Xueliang; Liu, Mengmeng; Mao, Yaping A solution to a conjecture on the generalized connectivity of graphs. (English) Zbl 1358.05159 J. Comb. Optim. 33, No. 1, 275-282 (2017). MSC: 05C40 05C05 68Q25 PDFBibTeX XMLCite \textit{L. Chen} et al., J. Comb. Optim. 33, No. 1, 275--282 (2017; Zbl 1358.05159) Full Text: DOI
Jonsson, Peter; Lagerkvist, Victor An initial study of time complexity in infinite-domain constraint satisfaction. (English) Zbl 1402.68162 Artif. Intell. 245, 115-133 (2017). MSC: 68T20 68Q25 PDFBibTeX XMLCite \textit{P. Jonsson} and \textit{V. Lagerkvist}, Artif. Intell. 245, 115--133 (2017; Zbl 1402.68162) Full Text: DOI Link
DasGupta, Bhaskar; Mobasheri, Nasim On optimal approximability results for computing the strong metric dimension. (English) Zbl 1357.05030 Discrete Appl. Math. 221, 18-24 (2017). MSC: 05C12 05C85 68Q25 PDFBibTeX XMLCite \textit{B. DasGupta} and \textit{N. Mobasheri}, Discrete Appl. Math. 221, 18--24 (2017; Zbl 1357.05030) Full Text: DOI arXiv
Al-Bataineh, Omar; Reynolds, Mark; French, Tim Finding minimum and maximum termination time of timed automata models with cyclic behaviour. (English) Zbl 1357.68109 Theor. Comput. Sci. 665, 87-104 (2017). MSC: 68Q60 68Q25 68Q45 PDFBibTeX XMLCite \textit{O. Al-Bataineh} et al., Theor. Comput. Sci. 665, 87--104 (2017; Zbl 1357.68109) Full Text: DOI arXiv Link
Dong, Jianming; Tong, Weitian; Luo, Taibo; Wang, Xueshi; Hu, Jueliang; Xu, Yinfeng; Lin, Guohui An FPTAS for the parallel two-stage flowshop problem. (English) Zbl 1356.68023 Theor. Comput. Sci. 657, Part A, 64-72 (2017); corrigendum ibid. 687, 93-94 (2017). MSC: 68M20 68Q25 68W25 90B35 90C39 90C59 PDFBibTeX XMLCite \textit{J. Dong} et al., Theor. Comput. Sci. 657, Part A, 64--72 (2017; Zbl 1356.68023) Full Text: DOI
Sitters, René Approximability of average completion time scheduling on unrelated machines. (English) Zbl 1357.90059 Math. Program. 161, No. 1-2 (A), 135-158 (2017). Reviewer: Frank Werner (Magdeburg) MSC: 90B35 68W25 68Q25 PDFBibTeX XMLCite \textit{R. Sitters}, Math. Program. 161, No. 1--2 (A), 135--158 (2017; Zbl 1357.90059) Full Text: DOI
Collins, George E. On the maximum computing time of the bisection method for real root isolation. (English) Zbl 1358.65029 J. Symb. Comput. 79, Part 2, 444-456 (2017). MSC: 65H04 65Y20 PDFBibTeX XMLCite \textit{G. E. Collins}, J. Symb. Comput. 79, Part 2, 444--456 (2017; Zbl 1358.65029) Full Text: DOI
Malyshev, D. S.; Lobanova, O. O. Two complexity results for the vertex coloring problem. (English) Zbl 1440.05093 Discrete Appl. Math. 219, 158-166 (2017). MSC: 05C15 05C22 68Q17 05C85 PDFBibTeX XMLCite \textit{D. S. Malyshev} and \textit{O. O. Lobanova}, Discrete Appl. Math. 219, 158--166 (2017; Zbl 1440.05093) Full Text: DOI
Lozin, V. V.; Malyshev, D. S. Vertex coloring of graphs with few obstructions. (English) Zbl 1350.05038 Discrete Appl. Math. 216, Part 1, 273-280 (2017). MSC: 05C15 05C85 68W25 68Q25 PDFBibTeX XMLCite \textit{V. V. Lozin} and \textit{D. S. Malyshev}, Discrete Appl. Math. 216, Part 1, 273--280 (2017; Zbl 1350.05038) Full Text: DOI
Grinberg, Yuri; Perkins, Theodore J. Fully polynomial-time computation of maximum likelihood trajectories in Markov chains. (English) Zbl 1392.68203 Inf. Process. Lett. 118, 53-57 (2017). MSC: 68Q25 05C85 60J10 PDFBibTeX XMLCite \textit{Y. Grinberg} and \textit{T. J. Perkins}, Inf. Process. Lett. 118, 53--57 (2017; Zbl 1392.68203) Full Text: DOI
Elbassioni, Khaled; Nguyen, Trung Thanh A polynomial-time algorithm for computing low CP-rank decompositions. (English) Zbl 1392.68200 Inf. Process. Lett. 118, 10-14 (2017). MSC: 68Q25 15B48 65F30 PDFBibTeX XMLCite \textit{K. Elbassioni} and \textit{T. T. Nguyen}, Inf. Process. Lett. 118, 10--14 (2017; Zbl 1392.68200) Full Text: DOI
Jonsson, Peter; Lagerkvist, Victor; Nordh, Gustav; Zanuttini, Bruno Strong partial clones and the time complexity of SAT problems. (English) Zbl 1353.68133 J. Comput. Syst. Sci. 84, 52-78 (2017). MSC: 68Q25 08A40 08A70 68Q17 PDFBibTeX XMLCite \textit{P. Jonsson} et al., J. Comput. Syst. Sci. 84, 52--78 (2017; Zbl 1353.68133) Full Text: DOI Link
Chang, Ching-Lueh A lower bound for metric 1-median selection. (English) Zbl 1353.68111 J. Comput. Syst. Sci. 84, 44-51 (2017). MSC: 68Q25 68Q17 68W25 PDFBibTeX XMLCite \textit{C.-L. Chang}, J. Comput. Syst. Sci. 84, 44--51 (2017; Zbl 1353.68111) Full Text: DOI arXiv
Schubert, Herman; van de Gronde, Jasper J.; Roerdink, Jos B. T. M. Efficient computation of greyscale path openings. (English) Zbl 1469.68162 Math. Morphol., Theory Appl. 1, 189-202 (2016). MSC: 68U10 68U05 PDFBibTeX XMLCite \textit{H. Schubert} et al., Math. Morphol., Theory Appl. 1, 189--202 (2016; Zbl 1469.68162) Full Text: DOI
García-Morales, Vladimir Semipredictable dynamical systems. (English) Zbl 1510.37025 Commun. Nonlinear Sci. Numer. Simul. 39, 81-98 (2016). MSC: 37B15 37M10 68Q80 PDFBibTeX XMLCite \textit{V. García-Morales}, Commun. Nonlinear Sci. Numer. Simul. 39, 81--98 (2016; Zbl 1510.37025) Full Text: DOI arXiv
Gál, Anna; Jang, Jing-Tang; Limaye, Nutan; Mahajan, Meena; Sreenivasaiah, Karteek Space-efficient approximations for subset sum. (English) Zbl 1427.68367 ACM Trans. Comput. Theory 8, No. 4, Article No. 16, 28 p. (2016). MSC: 68W25 68Q06 68Q25 68W27 90C27 PDFBibTeX XMLCite \textit{A. Gál} et al., ACM Trans. Comput. Theory 8, No. 4, Article No. 16, 28 p. (2016; Zbl 1427.68367) Full Text: DOI
Skutella, Martin A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective. (English) Zbl 1408.90140 Oper. Res. Lett. 44, No. 5, 676-679 (2016). MSC: 90B35 68W25 90C60 PDFBibTeX XMLCite \textit{M. Skutella}, Oper. Res. Lett. 44, No. 5, 676--679 (2016; Zbl 1408.90140) Full Text: DOI arXiv
Tagore, Vickneswary; Zheng, Nan; Sutradhar, Brajendra C. Inferences in stochastic volatility models: a new simpler way. (English) Zbl 1407.62329 Sutradhar, Brajendra C. (ed.), Advances and challenges in parametric and semi-parametric analysis for correlated data. Proceedings of the 2015 international symposium in statistics, ISS 2015, St. John’s, Canada, July 6–8, 2015. Cham: Springer. Lect. Notes Stat. 218, 97-131 (2016). MSC: 62M10 62P05 62E15 PDFBibTeX XMLCite \textit{V. Tagore} et al., Lect. Notes Stat. 218, 97--131 (2016; Zbl 1407.62329) Full Text: DOI
Cirillo, Emilio N. M.; Krehel, Oleh; Muntean, Adrian; van Santen, Rutger; Sengar, Aditya Residence time estimates for asymmetric simple exclusion dynamics on strips. (English) Zbl 1400.60124 Physica A 442, 436-457 (2016). MSC: 60K35 PDFBibTeX XMLCite \textit{E. N. M. Cirillo} et al., Physica A 442, 436--457 (2016; Zbl 1400.60124) Full Text: DOI arXiv
Nepomnyashchaya, A. S. Associative version of the Ramalingam incremental algorithm for the dynamic all-pairs shortest-path problem. (English) Zbl 1413.68075 Jt. Bull. NCC IIS, Ser. Comput. Sci. 40, 75-86 (2016). MSC: 68R10 68W10 68W40 PDFBibTeX XMLCite \textit{A. S. Nepomnyashchaya}, Jt. Bull. NCC IIS, Ser. Comput. Sci. 40, 75--86 (2016; Zbl 1413.68075) Full Text: Link
Wang, Ruxian On the sum-product ratio problem and its applications. (English) Zbl 1408.90286 Oper. Res. Lett. 44, No. 3, 409-414 (2016). MSC: 90C32 90C60 PDFBibTeX XMLCite \textit{R. Wang}, Oper. Res. Lett. 44, No. 3, 409--414 (2016; Zbl 1408.90286) Full Text: DOI
Ben-Sasson, Eli; Kaplan, Yohay; Kopparty, Swastik; Meir, Or; Stichtenoth, Henning Constant rate PCPs for circuit-SAT with sublinear query complexity. (English) Zbl 1410.68140 J. ACM 63, No. 4, Article No. 32, 57 p. (2016). MSC: 68Q17 68Q15 PDFBibTeX XMLCite \textit{E. Ben-Sasson} et al., J. ACM 63, No. 4, Article No. 32, 57 p. (2016; Zbl 1410.68140) Full Text: DOI Link
Bernáth, Attila; Király, Tamás Blocking optimal \(k\)-arborescences. (English) Zbl 1414.90302 Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1682-1694 (2016). MSC: 90C27 05C85 68Q25 PDFBibTeX XMLCite \textit{A. Bernáth} and \textit{T. Király}, in: Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10--12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1682--1694 (2016; Zbl 1414.90302) Full Text: DOI arXiv
Glacet, Christian; Miller, Avery; Pelc, Andrzej Time vs. information tradeoffs for leader election in anonymous trees. (English) Zbl 1410.68058 Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 600-609 (2016). MSC: 68M14 68Q25 68W15 PDFBibTeX XMLCite \textit{C. Glacet} et al., in: Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10--12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 600--609 (2016; Zbl 1410.68058) Full Text: DOI
Bondarenko, Vladimir; Nikolaev, Andrei On graphs of the cone decompositions for the min-cut and max-cut problems. (English) Zbl 1457.90165 Int. J. Math. Math. Sci. 2016, Article ID 7863650, 6 p. (2016). MSC: 90C35 PDFBibTeX XMLCite \textit{V. Bondarenko} and \textit{A. Nikolaev}, Int. J. Math. Math. Sci. 2016, Article ID 7863650, 6 p. (2016; Zbl 1457.90165) Full Text: DOI
Andreatta, Giovanni; De Francesco, Carla; De Giovanni, Luigi; Serafini, Paolo Constrained domatic bipartition on trees. (English) Zbl 1387.05175 Discrete Optim. 22, Part B, 372-388 (2016). MSC: 05C69 90C10 90C27 90C35 90C57 90C39 68Q25 PDFBibTeX XMLCite \textit{G. Andreatta} et al., Discrete Optim. 22, Part B, 372--388 (2016; Zbl 1387.05175) Full Text: DOI
Telha, Claudio; Van Vyve, Mathieu Efficient approximation schemes for economic lot-sizing in continuous time. (English) Zbl 1387.90026 Discrete Optim. 20, 23-39 (2016). MSC: 90B05 90B30 68W25 90C39 PDFBibTeX XMLCite \textit{C. Telha} and \textit{M. Van Vyve}, Discrete Optim. 20, 23--39 (2016; Zbl 1387.90026) Full Text: DOI
Sahni, Sartaj General techniques for combinatorial approximation. (English) Zbl 1394.90496 Thulasiraman, Krishnaiyan (ed.) et al., Handbook of graph theory, combinatorial optimization, and algorithms. Boca Raton, FL: CRC Press (ISBN 978-1-58488-595-5/hbk; 978-1-4200-1107-4/ebook). Chapman & Hall/CRC Computer and Information Science Series, 1027-1034 (2016). Reviewer: Svetlana A. Kravchenko (Minsk) MSC: 90C27 90C09 90C59 65K05 68Q25 68W25 68W40 PDFBibTeX XMLCite \textit{S. Sahni}, in: Handbook of graph theory, combinatorial optimization, and algorithms. Boca Raton, FL: CRC Press. 1027--1034 (2016; Zbl 1394.90496)
Chakraborty, Souymodip; Katoen, Joost-Pieter On the satisfiability of some simple probabilistic logics. (English) Zbl 1394.68169 Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 56-65 (2016). MSC: 68Q25 03B25 03B44 03B45 03B48 60J20 68Q17 68Q60 68Q87 PDFBibTeX XMLCite \textit{S. Chakraborty} and \textit{J.-P. Katoen}, in: Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5--8, 2016. New York, NY: Association for Computing Machinery (ACM). 56--65 (2016; Zbl 1394.68169) Full Text: DOI
Gupta, Sushmita; Roy, Sanjukta Stable matching games: manipulation via subgraph isomorphism. (English) Zbl 1391.68053 Lal, Akash (ed.) et al., 36th IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2016), Chennai, India, December 13–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-027-9). LIPIcs – Leibniz International Proceedings in Informatics 65, Article 29, 14 p. (2016). MSC: 68Q25 05C60 05C85 91A80 91B68 PDFBibTeX XMLCite \textit{S. Gupta} and \textit{S. Roy}, LIPIcs -- Leibniz Int. Proc. Inform. 65, Article 29, 14~p. (2016; Zbl 1391.68053) Full Text: DOI
Kawase, Yasushi; Makino, Kazuhisa; Seimi, Kento Optimal composition ordering problems for piecewise linear functions. (English) Zbl 1388.68125 Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 42, 13 p. (2016). MSC: 68Q25 68R05 90B35 PDFBibTeX XMLCite \textit{Y. Kawase} et al., LIPIcs -- Leibniz Int. Proc. Inform. 64, Article 42, 13 p. (2016; Zbl 1388.68125) Full Text: DOI arXiv
Jin, Kai Computing the pattern waiting time: a revisit of the intuitive approach. (English) Zbl 1398.60063 Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 39, 12 p. (2016). MSC: 60G40 60J10 65Y20 PDFBibTeX XMLCite \textit{K. Jin}, LIPIcs -- Leibniz Int. Proc. Inform. 64, Article 39, 12 p. (2016; Zbl 1398.60063) Full Text: DOI
Sakai, Takayuki; Seto, Kazuhisa; Tamaki, Suguru; Teruyama, Junichi Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression. (English) Zbl 1398.68259 Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 82, 16 p. (2016). MSC: 68Q25 68Q17 94C10 PDFBibTeX XMLCite \textit{T. Sakai} et al., LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 82, 16 p. (2016; Zbl 1398.68259) Full Text: DOI
Golovnev, Alexander; Kulikov, Alexander S.; Smal, Alexander V.; Tamaki, Suguru Circuit size lower bounds and #SAT upper bounds through a general framework. (English) Zbl 1398.68193 Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 45, 16 p. (2016). MSC: 68Q17 68Q25 94C10 PDFBibTeX XMLCite \textit{A. Golovnev} et al., LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 45, 16 p. (2016; Zbl 1398.68193) Full Text: DOI
Ganian, Robert; de Haan, Ronald; Kanj, Iyad; Szeider, Stefan On existential MSO and its relation to ETH. (English) Zbl 1398.68179 Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 42, 14 p. (2016). MSC: 68Q15 03B15 PDFBibTeX XMLCite \textit{R. Ganian} et al., LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 42, 14 p. (2016; Zbl 1398.68179) Full Text: DOI
Ganian, Robert; Narayanaswamy, N. S.; Ordyniak, Sebastian; Rahul, C. S.; Ramanujan, M. S. On the complexity landscape of connected \(f\)-factor problems. (English) Zbl 1398.68233 Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 41, 14 p. (2016). MSC: 68Q25 05C40 68Q17 PDFBibTeX XMLCite \textit{R. Ganian} et al., LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 41, 14 p. (2016; Zbl 1398.68233) Full Text: DOI arXiv
Betz, Volker; Le Roux, Stéphane Stable states of perturbed Markov chains. (English) Zbl 1398.68214 Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 18, 14 p. (2016). MSC: 68Q25 60J10 68Q87 PDFBibTeX XMLCite \textit{V. Betz} and \textit{S. Le Roux}, LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 18, 14 p. (2016; Zbl 1398.68214) Full Text: DOI arXiv
Kowalik, Łukasz; Lauri, Juho; Socala, Arkadiusz On the fine-grained complexity of rainbow coloring. (English) Zbl 1397.68102 Sankowski, Piotr (ed.) et al., 24th annual European symposium on algorithms, ESA 2016, Aarhus, Denmark, August 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-015-6). LIPIcs – Leibniz International Proceedings in Informatics 57, Article 58, 16 p. (2016). MSC: 68Q25 05C15 68Q17 PDFBibTeX XMLCite \textit{Ł. Kowalik} et al., LIPIcs -- Leibniz Int. Proc. Inform. 57, Article 58, 16 p. (2016; Zbl 1397.68102) Full Text: DOI arXiv
Drucker, Andrew; Nederlof, Jesper; Santhanam, Rahul Exponential time paradigms through the polynomial time lens. (English) Zbl 1397.68097 Sankowski, Piotr (ed.) et al., 24th annual European symposium on algorithms, ESA 2016, Aarhus, Denmark, August 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-015-6). LIPIcs – Leibniz International Proceedings in Informatics 57, Article 36, 14 p. (2016). MSC: 68Q25 68Q17 PDFBibTeX XMLCite \textit{A. Drucker} et al., LIPIcs -- Leibniz Int. Proc. Inform. 57, Article 36, 14 p. (2016; Zbl 1397.68097) Full Text: DOI
Burcea, Mihai; Hon, Wing-Kai; Liu, Hsiang-Hsuan; Wong, Prudence W. H.; Yau, David K. Y. Scheduling for electricity cost in a smart grid. (English) Zbl 1386.90047 J. Sched. 19, No. 6, 687-699 (2016). MSC: 90B35 68M20 PDFBibTeX XMLCite \textit{M. Burcea} et al., J. Sched. 19, No. 6, 687--699 (2016; Zbl 1386.90047) Full Text: DOI
Padmanabhan, Pramod; Ibieta-Jimenez, Juan Pablo; Bernabe Ferreira, Miguel Jorge; Teotonio-Sobrinho, Paulo Deformed quantum double realization of the toric code and beyond. (English) Zbl 1380.82036 Ann. Phys. 372, 238-259 (2016). MSC: 82C23 82C20 81T25 68Q12 PDFBibTeX XMLCite \textit{P. Padmanabhan} et al., Ann. Phys. 372, 238--259 (2016; Zbl 1380.82036) Full Text: DOI arXiv
Shwartz, Ofer; Nadler, Boaz Detecting the large entries of a sparse covariance matrix in sub-quadratic time. (English) Zbl 1386.94037 Inf. Inference 5, No. 3, 304-330 (2016). MSC: 94A12 94A13 PDFBibTeX XMLCite \textit{O. Shwartz} and \textit{B. Nadler}, Inf. Inference 5, No. 3, 304--330 (2016; Zbl 1386.94037) Full Text: DOI arXiv
Eremeev, Anton V.; Kovalenko, Yulia V. Mixed integer programming approach to multiprocessor job scheduling with setup times. (English) Zbl 1380.68074 Kochetov, Yury (ed.) et al., Discrete optimization and operations research. 9th international conference, DOOR 2016, Vladivostok, Russia, September 19–23, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-44913-5/pbk; 978-3-319-44914-2/ebook). Lecture Notes in Computer Science 9869, 298-308 (2016). MSC: 68M20 90C10 90C60 PDFBibTeX XMLCite \textit{A. V. Eremeev} and \textit{Y. V. Kovalenko}, Lect. Notes Comput. Sci. 9869, 298--308 (2016; Zbl 1380.68074) Full Text: DOI
Marx, Dániel; Miltzow, Tillmann Peeling and nibbling the cactus: subexponential-time algorithms for counting triangulations and related problems. (English) Zbl 1387.68269 Fekete, Sándor (ed.) et al., 32nd international symposium on computational geometry, SoCG’16, Boston, MA, USA, June 14–17, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-009-5). LIPIcs – Leibniz International Proceedings in Informatics 51, Article 52, 16 p. (2016). MSC: 68U05 68Q25 68R10 PDFBibTeX XMLCite \textit{D. Marx} and \textit{T. Miltzow}, LIPIcs -- Leibniz Int. Proc. Inform. 51, Article 52, 16 p. (2016; Zbl 1387.68269) Full Text: DOI arXiv
Bagchi, Bhaskar; Datta, Basudeb; Burton, Benjamin A.; Singh, Nitin; Spreer, Jonathan Efficient algorithms to decide tightness. (English) Zbl 1387.52008 Fekete, Sándor (ed.) et al., 32nd international symposium on computational geometry, SoCG’16, Boston, MA, USA, June 14–17, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-009-5). LIPIcs – Leibniz International Proceedings in Informatics 51, Article 12, 15 p. (2016). MSC: 52A30 55U10 68Q25 PDFBibTeX XMLCite \textit{B. Bagchi} et al., LIPIcs -- Leibniz Int. Proc. Inform. 51, Article 12, 15 p. (2016; Zbl 1387.52008) Full Text: DOI arXiv
Agarwal, Pankaj K.; Fox, Kyle; Pan, Jiangwei; Ying, Rex Approximating dynamic time warping and edit distance for a pair of point sequences. (English) Zbl 1387.68226 Fekete, Sándor (ed.) et al., 32nd international symposium on computational geometry, SoCG’16, Boston, MA, USA, June 14–17, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-009-5). LIPIcs – Leibniz International Proceedings in Informatics 51, Article 6, 16 p. (2016). MSC: 68U05 68Q25 PDFBibTeX XMLCite \textit{P. K. Agarwal} et al., LIPIcs -- Leibniz Int. Proc. Inform. 51, Article 6, 16 p. (2016; Zbl 1387.68226) Full Text: DOI arXiv
Nagoya, Takayuki Polynomial time algorithms for variants of graph matching on partial \(k\)-trees. (English) Zbl 1378.05200 Found. Comput. Decis. Sci. 41, No. 3, 163-181 (2016). MSC: 05C85 05C70 68Q25 68R10 PDFBibTeX XMLCite \textit{T. Nagoya}, Found. Comput. Decis. Sci. 41, No. 3, 163--181 (2016; Zbl 1378.05200) Full Text: DOI
Sablik, Mathieu; Schraudner, Michael Algorithmic complexity for the realization of an effective subshift by a sofic. (English) Zbl 1388.68134 Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 110, 14 p. (2016). MSC: 68Q25 05B45 37B10 37B50 PDFBibTeX XMLCite \textit{M. Sablik} and \textit{M. Schraudner}, LIPIcs -- Leibniz Int. Proc. Inform. 55, Article 110, 14 p. (2016; Zbl 1388.68134) Full Text: DOI
Bournez, Olivier; Graça, Daniel S.; Pouly, Amaury Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length: the general purpose analog computer and computable analysis are two efficiently equivalent models of computations. (English) Zbl 1388.68041 Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 109, 15 p. (2016). MSC: 68Q05 03D78 68Q15 PDFBibTeX XMLCite \textit{O. Bournez} et al., LIPIcs -- Leibniz Int. Proc. Inform. 55, Article 109, 15 p. (2016; Zbl 1388.68041) Full Text: DOI arXiv
Lincoln, Andrea; Williams, Virginia Vassilevska; Wang, Joshua R.; Williams, R. Ryan Deterministic time-space trade-offs for \(k\)-SUM. (English) Zbl 1388.68127 Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 58, 14 p. (2016). MSC: 68Q25 PDFBibTeX XMLCite \textit{A. Lincoln} et al., LIPIcs -- Leibniz Int. Proc. Inform. 55, Article 58, 14 p. (2016; Zbl 1388.68127) Full Text: DOI arXiv
Curticapean, Radu Parity separation: a scientifically proven method for permanent weight loss. (English) Zbl 1388.68221 Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 47, 14 p. (2016). MSC: 68R10 05C22 05C70 68Q15 68Q17 PDFBibTeX XMLCite \textit{R. Curticapean}, LIPIcs -- Leibniz Int. Proc. Inform. 55, Article 47, 14 p. (2016; Zbl 1388.68221) Full Text: DOI arXiv
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf Fractals for kernelization lower bounds, with an application to length-bounded cut problems. (English) Zbl 1388.68111 Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 25, 14 p. (2016). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{T. Fluschnik} et al., LIPIcs -- Leibniz Int. Proc. Inform. 55, Article 25, 14 p. (2016; Zbl 1388.68111) Full Text: DOI
Arad, Itai; Santha, Miklos; Sundaram, Aarthi; Zhang, Shengyu Linear time algorithm for quantum 2SAT. (English) Zbl 1388.68064 Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 15, 14 p. (2016). MSC: 68Q12 PDFBibTeX XMLCite \textit{I. Arad} et al., LIPIcs -- Leibniz Int. Proc. Inform. 55, Article 15, 14 p. (2016; Zbl 1388.68064) Full Text: DOI arXiv
Bodlaender, Hans L.; Nederlof, Jesper; van der Zanden, Tom C. Subexponential time algorithms for embedding \(H\)-minor free graphs. (English) Zbl 1388.68103 Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 9, 14 p. (2016). MSC: 68Q25 05C60 05C83 05C85 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., LIPIcs -- Leibniz Int. Proc. Inform. 55, Article 9, 14 p. (2016; Zbl 1388.68103) Full Text: DOI
Deuar, P. A tractable prescription for large-scale free flight expansion of wavefunctions. (English) Zbl 1380.65455 Comput. Phys. Commun. 208, 92-102 (2016). MSC: 65T50 81Q05 65Z05 65Y20 PDFBibTeX XMLCite \textit{P. Deuar}, Comput. Phys. Commun. 208, 92--102 (2016; Zbl 1380.65455) Full Text: DOI arXiv
Magott, Jan; Skrobanek, Paweł Semantics and execution time of new timed statecharts. (English) Zbl 1373.68161 Fundam. Inform. 147, No. 4, 387-414 (2016). MSC: 68M20 68Q25 PDFBibTeX XMLCite \textit{J. Magott} and \textit{P. Skrobanek}, Fundam. Inform. 147, No. 4, 387--414 (2016; Zbl 1373.68161) Full Text: DOI
Gawrychowski, Pawel; Merkurev, Oleg; Shur, Arseny; Uznanski, Przemyslaw Tight tradeoffs for real-time approximation of longest palindromes in streams. (English) Zbl 1380.68475 Grossi, Roberto (ed.) et al., 27th annual symposium on combinatorial pattern matching, CPM 2016, Tel Aviv, Israel, June 27–29, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-012-5). LIPIcs – Leibniz International Proceedings in Informatics 54, Article 18, 13 p. (2016). MSC: 68W32 68Q17 68Q25 68W20 68W25 PDFBibTeX XMLCite \textit{P. Gawrychowski} et al., LIPIcs -- Leibniz Int. Proc. Inform. 54, Article 18, 13 p. (2016; Zbl 1380.68475) Full Text: DOI arXiv
Williams, Richard Ryan Strong ETH breaks with Merlin and Arthur: short non-interactive proofs of batch evaluation. (English) Zbl 1380.68234 Raz, Ran (ed.), 31st conference on computational complexity, CCC’16, Tokyo, Japan, May 29 – June 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-008-8). LIPIcs – Leibniz International Proceedings in Informatics 50, Article 2, 17 p. (2016). MSC: 68Q25 03F20 68Q05 68Q10 68Q17 PDFBibTeX XMLCite \textit{R. R. Williams}, LIPIcs -- Leibniz Int. Proc. Inform. 50, Article 2, 17 p. (2016; Zbl 1380.68234) Full Text: DOI arXiv
Galanis, Andreas; Štefankovič, Daniel; Vigoda, Eric Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models. (English) Zbl 1420.68098 Comb. Probab. Comput. 25, No. 4, 500-559 (2016). MSC: 68Q25 05C80 60J10 60K35 68Q17 68Q87 82B20 PDFBibTeX XMLCite \textit{A. Galanis} et al., Comb. Probab. Comput. 25, No. 4, 500--559 (2016; Zbl 1420.68098) Full Text: DOI arXiv
Capdevielle, Claire; Johnen, Colette; Kuznetsov, Petr; Milani, Alessia On the uncontended complexity of anonymous consensus. (English) Zbl 1380.68040 Anceaume, Emmanuelle (ed.) et al., 19th international conference on principles of distributed systems, OPODIS 2015, Rennes, France, December 14–17, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-98-9). LIPIcs – Leibniz International Proceedings in Informatics 46, Article 12, 16 p. (2016). MSC: 68M14 68Q25 PDFBibTeX XMLCite \textit{C. Capdevielle} et al., LIPIcs -- Leibniz Int. Proc. Inform. 46, Article 12, 16 p. (2016; Zbl 1380.68040) Full Text: DOI
Cooper, Colin; Radzik, Tomasz; Rivera, Nicolas The coalescing-branching random walk on expanders and the dual epidemic process. (English) Zbl 1376.68105 Proceedings of the 2016 ACM symposium on principles of distributed computing, PODC ’16, Chicago, IL, USA, July 25–28, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3964-3). 461-467 (2016). MSC: 68R10 05C81 68M12 68M14 68Q25 68Q87 PDFBibTeX XMLCite \textit{C. Cooper} et al., in: Proceedings of the 35th ACM symposium on principles of distributed computing, PODC '16, Chicago, IL, USA, July 25--28, 2016. New York, NY: Association for Computing Machinery (ACM). 461--467 (2016; Zbl 1376.68105) Full Text: DOI arXiv
Baruch, Mor; Ostrovsky, Rafail; Rosenbaum, Will Brief announcement: Space-time tradeoffs for distributed verification. (English) Zbl 1374.68270 Proceedings of the 2016 ACM symposium on principles of distributed computing, PODC ’16, Chicago, IL, USA, July 25–28, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3964-3). 357-359 (2016). MSC: 68Q60 68M14 68Q25 68R10 68W15 PDFBibTeX XMLCite \textit{M. Baruch} et al., in: Proceedings of the 35th ACM symposium on principles of distributed computing, PODC '16, Chicago, IL, USA, July 25--28, 2016. New York, NY: Association for Computing Machinery (ACM). 357--359 (2016; Zbl 1374.68270) Full Text: DOI arXiv
Fomin, Fedor V.; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket Exact algorithms via monotone local search. (English) Zbl 1375.68185 Wichs, Daniel (ed.) et al., Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC ’16, Cambridge, MA, USA, June 19–21, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4132-5). 764-775 (2016). MSC: 68W05 68Q25 68T20 68W20 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., in: Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC '16, Cambridge, MA, USA, June 19--21, 2016. New York, NY: Association for Computing Machinery (ACM). 764--775 (2016; Zbl 1375.68185) Full Text: DOI arXiv
Cohen-Addad, Vincent; Colin de Verdière, Éric; Klein, Philip N.; Mathieu, Claire; Meierfrankenfeld, David Approximating connectivity domination in weighted bounded-genus graphs. (English) Zbl 1376.68171 Wichs, Daniel (ed.) et al., Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC ’16, Cambridge, MA, USA, June 19–21, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4132-5). 584-597 (2016). MSC: 68W25 05C10 05C22 05C69 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{V. Cohen-Addad} et al., in: Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC '16, Cambridge, MA, USA, June 19--21, 2016. New York, NY: Association for Computing Machinery (ACM). 584--597 (2016; Zbl 1376.68171) Full Text: DOI
Emamjomeh-Zadeh, Ehsan; Kempe, David; Singhal, Vikrant Deterministic and probabilistic binary search in graphs. (English) Zbl 1376.68064 Wichs, Daniel (ed.) et al., Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC ’16, Cambridge, MA, USA, June 19–21, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4132-5). 519-532 (2016). MSC: 68Q25 05C85 68Q17 68T20 PDFBibTeX XMLCite \textit{E. Emamjomeh-Zadeh} et al., in: Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC '16, Cambridge, MA, USA, June 19--21, 2016. New York, NY: Association for Computing Machinery (ACM). 519--532 (2016; Zbl 1376.68064) Full Text: DOI arXiv
Alaev, Pavel Evgenievich Atomless Boolean algebras computable in polynomial time. (Russian. English summary) Zbl 1390.03033 Sib. Èlektron. Mat. Izv. 13, 1035-1039 (2016). MSC: 03C57 03D15 06E05 68Q25 PDFBibTeX XMLCite \textit{P. E. Alaev}, Sib. Èlektron. Mat. Izv. 13, 1035--1039 (2016; Zbl 1390.03033) Full Text: DOI
Prunescu, Mihai About a surprising computer program of Matthias Müller. (English) Zbl 1420.68100 Adiprasito, Karim (ed.) et al., Convexity and discrete geometry including graph theory. Mulhouse, France, September 1–11, 2014. Cham: Springer. Springer Proc. Math. Stat. 148, 97-108 (2016). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{M. Prunescu}, Springer Proc. Math. Stat. 148, 97--108 (2016; Zbl 1420.68100) Full Text: DOI
Baillot, Patrick; Das, Anupam Free-cut elimination in linear logic and an application to a feasible arithmetic. (English) Zbl 1370.03078 Regnier, Laurent (ed.) et al., 25th EACSL annual conference and 30th workshop on computer science logic, CSL’16, Marseille, France, August 29 – September 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-022-4). LIPIcs – Leibniz International Proceedings in Informatics 62, Article 40, 18 p. (2016). MSC: 03F52 03B70 03F05 03F30 PDFBibTeX XMLCite \textit{P. Baillot} and \textit{A. Das}, LIPIcs -- Leibniz Int. Proc. Inform. 62, Article 40, 18~p. (2016; Zbl 1370.03078) Full Text: DOI
Pakusa, Wied; Schalthöfer, Svenja; Selman, Erkal Definability of Cai-Fürer-Immerman problems in choiceless polynomial time. (English) Zbl 1369.68222 Regnier, Laurent (ed.) et al., 25th EACSL annual conference and 30th workshop on computer science logic, CSL’16, Marseille, France, August 29 – September 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-022-4). LIPIcs – Leibniz International Proceedings in Informatics 62, Article 19, 17 p. (2016). MSC: 68Q19 03C13 68Q15 PDFBibTeX XMLCite \textit{W. Pakusa} et al., LIPIcs -- Leibniz Int. Proc. Inform. 62, Article 19, 17~p. (2016; Zbl 1369.68222) Full Text: DOI