Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

1621 Publications


2017 |Published| Conference Paper | IST-REx-ID: 11829 | OA
Conditional hardness for sensitivity problems
M.H. Henzinger, A. Lincoln, S. Neumann, V. Vassilevska Williams, in:, 8th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 |Published| Conference Paper | IST-REx-ID: 11833 | OA
The power of vertex sparsifiers in dynamic graph algorithms
G. Goranci, M.H. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 |Published| Conference Paper | IST-REx-ID: 11832 | OA
Dynamic clustering to minimize the sum of radii
M.H. Henzinger, D. Leniowski, C. Mathieu, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 |Published| Conference Paper | IST-REx-ID: 11874 | OA
Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time
S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 470–489.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 |Published| Conference Paper | IST-REx-ID: 11831 | OA
Improved guarantees for vertex sparsification in planar graphs
G. Goranci, M.H. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2017 |Published| Journal Article | IST-REx-ID: 1191 | OA
Existence of traveling waves for the generalized F–KPP equation
R. Kollár, S. Novak, Bulletin of Mathematical Biology 79 (2017) 525–559.
[Preprint] View | DOI | Download Preprint (ext.)
 

2017 |Published| Conference Paper | IST-REx-ID: 12571 | OA
Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time
S. Bhattacharya, D. Chakrabarty, M.H. Henzinger, in:, 19th International Conference on Integer Programming and Combinatorial Optimization, Springer Nature, 2017, pp. 86–98.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 |Published| Journal Article | IST-REx-ID: 464 | OA
Improved algorithms for parity and Streett objectives
K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).
[Published Version] View | Files available | DOI | arXiv
 

2017 |Published| Journal Article | IST-REx-ID: 484 | OA
Bogoliubov correction to the mean-field dynamics of interacting bosons
P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics 21 (2017) 683–738.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 |Published| Journal Article | IST-REx-ID: 534 | OA
Finding non-orientable surfaces in 3-Manifolds
B. Burton, A.N. de Mesmay, U. Wagner, Discrete & Computational Geometry 58 (2017) 871–888.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2017 |Published| Journal Article | IST-REx-ID: 465 | OA
Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).
[Published Version] View | Files available | DOI
 

2017 |Published| Journal Article | IST-REx-ID: 560 | OA
On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions
M. Gerencser, A. Jentzen, D. Salimova, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 473 (2017).
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 |Published| Book | IST-REx-ID: 567
A Dynamical Approach to Random Matrix Theory
L. Erdös, H. Yau, A Dynamical Approach to Random Matrix Theory, American Mathematical Society, 2017.
View | DOI
 

2017 |Published| Journal Article | IST-REx-ID: 568 | OA
Persistence of zero sets
P. Franek, M. Krcál, Homology, Homotopy and Applications 19 (2017) 313–342.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 |Published| Conference Paper | IST-REx-ID: 5801
Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space
S. Dwivedi, A. Gupta, S. Roy, R. Biswas, P. Bhowmick, in:, 20th IAPR International Conference, Springer Nature, Cham, 2017, pp. 347–359.
View | DOI
 

2017 |Published| Book Chapter | IST-REx-ID: 5803
Construction of persistent Voronoi diagram on 3D digital plane
R. Biswas, P. Bhowmick, in:, Combinatorial Image Analysis, Springer Nature, Cham, 2017, pp. 93–104.
View | DOI
 

2017 |Published| Conference Paper | IST-REx-ID: 5802
Digital primitives defined by weighted focal set
E. Andres, R. Biswas, P. Bhowmick, in:, 20th IAPR International Conference, Springer Nature, Cham, 2017, pp. 388–398.
View | DOI
 

2017 |Published| Conference Paper | IST-REx-ID: 605 | OA
Position based cryptography and multiparty communication complexity
J. Brody, S. Dziembowski, S. Faust, K.Z. Pietrzak, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 56–81.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 |Published| Conference Paper | IST-REx-ID: 609 | OA
Moderately hard functions: Definition, instantiations, and applications
J.F. Alwen, B. Tackmann, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 493–526.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 |Published| Journal Article | IST-REx-ID: 610 | OA
On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result
X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, U. Wagner, Israel Journal of Mathematics 222 (2017) 841–866.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

Filters and Search Terms

isbn%3D978-364254630-3

Search

Filter Publications