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.

137 Publications


2019 | Conference Paper | IST-REx-ID: 7228
Koval N, Alistarh D-A, Elizarov R. 2019. Scalable FIFO channels for programming via communicating sequential processes. 25th Anniversary of Euro-Par. Euro-Par: European Conference on Parallel Processing, LNCS, vol. 11725, 317–333.
View | DOI | WoS
 

2019 | Conference Paper | IST-REx-ID: 7231 | OA
Kong H, Bartocci E, Jiang Y, Henzinger TA. 2019. Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty. 17th International Conference on Formal Modeling and Analysis of Timed Systems. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11750, 123–141.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2019 | Conference Paper | IST-REx-ID: 7230 | OA
Arroyo Guevara AM, Derka M, Parada I. 2019. Extending simple drawings. 27th International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network Visualization, LNCS, vol. 11904, 230–243.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2019 | Conference Paper | IST-REx-ID: 7232
Ferrere T, Maler O, Nickovic D. 2019. Mixed-time signal temporal logic. 17th International Conference on Formal Modeling and Analysis of Timed Systems. FORMATS: Formal Modeling and Anaysis of Timed Systems, LNCS, vol. 11750, 59–75.
View | DOI | WoS
 

2019 | Conference Paper | IST-REx-ID: 7411 | OA
Abusalah HM, Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2019. Reversible proofs of sequential work. Advances in Cryptology – EUROCRYPT 2019. International Conference on the Theory and Applications of Cryptographic Techniques, LNCS, vol. 11477, 277–291.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

2019 | Conference Paper | IST-REx-ID: 6482 | OA
Sun R, Lampert C. 2019. KS(conf): A light-weight test if a ConvNet operates outside of Its specifications. GCPR: Conference on Pattern Recognition, LNCS, vol. 11269, 244–259.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 6164
Koshti G, Biswas R, Largeteau-Skapin G, Zrour R, Andres E, Bhowmick P. 2018. Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D. 19th International Workshop. IWCIA: International Workshop on Combinatorial Image Analysis, LNCS, vol. 11255, 82–96.
View | DOI
 

2018 | Conference Paper | IST-REx-ID: 8298
Androulaki E, Cachin C, De Caro A, Kokoris Kogias E. 2018. Channels: Horizontal scaling and confidentiality on permissioned blockchains. Computer Security. ESORICS: European Symposium on Research in Computer Security, LNCS, vol. 11098, 111–131.
View | DOI
 

2018 | Conference Paper | IST-REx-ID: 6941 | OA
Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. 2018. SpaceMint: A cryptocurrency based on proofs of space. 22nd International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 10957, 480–499.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

2017 | Conference Paper | IST-REx-ID: 11772
Henzinger MH. 2017. The state of the art in dynamic graph algorithms. 44th International Conference on Current Trends in Theory and Practice of Computer Science. SOFSEM: Theory and Practice of Computer Science, LNCS, vol. 10706, 40–44.
View | DOI
 

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

2017 | Conference Paper | IST-REx-ID: 5801
Dwivedi S, Gupta A, Roy S, Biswas R, Bhowmick P. 2017. Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space. 20th IAPR International Conference. DGCI: International Conference on Discrete Geometry for Computer Imagery, LNCS, vol. 10502, 347–359.
View | DOI
 

2017 | Book Chapter | IST-REx-ID: 5803
Biswas R, Bhowmick P. 2017.Construction of persistent Voronoi diagram on 3D digital plane. In: Combinatorial image analysis. LNCS, vol. 10256, 93–104.
View | DOI
 

2017 | Conference Paper | IST-REx-ID: 5802
Andres E, Biswas R, Bhowmick P. 2017. Digital primitives defined by weighted focal set. 20th IAPR International Conference. DGCI: International Conference on Discrete Geometry for Computer Imagery, LNCS, vol. 10502, 388–398.
View | DOI
 

2017 | Book Chapter | IST-REx-ID: 625 | OA
Chatterjee K, Doyen L, Henzinger TA. 2017.The cost of exactness in quantitative reachability. In: Models, Algorithms, Logics and Tools. LNCS, vol. 10460, 367–381.
[Submitted Version] View | Files available | DOI
 

2017 | Conference (Editor) | IST-REx-ID: 638
Bogomolov S, Martel M, Prabhakar P eds. 2017. Numerical Software Verification, Springer,p.
View | DOI
 

2017 | Conference Paper | IST-REx-ID: 13160 | OA
Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. 2017. Index appearance record for transforming Rabin automata into parity automata. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10205, 443–460.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2016 | Conference Paper | IST-REx-ID: 5806
Biswas R, Bhowmick P. 2016. On functionality of quadraginta octants of naive sphere with application to circle drawing. Discrete Geometry for Computer Imagery. DGCI: International Conference on Discrete Geometry for Computer Imagery, LNCS, vol. 9647, 256–267.
View | DOI
 

2016 | Book Chapter | IST-REx-ID: 5805
Sen N, Biswas R, Bhowmick P. 2016.On some local topological properties of naive discrete sphere. In: Computational Topology in Image Context. LNCS, vol. 9667, 253–264.
View | DOI
 

2016 | Book Chapter | IST-REx-ID: 5809
Biswas R, Bhowmick P, Brimkov VE. 2016.On the connectivity and smoothness of discrete spherical circles. In: Combinatorial image analysis. vol. 9448, 86–100.
View | DOI
 

2016 | Book Chapter | IST-REx-ID: 1094
Harada H, Shigemoto R. 2016.Immunogold protein localization on grid-glued freeze-fracture replicas. In: High-Resolution Imaging of Cellular Proteins. Methods in Molecular Biology, vol. 1474, 203–216.
View | DOI
 

2015 | Conference Paper | IST-REx-ID: 11774 | OA
Cheung YK, Henzinger MH, Hoefer M, Starnberger M. 2015. Combinatorial auctions with conflict-based externalities. 11th International Conference on Web and Internet Economics. WINE: International Conference on Web and Internet Economics, LNCS, vol. 9470, 230–243.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2015 | Conference Paper | IST-REx-ID: 11773 | OA
Ben-Zwi O, Henzinger MH, Loitzenbauer V. 2015. Ad exchange: Envy-free auctions with mediators. 11th International Conference on Web and Internet Economics. WINE: International Conference on Web and Internet Economics, LNCS, vol. 9470, 104–117.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2015 | Conference Paper | IST-REx-ID: 11785 | OA
Henzinger MH, Krinninger S, Nanongkai D. 2015. Improved algorithms for decremental single-source reachability on directed graphs. 42nd International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 9134, 725–736.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2015 | Conference Paper | IST-REx-ID: 11787 | OA
Henzinger MH, Krinninger S, Loitzenbauer V. 2015. Finding 2-edge and 2-vertex strongly connected components in quadratic time. 2nd International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 9134, 713–724.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2015 | Conference Paper | IST-REx-ID: 11788 | OA
Dvořák W, Henzinger MH. 2015. Online ad assignment with an ad exchange. 12th International Workshop of Approximation and Online Algorithms. WAOA: International Workshop on Approximation and Online Algorithms, LNCS, vol. 8952, 156–167.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2015 | Conference Paper | IST-REx-ID: 11786 | OA
Bhattacharya S, Henzinger MH, Italiano GF. 2015. Design of dynamic algorithms via primal-dual method. 42nd International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 9134, 206–218.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2015 | Conference Paper | IST-REx-ID: 1675 | OA
Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. 2015. Proofs of space. 35th Annual Cryptology Conference. CRYPTO: International Cryptology Conference, LNCS, vol. 9216, 585–605.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2014 | Conference Paper | IST-REx-ID: 10884 | OA
Aminof B, Jacobs S, Khalimov A, Rubin S. 2014. Parameterized model checking of token-passing systems. Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 262–281.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2014 | Conference Paper | IST-REx-ID: 11789 | OA
Charikar M, Henzinger MH, Nguyễn HL. 2014. Online bipartite matching with decomposable weights. 22nd Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LNCS, vol. 8737, 260–271.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2014 | Conference Paper | IST-REx-ID: 11790
Cigler L, Dvořák W, Henzinger MH, Starnberger M. 2014. Limiting price discrimination when selling products with positive network externalities. 10th International Conference of Web and Internet Economics. WINE: International Conference on Web and Internet Economics, LNCS, vol. 8877, 44–57.
View | DOI
 

2014 | Conference Paper | IST-REx-ID: 10793
Fulek R, Kynčl J, Malinović I, Pálvölgyi D. 2014. Clustered planarity testing revisited. International Symposium on Graph Drawing. , LNCS, vol. 8871, 428–436.
[Preprint] View | Files available | DOI | arXiv
 

2014 | Conference Paper | IST-REx-ID: 10892
Biedl T, Huber S, Palfrader P. 2014. Planar matchings for weighted straight skeletons. 25th International Symposium, ISAAC 2014. ISAAC: International Symposium on Algorithms and Computation, LNCS, vol. 8889, 117–127.
View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 5810
Biswas R, Bhowmick P. 2014. On Finding Spherical Geodesic Paths and Circles in ℤ3. 8668, 396–409.
View | DOI
 

2014 | Conference Paper | IST-REx-ID: 10885
Chatterjee K, Doyen L, Filiot E, Raskin J-F. 2014. Doomsday equilibria for omega-regular games. VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 78–97.
[Preprint] View | Files available | DOI | arXiv
 

2014 | Conference Paper | IST-REx-ID: 10894
Bauer U, Kerber M, Reininghaus J, Wagner H. 2014. PHAT – Persistent Homology Algorithms Toolbox. ICMS 2014: International Congress on Mathematical Software. ICMS: International Congress on Mathematical SoftwareLNCS vol. 8592, 137–143.
View | Files available | DOI
 

2013 | Book Chapter | IST-REx-ID: 5747 | OA
Dragoi C, Gupta A, Henzinger TA. 2013.Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In: Computer Aided Verification. vol. 8044, 174–190.
View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 10902
Chatterjee K, Chaubal S, Rubin S. 2013. How to travel between languages. 7th International Conference on Language and Automata Theory and Applications. LATA: Conference on Language and Automata Theory and ApplicationsLNCS, LNCS, vol. 7810, 214–225.
View | DOI
 

2013 | Conference Paper | IST-REx-ID: 10897
Edelsbrunner H. 2013. Persistent homology in image processing. Graph-Based Representations in Pattern Recognition. GbRPR: Graph-based Representations in Pattern RecognitionLNCS vol. 7877, 182–183.
View | DOI
 

2012 | Conference Paper | IST-REx-ID: 11795
Colini-Baldeschi R, Henzinger MH, Leonardi S, Starnberger M. 2012. On multiple keyword sponsored search auctions with budgets. 39th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 7392, 1–12.
View | Files available | DOI
 

2012 | Conference Paper | IST-REx-ID: 10904
Chatterjee K, Randour M, Raskin J-F. 2012. Strategy synthesis for multi-dimensional quantitative objectives. CONCUR 2012 - Concurrency Theory. CONCUR: Conference on Concurrency Theory, LNCS, vol. 7454, 115–131.
[Preprint] View | Files available | DOI | arXiv
 

2012 | Conference Paper | IST-REx-ID: 10903
Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Accurate invariant checking for programs manipulating lists and arrays with infinite data. Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and AnalysisLNCS, LNCS, vol. 7561, 167–182.
View | DOI
 

2012 | Conference Paper | IST-REx-ID: 10905 | OA
Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2012. Polynomial-time algorithms for energy games with special weight structures. Algorithms – ESA 2012. ESA: European Symposium on Algorithms, LNCS, vol. 7501, 301–312.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2012 | Conference Paper | IST-REx-ID: 10906 | OA
Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. 2012. HSF(C): A software verifier based on Horn clauses. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of SystemsLNCS, LNCS, vol. 7214, 549–551.
[Published Version] View | DOI | Download Published Version (ext.)
 

2012 | Book Chapter | IST-REx-ID: 5745 | OA
Gupta A. 2012.Improved Single Pass Algorithms for Resolution Proof Reduction. In: Automated Technology for Verification and Analysis. vol. 7561, 107–121.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 10907
Artner NM, Ion A, Kropatsch WG. 2011. Spatio-temporal extraction of articulated models in a graph pyramid. Graph-Based Representations in Pattern Recognition. GbRPR: Graph-based Representations in Pattern RecognitionLNIP, LNCS, vol. 6658, 215–224.
View | DOI
 

2010 | Conference Paper | IST-REx-ID: 10908 | OA
Blanc R, Henzinger TA, Hottelier T, Kovács L. 2010. ABC: Algebraic Bound Computation for loops. Logic for Programming, Artificial Intelligence, and Reasoning. LPAR: Conference on Logic for Programming, Artificial Intelligence and ReasoningLNCS vol. 6355, 103–118.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2010 | Book Chapter | IST-REx-ID: 5940
Juhás G, Kazlov I, Juhásová A. 2010.Instance Deadlock: A Mystery behind Frozen Programs. In: Applications and Theory of Petri Nets. , 1–17.
View | DOI
 

2004 | Conference Paper | IST-REx-ID: 11801
Henzinger MH. 2004. Algorithmic aspects of web search engines. 2th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LNCS, vol. 3221, 3.
View | DOI
 

2004 | Conference Paper | IST-REx-ID: 11800
Henzinger MH. 2004. The past, present, and future of web search engines. 31st International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 3142, 3.
View | DOI
 

2000 | Conference Paper | IST-REx-ID: 11802
Henzinger MH. 2000. Web information retrieval - an algorithmic perspective. 8th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LNCS, vol. 1879, 1–8.
View | DOI
 

1997 | Conference Paper | IST-REx-ID: 11803
Henzinger MH, King V. 1997. Maintaining minimum spanning trees in dynamic graphs. 24th International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 1256, 594–604.
View | DOI
 

1996 | Conference Paper | IST-REx-ID: 11804
Henzinger MH, Telle JA. 1996. Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning. 5th Scandinavian Workshop on Algorithm Theory. SWAT: Scandinavian Workshop on Algorithm Theory, LNCS, vol. 1097, 16–27.
View | DOI
 

1996 | Conference Paper | IST-REx-ID: 11910
Henzinger MH, Thorup M. 1996. Improved sampling with applications to dynamic graph algorithms. 23rd International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 1099, 290–299.
View | DOI
 

1996 | Book (Editor) | IST-REx-ID: 4612
Alur R, Henzinger TA, Sontag ED eds. 1996. Hybrid Systems III: Verification and Control, Berlin ; Heidelberg: Springer, IX, 619p.
View | DOI
 

1995 | Conference Paper | IST-REx-ID: 11806
Henzinger MH. 1995. Approximating minimum cuts under insertions. 22nd International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 944, 280–291.
View | DOI
 

1995 | Conference Paper | IST-REx-ID: 11805
Henzinger MH, Poutré H. 1995. Certificates and fast algorithms for biconnectivity in fully-dynamic graphs. 3rd Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LNCS, vol. 979, 171–184.
View | DOI
 

Filters and Search Terms

issn=0302-9743

Search

Filter Publications