Hoffmann, Charlotte, et al. “Practical Statistically-Sound Proofs of Exponentiation in Any Group.”10.1007/978-3-031-15979-4_13__Advances in Cryptology – CRYPTO 2022, vol. 13508, Springer Nature, 2022, pp. 370–99, doi:10.1007/978-3-031-15979-4_13.
LibreCat: https://research-explorer.ista.ac.at/record/12176
DOI: 10.1007/978-3-031-15979-4_13
WoS: 000886792700013

Gelashvili, Rati, et al. “Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback.”10.1007/978-3-031-18283-9_14__Financial Cryptography and Data Security, vol. 13411, Springer Nature, 2022, pp. 296–315, doi:10.1007/978-3-031-18283-9_14.
LibreCat: https://research-explorer.ista.ac.at/record/12298
DOI: 10.1007/978-3-031-18283-9_14
arXiv: 2106.10362

Cohen, Shir, et al. “Be Aware of Your Leaders.”10.1007/978-3-031-18283-9_13__International Conference on Financial Cryptography and Data Security, vol. 13411, Springer Nature, 2022, pp. 279–95, doi:10.1007/978-3-031-18283-9_13.
LibreCat: https://research-explorer.ista.ac.at/record/12168
DOI: 10.1007/978-3-031-18283-9_13
arXiv: 2110.00960

Meggendorfer, Tobias. “PET – A Partial Exploration Tool for Probabilistic Verification.”10.1007/978-3-031-19992-9_20__20th International Symposium on Automated Technology for Verification and Analysis, vol. 13505, Springer Nature, 2022, pp. 320–26, doi:10.1007/978-3-031-19992-9_20.
LibreCat: https://research-explorer.ista.ac.at/record/12170
DOI: 10.1007/978-3-031-19992-9_20

Bose, Sougata, et al. “History-Deterministic Timed Automata Are Not Determinizable.”10.1007/978-3-031-19135-0_5__16th International Conference on Reachability Problems, vol. 13608, Springer Nature, 2022, pp. 67–76, doi:10.1007/978-3-031-19135-0_5.
LibreCat: https://research-explorer.ista.ac.at/record/12175
DOI: 10.1007/978-3-031-19135-0_5

Arroyo Guevara, Alan M., and Stefan Felsner. “Approximating the Bundled Crossing Number.”10.1007/978-3-030-96731-4_31__WALCOM 2022: Algorithms and Computation, vol. 13174, Springer Nature, 2022, pp. 383–95, doi:10.1007/978-3-030-96731-4_31.
LibreCat: https://research-explorer.ista.ac.at/record/11185
DOI: 10.1007/978-3-030-96731-4_31
arXiv: 2109.14892

Chatterjee, Krishnendu, et al. “Sound and Complete Certificates for Auantitative Termination Analysis of Probabilistic Programs.”10.1007/978-3-031-13185-1_4__Proceedings of the 34th International Conference on Computer Aided Verification, vol. 13371, Springer, 2022, pp. 55–78, doi:10.1007/978-3-031-13185-1_4.
LibreCat: https://research-explorer.ista.ac.at/record/12000
DOI: 10.1007/978-3-031-13185-1_4
WoS: 000870304500004

Henzinger, Monika H., and Xiaowei Wu. “Upper and Lower Bounds for Fully Retroactive Graph Problems.”10.1007/978-3-030-83508-8_34__17th International Symposium on Algorithms and Data Structures, vol. 12808, Springer Nature, 2021, pp. 471–484, doi:10.1007/978-3-030-83508-8_34.
LibreCat: https://research-explorer.ista.ac.at/record/11771
DOI: 10.1007/978-3-030-83508-8_34
arXiv: 1910.03332

Volhejn, Vaclav, and Christoph Lampert. “Does SGD Implicitly Optimize for Smoothness?”10.1007/978-3-030-71278-5_18__42nd German Conference on Pattern Recognition, vol. 12544, Springer, 2021, pp. 246–59, doi:10.1007/978-3-030-71278-5_18.
LibreCat: https://research-explorer.ista.ac.at/record/9210
DOI: 10.1007/978-3-030-71278-5_18

Alistarh, Dan-Adrian, and Peter Davies. “Collecting Coupons Is Faster with Friends.”10.1007/978-3-030-79527-6_1__Structural Information and Communication Complexity, vol. 12810, Springer Nature, 2021, pp. 3–12, doi:10.1007/978-3-030-79527-6_1.
LibreCat: https://research-explorer.ista.ac.at/record/9620
DOI: 10.1007/978-3-030-79527-6_1

Bansal, Suguman, et al. “On Satisficing in Quantitative Games.”10.1007/978-3-030-72016-2__27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 12651, Springer Nature, 2021, pp. 20–37, doi:10.1007/978-3-030-72016-2.
LibreCat: https://research-explorer.ista.ac.at/record/12767
DOI: 10.1007/978-3-030-72016-2
arXiv: 2101.02594

Blackshear, Sam, et al. “Reactive Key-Loss Protection in Blockchains.”10.1007/978-3-662-63958-0_34__FC 2021 Workshops, vol. 12676, Springer Nature, 2021, pp. 431–50, doi:10.1007/978-3-662-63958-0_34.
LibreCat: https://research-explorer.ista.ac.at/record/10076
DOI: 10.1007/978-3-662-63958-0_34
WoS: 000713005000034

Mühlböck, Fabian, and Thomas A. Henzinger. “Differential Monitoring.”10.1007/978-3-030-88494-9_12__International Conference on Runtime Verification, vol. 12974, Springer Nature, 2021, pp. 231–43, doi:10.1007/978-3-030-88494-9_12.
LibreCat: https://research-explorer.ista.ac.at/record/10108
DOI: 10.1007/978-3-030-88494-9_12
WoS: 000719383800012

Zamyatin, Alexei, et al. “SoK: Communication across Distributed Ledgers.”10.1007/978-3-662-64331-0_1__25th International Conference on Financial Cryptography and Data Security, vol. 12675, Springer Nature, 2021, pp. 3–36, doi:10.1007/978-3-662-64331-0_1.
LibreCat: https://research-explorer.ista.ac.at/record/10325
DOI: 10.1007/978-3-662-64331-0_1
WoS: 000712016200001

Avarikioti, Zeta, et al. “Brick: Asynchronous Incentive-Compatible Payment Channels.”10.1007/978-3-662-64331-0_11__25th International Conference on Financial Cryptography and Data Security, vol. 12675, Springer Nature, 2021, pp. 209–30, doi:10.1007/978-3-662-64331-0_11.
LibreCat: https://research-explorer.ista.ac.at/record/10324
DOI: 10.1007/978-3-662-64331-0_11
WoS: 000712016200011
arXiv: 1905.11360

Chakraborty, Suvradip, et al. Trojan-Resilience without Cryptography. Vol. 13043, Springer Nature, 2021, pp. 397–428, doi:10.1007/978-3-030-90453-1_14.
LibreCat: https://research-explorer.ista.ac.at/record/10407
DOI: 10.1007/978-3-030-90453-1_14
WoS: 000728364000014

Alwen, Joel F., et al. “Grafting Key Trees: Efficient Key Management for Overlapping Groups.”10.1007/978-3-030-90456-2_8__19th International Conference, vol. 13044, Springer Nature, 2021, pp. 222–53, doi:10.1007/978-3-030-90456-2_8.
LibreCat: https://research-explorer.ista.ac.at/record/10408
DOI: 10.1007/978-3-030-90456-2_8
WoS: 000728363700008

Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.”10.1007/978-3-030-90453-1_17__19th International Conference, vol. 13043, Springer Nature, 2021, pp. 486–517, doi:10.1007/978-3-030-90453-1_17.
LibreCat: https://research-explorer.ista.ac.at/record/10409
DOI: 10.1007/978-3-030-90453-1_17
WoS: 000728364000017

Chakraborty, Suvradip, et al. “Reverse Firewalls for Adaptively Secure MPC without Setup.”10.1007/978-3-030-92075-3_12__27th International Conference on the Theory and Application of Cryptology and Information Security, vol. 13091, Springer Nature, 2021, pp. 335–64, doi:10.1007/978-3-030-92075-3_12.
LibreCat: https://research-explorer.ista.ac.at/record/10609
DOI: 10.1007/978-3-030-92075-3_12
WoS: 000927876200012

Agarwal, Pratyush, et al. “Stateless Model Checking under a Reads-Value-from Equivalence.”10.1007/978-3-030-81685-8_16__33rd International Conference on Computer-Aided Verification , vol. 12759, Springer Nature, 2021, pp. 341–66, doi:10.1007/978-3-030-81685-8_16.
LibreCat: https://research-explorer.ista.ac.at/record/9987
DOI: 10.1007/978-3-030-81685-8_16
WoS: 000698732400016
arXiv: 2105.06424

Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.”10.1007/978-3-030-84245-1_17__41st Annual International Cryptology Conference, Part II , vol. 12826, Springer Nature, 2021, pp. 486–515, doi:10.1007/978-3-030-84245-1_17.
LibreCat: https://research-explorer.ista.ac.at/record/10041
DOI: 10.1007/978-3-030-84245-1_17

Bloch-Hansen, Andrew, et al. “Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem.”10.1007/978-3-030-67899-9_28__Conference on Algorithms and Discrete Applied Mathematics, vol. 12601, Springer Nature, 2021, pp. 346–58, doi:10.1007/978-3-030-67899-9_28.
LibreCat: https://research-explorer.ista.ac.at/record/9227
DOI: 10.1007/978-3-030-67899-9_28

Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on Graphs.”10.1007/978-3-030-90453-1_19__19th International Conference, vol. 13043, Springer Nature, 2021, pp. 550–81, doi:10.1007/978-3-030-90453-1_19.
LibreCat: https://research-explorer.ista.ac.at/record/10410
DOI: 10.1007/978-3-030-90453-1_19
WoS: 000728364000019

Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.”10.1007/978-3-030-90870-6_33__24th International Symposium on Formal Methods, vol. 13047, Springer Nature, 2021, pp. 619–39, doi:10.1007/978-3-030-90870-6_33.
LibreCat: https://research-explorer.ista.ac.at/record/10414
DOI: 10.1007/978-3-030-90870-6_33
WoS: 000758218600033
arXiv: 2108.02188

Lukina, Anna, et al. “Into the Unknown: Active Monitoring of Neural Networks.”10.1007/978-3-030-88494-9_3__21st International Conference on Runtime Verification, vol. 12974, Springer Nature, 2021, pp. 42–61, doi:10.1007/978-3-030-88494-9_3.
LibreCat: https://research-explorer.ista.ac.at/record/10206
DOI: 10.1007/978-3-030-88494-9_3
WoS: 000719383800003
arXiv: 2009.06429

Pach, János, et al. “Crossings between Non-Homotopic Edges.”10.1007/978-3-030-68766-3_28__28th International Symposium on Graph Drawing and Network Visualization, vol. 12590, Springer Nature, 2020, pp. 359–71, doi:10.1007/978-3-030-68766-3_28.
LibreCat: https://research-explorer.ista.ac.at/record/9299
DOI: 10.1007/978-3-030-68766-3_28
arXiv: 2006.14908

Auerbach, Benedikt, et al. “Everybody’s a Target: Scalability in Public-Key Encryption.”10.1007/978-3-030-45727-3_16__Advances in Cryptology – EUROCRYPT 2020, vol. 12107, Springer Nature, 2020, pp. 475–506, doi:10.1007/978-3-030-45727-3_16.
LibreCat: https://research-explorer.ista.ac.at/record/7966
DOI: 10.1007/978-3-030-45727-3_16
WoS: 000828688000016

Henzinger, Thomas A., and Naci E. Sarac. “Monitorability under Assumptions.”10.1007/978-3-030-60508-7_1__Runtime Verification, vol. 12399, Springer Nature, 2020, pp. 3–18, doi:10.1007/978-3-030-60508-7_1.
LibreCat: https://research-explorer.ista.ac.at/record/8623
DOI: 10.1007/978-3-030-60508-7_1
WoS: 000728160600001

Arroyo Guevara, Alan M., et al. “Inserting One Edge into a Simple Drawing Is Hard.”10.1007/978-3-030-60440-0_26__Graph-Theoretic Concepts in Computer Science, vol. 12301, Springer Nature, 2020, pp. 325–38, doi:10.1007/978-3-030-60440-0_26.
LibreCat: https://research-explorer.ista.ac.at/record/8732
DOI: 10.1007/978-3-030-60440-0_26

Chakraborty, Suvradip, et al. “Witness Maps and Applications.”10.1007/978-3-030-45374-9_8__Public-Key Cryptography, edited by A Kiayias, vol. 12110, Springer Nature, 2020, pp. 220–46, doi:10.1007/978-3-030-45374-9_8.
LibreCat: https://research-explorer.ista.ac.at/record/10865
DOI: 10.1007/978-3-030-45374-9_8

Kragl, Bernhard, et al. “Refinement for Structured Concurrent Programs.”10.1007/978-3-030-53288-8_14__Computer Aided Verification, vol. 12224, Springer Nature, 2020, pp. 275–98, doi:10.1007/978-3-030-53288-8_14.
LibreCat: https://research-explorer.ista.ac.at/record/8195
DOI: 10.1007/978-3-030-53288-8_14
WoS: 000695276000014

Asadi, Ali, et al. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.”10.1007/978-3-030-59152-6_14__Automated Technology for Verification and Analysis, vol. 12302, Springer Nature, 2020, pp. 253–70, doi:10.1007/978-3-030-59152-6_14.
LibreCat: https://research-explorer.ista.ac.at/record/8728
DOI: 10.1007/978-3-030-59152-6_14
WoS: 000723555700014

Biswas, Ranita, et al. “Rhombic Dodecahedron Grid—Coordinate System and 3D Digital Object Definitions.”10.1007/978-3-030-14085-4_3__21st IAPR International Conference on Discrete Geometry for Computer Imagery, vol. 11414, Springer Berlin Heidelberg, 2019, pp. 27–37, doi:10.1007/978-3-030-14085-4_3.
LibreCat: https://research-explorer.ista.ac.at/record/6163
DOI: 10.1007/978-3-030-14085-4_3

Walter, Michael. “Sampling the Integers with Low Relative Error.”10.1007/978-3-030-23696-0_9__Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann et al., vol. 11627, Springer Nature, 2019, pp. 157–80, doi:10.1007/978-3-030-23696-0_9.
LibreCat: https://research-explorer.ista.ac.at/record/6726
DOI: 10.1007/978-3-030-23696-0_9

Avni, Guy, et al. “Bidding Games on Markov Decision Processes.”10.1007/978-3-030-30806-3_1__10.1007/978-3-030-30806-3_1__Proceedings of the 13th International Conference of Reachability Problems, vol. 11674, Springer, 2019, pp. 1–12, doi:10.1007/978-3-030-30806-3_1.
LibreCat: https://research-explorer.ista.ac.at/record/6822
DOI: 10.1007/978-3-030-30806-3_1

Avni, Guy, et al. “Run-Time Optimization for Learned Controllers through Quantitative Games.”10.1007/978-3-030-25540-4_36__31st International Conference on Computer-Aided Verification, vol. 11561, Springer, 2019, pp. 630–49, doi:10.1007/978-3-030-25540-4_36.
LibreCat: https://research-explorer.ista.ac.at/record/6462
DOI: 10.1007/978-3-030-25540-4_36
WoS: 000491468000036

Garcia Soto, Miriam, et al. “Membership-Based Synthesis of Linear Hybrid Automata.”10.1007/978-3-030-25540-4_16__31st International Conference on Computer-Aided Verification, vol. 11561, Springer, 2019, pp. 297–314, doi:10.1007/978-3-030-25540-4_16.
LibreCat: https://research-explorer.ista.ac.at/record/6493
DOI: 10.1007/978-3-030-25540-4_16
WoS: 000491468000016

Ashok, Pranav, et al. “Strategy Representation by Decision Trees with Linear Classifiers.”10.1007/978-3-030-30281-8_7__16th International Conference on Quantitative Evaluation of Systems, vol. 11785, Springer Nature, 2019, pp. 109–28, doi:10.1007/978-3-030-30281-8_7.
LibreCat: https://research-explorer.ista.ac.at/record/6942
DOI: 10.1007/978-3-030-30281-8_7
WoS: 000679281300007
arXiv: 1906.08178

Guet, Calin C., et al. “Transient Memory in Gene Regulation.”10.1007/978-3-030-31304-3_9__17th International Conference on Computational Methods in Systems Biology, vol. 11773, Springer Nature, 2019, pp. 155–87, doi:10.1007/978-3-030-31304-3_9.
LibreCat: https://research-explorer.ista.ac.at/record/7147
DOI: 10.1007/978-3-030-31304-3_9
WoS: 000557875100009

Nidkovi, Dejan, et al. “Shape Expressions for Specifying and Extracting Signal Features.”10.1007/978-3-030-32079-9_17__19th International Conference on Runtime Verification, vol. 11757, Springer Nature, 2019, pp. 292–309, doi:10.1007/978-3-030-32079-9_17.
LibreCat: https://research-explorer.ista.ac.at/record/7159
DOI: 10.1007/978-3-030-32079-9_17
WoS: 000570006300017

Koval, Nikita, et al. “Scalable FIFO Channels for Programming via Communicating Sequential Processes.”10.1007/978-3-030-29400-7_23__25th Anniversary of Euro-Par, vol. 11725, Springer Nature, 2019, pp. 317–33, doi:10.1007/978-3-030-29400-7_23.
LibreCat: https://research-explorer.ista.ac.at/record/7228
DOI: 10.1007/978-3-030-29400-7_23
WoS: 000851061400023

Kong, Hui, et al. “Piecewise Robust Barrier Tubes for Nonlinear Hybrid Systems with Uncertainty.”10.1007/978-3-030-29662-9_8__17th International Conference on Formal Modeling and Analysis of Timed Systems, vol. 11750, Springer Nature, 2019, pp. 123–41, doi:10.1007/978-3-030-29662-9_8.
LibreCat: https://research-explorer.ista.ac.at/record/7231
DOI: 10.1007/978-3-030-29662-9_8
WoS: 000611677700008
arXiv: 1907.11514

Arroyo Guevara, Alan M., et al. “Extending Simple Drawings.”10.1007/978-3-030-35802-0_18__27th International Symposium on Graph Drawing and Network Visualization, vol. 11904, Springer Nature, 2019, pp. 230–43, doi:10.1007/978-3-030-35802-0_18.
LibreCat: https://research-explorer.ista.ac.at/record/7230
DOI: 10.1007/978-3-030-35802-0_18
WoS: 000612918800018
arXiv: 1908.08129

Ferrere, Thomas, et al. “Mixed-Time Signal Temporal Logic.”10.1007/978-3-030-29662-9_4__17th International Conference on Formal Modeling and Analysis of Timed Systems, vol. 11750, Springer Nature, 2019, pp. 59–75, doi:10.1007/978-3-030-29662-9_4.
LibreCat: https://research-explorer.ista.ac.at/record/7232
DOI: 10.1007/978-3-030-29662-9_4
WoS: 000611677700004

Abusalah, Hamza M., et al. “Reversible Proofs of Sequential Work.”10.1007/978-3-030-17656-3_10__Advances in Cryptology – EUROCRYPT 2019, vol. 11477, Springer International Publishing, 2019, pp. 277–91, doi:10.1007/978-3-030-17656-3_10.
LibreCat: https://research-explorer.ista.ac.at/record/7411
DOI: 10.1007/978-3-030-17656-3_10
WoS: 000483516200010

Sun, Rémy, and Christoph Lampert. KS(Conf): A Light-Weight Test If a ConvNet Operates Outside of Its Specifications. Vol. 11269, Springer Nature, 2019, pp. 244–59, doi:10.1007/978-3-030-12939-2_18.
LibreCat: https://research-explorer.ista.ac.at/record/6482
DOI: 10.1007/978-3-030-12939-2_18
arXiv: 1804.04171

Koshti, Girish, et al. “Sphere Construction on the FCC Grid Interpreted as Layered Hexagonal Grids in 3D.”10.1007/978-3-030-05288-1_7__19th International Workshop, vol. 11255, Springer, 2018, pp. 82–96, doi:10.1007/978-3-030-05288-1_7.
LibreCat: https://research-explorer.ista.ac.at/record/6164
DOI: 10.1007/978-3-030-05288-1_7

Androulaki, Elli, et al. “Channels: Horizontal Scaling and Confidentiality on Permissioned Blockchains.”10.1007/978-3-319-99073-6_6__Computer Security, vol. 11098, Springer Nature, 2018, pp. 111–31, doi:10.1007/978-3-319-99073-6_6.
LibreCat: https://research-explorer.ista.ac.at/record/8298
DOI: 10.1007/978-3-319-99073-6_6

Park, Sunoo, et al. “SpaceMint: A Cryptocurrency Based on Proofs of Space.”10.1007/978-3-662-58387-6_26__22nd International Conference on Financial Cryptography and Data Security, vol. 10957, Springer Nature, 2018, pp. 480–99, doi:10.1007/978-3-662-58387-6_26.
LibreCat: https://research-explorer.ista.ac.at/record/6941
DOI: 10.1007/978-3-662-58387-6_26
WoS: 000540656400026

Henzinger, Monika H. “The State of the Art in Dynamic Graph Algorithms.”10.1007/978-3-319-73117-9_3__44th International Conference on Current Trends in Theory and Practice of Computer Science, vol. 10706, Springer Nature, 2017, pp. 40–44, doi:10.1007/978-3-319-73117-9_3.
LibreCat: https://research-explorer.ista.ac.at/record/11772
DOI: 10.1007/978-3-319-73117-9_3

Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time.”10.1007/978-3-319-59250-3_8__19th International Conference on Integer Programming and Combinatorial Optimization, vol. 10328, Springer Nature, 2017, pp. 86–98, doi:10.1007/978-3-319-59250-3_8.
LibreCat: https://research-explorer.ista.ac.at/record/12571
DOI: 10.1007/978-3-319-59250-3_8
arXiv: 1611.00198

Dwivedi, Shivam, et al. “Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space.”10.1007/978-3-319-66272-5_28__20th IAPR International Conference, vol. 10502, Springer Nature, 2017, pp. 347–59, doi:10.1007/978-3-319-66272-5_28.
LibreCat: https://research-explorer.ista.ac.at/record/5801
DOI: 10.1007/978-3-319-66272-5_28

Biswas, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi Diagram on 3D Digital Plane.”10.1007/978-3-319-59108-7_8__Combinatorial Image Analysis, vol. 10256, Springer Nature, 2017, pp. 93–104, doi:10.1007/978-3-319-59108-7_8.
LibreCat: https://research-explorer.ista.ac.at/record/5803
DOI: 10.1007/978-3-319-59108-7_8

Andres, Eric, et al. “Digital Primitives Defined by Weighted Focal Set.”10.1007/978-3-319-66272-5_31__20th IAPR International Conference, vol. 10502, Springer Nature, 2017, pp. 388–98, doi:10.1007/978-3-319-66272-5_31.
LibreCat: https://research-explorer.ista.ac.at/record/5802
DOI: 10.1007/978-3-319-66272-5_31

Chatterjee, Krishnendu, et al. “The Cost of Exactness in Quantitative Reachability.”10.1007/978-3-319-63121-9_18__Models, Algorithms, Logics and Tools, edited by Luca Aceto et al., vol. 10460, Springer, 2017, pp. 367–81, doi:10.1007/978-3-319-63121-9_18.
LibreCat: https://research-explorer.ista.ac.at/record/625
DOI: 10.1007/978-3-319-63121-9_18

Bogomolov, Sergiy, et al., editors. Numerical Software Verification. Vol. 10152, Springer, 2017, doi:10.1007/978-3-319-54292-8.
LibreCat: https://research-explorer.ista.ac.at/record/638
DOI: 10.1007/978-3-319-54292-8

Kretinsky, Jan, et al. “Index Appearance Record for Transforming Rabin Automata into Parity Automata.”10.1007/978-3-662-54577-5_26__Tools and Algorithms for the Construction and Analysis of Systems, vol. 10205, Springer, 2017, pp. 443–60, doi:10.1007/978-3-662-54577-5_26.
LibreCat: https://research-explorer.ista.ac.at/record/13160
DOI: 10.1007/978-3-662-54577-5_26
arXiv: 1701.05738

Biswas, Ranita, and Partha Bhowmick. “On Functionality of Quadraginta Octants of Naive Sphere with Application to Circle Drawing.”10.1007/978-3-319-32360-2_20__Discrete Geometry for Computer Imagery, vol. 9647, Springer Nature, 2016, pp. 256–67, doi:10.1007/978-3-319-32360-2_20.
LibreCat: https://research-explorer.ista.ac.at/record/5806
DOI: 10.1007/978-3-319-32360-2_20

Sen, Nabhasmita, et al. “On Some Local Topological Properties of Naive Discrete Sphere.”10.1007/978-3-319-39441-1_23__Computational Topology in Image Context, vol. 9667, Springer Nature, 2016, pp. 253–64, doi:10.1007/978-3-319-39441-1_23.
LibreCat: https://research-explorer.ista.ac.at/record/5805
DOI: 10.1007/978-3-319-39441-1_23

Biswas, Ranita, et al. “On the Connectivity and Smoothness of Discrete Spherical Circles.”10.1007/978-3-319-26145-4_7__Combinatorial Image Analysis, vol. 9448, Springer Nature, 2016, pp. 86–100, doi:10.1007/978-3-319-26145-4_7.
LibreCat: https://research-explorer.ista.ac.at/record/5809
DOI: 10.1007/978-3-319-26145-4_7

Harada, Harumi, and Ryuichi Shigemoto. “Immunogold Protein Localization on Grid-Glued Freeze-Fracture Replicas.”10.1007/978-1-4939-6352-2_12__High-Resolution Imaging of Cellular Proteins, vol. 1474, Springer, 2016, pp. 203–16, doi:10.1007/978-1-4939-6352-2_12.
LibreCat: https://research-explorer.ista.ac.at/record/1094
DOI: 10.1007/978-1-4939-6352-2_12

Cheung, Yun Kuen, et al. “Combinatorial Auctions with Conflict-Based Externalities.”10.1007/978-3-662-48995-6_17__11th International Conference on Web and Internet Economics, vol. 9470, Springer Nature, 2015, pp. 230–243, doi:10.1007/978-3-662-48995-6_17.
LibreCat: https://research-explorer.ista.ac.at/record/11774
DOI: 10.1007/978-3-662-48995-6_17
arXiv: 1509.09147

Ben-Zwi, Oren, et al. “Ad Exchange: Envy-Free Auctions with Mediators.”10.1007/978-3-662-48995-6_8__11th International Conference on Web and Internet Economics, vol. 9470, Springer Nature, 2015, pp. 104–117, doi:10.1007/978-3-662-48995-6_8.
LibreCat: https://research-explorer.ista.ac.at/record/11773
DOI: 10.1007/978-3-662-48995-6_8
arXiv: 1604.05562

Henzinger, Monika H., et al. “Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs.”10.1007/978-3-662-47672-7_59__42nd International Colloquium on Automata, Languages and Programming, vol. 9134, Springer Nature, 2015, pp. 725–36, doi:10.1007/978-3-662-47672-7_59.
LibreCat: https://research-explorer.ista.ac.at/record/11785
DOI: 10.1007/978-3-662-47672-7_59
arXiv: 1612.03856

Henzinger, Monika H., et al. “Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time.”10.1007/978-3-662-47672-7_58__2nd International Colloquium on Automata, Languages and Programming, vol. 9134, Springer Nature, 2015, pp. 713–24, doi:10.1007/978-3-662-47672-7_58.
LibreCat: https://research-explorer.ista.ac.at/record/11787
DOI: 10.1007/978-3-662-47672-7_58
arXiv: 1412.6466

Dvoák, Wolfgang, and Monika H. Henzinger. “Online Ad Assignment with an Ad Exchange.”10.1007/978-3-319-18263-6_14__12th International Workshop of Approximation and Online Algorithms, vol. 8952, Springer Nature, 2015, pp. 156–167, doi:10.1007/978-3-319-18263-6_14.
LibreCat: https://research-explorer.ista.ac.at/record/11788
DOI: 10.1007/978-3-319-18263-6_14
arXiv: 1604.05603

Bhattacharya, Sayan, et al. “Design of Dynamic Algorithms via Primal-Dual Method.”10.1007/978-3-662-47672-7_17__42nd International Colloquium on Automata, Languages and Programming, vol. 9134, Springer Nature, 2015, pp. 206–18, doi:10.1007/978-3-662-47672-7_17.
LibreCat: https://research-explorer.ista.ac.at/record/11786
DOI: 10.1007/978-3-662-47672-7_17
arXiv: 1604.05337

Dziembowski, Stefan, et al. “Proofs of Space.”10.1007/978-3-662-48000-7_29__35th Annual Cryptology Conference, vol. 9216, Springer, 2015, pp. 585–605, doi:10.1007/978-3-662-48000-7_29.
LibreCat: https://research-explorer.ista.ac.at/record/1675
DOI: 10.1007/978-3-662-48000-7_29

Aminof, Benjamin, et al. “Parameterized Model Checking of Token-Passing Systems.”10.1007/978-3-642-54013-4_15__Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer Nature, 2014, pp. 262–81, doi:10.1007/978-3-642-54013-4_15.
LibreCat: https://research-explorer.ista.ac.at/record/10884
DOI: 10.1007/978-3-642-54013-4_15
arXiv: 1311.4425

Charikar, Moses, et al. “Online Bipartite Matching with Decomposable Weights.”10.1007/978-3-662-44777-2_22__22nd Annual European Symposium on Algorithms, vol. 8737, Springer Nature, 2014, pp. 260–71, doi:10.1007/978-3-662-44777-2_22.
LibreCat: https://research-explorer.ista.ac.at/record/11789
DOI: 10.1007/978-3-662-44777-2_22
arXiv: 1409.2139

Cigler, Ludbk, et al. “Limiting Price Discrimination When Selling Products with Positive Network Externalities.”10.1007/978-3-319-13129-0_4__10th International Conference of Web and Internet Economics, vol. 8877, Springer Nature, 2014, pp. 44–57, doi:10.1007/978-3-319-13129-0_4.
LibreCat: https://research-explorer.ista.ac.at/record/11790
DOI: 10.1007/978-3-319-13129-0_4

Fulek, Radoslav, et al. “Clustered Planarity Testing Revisited.”10.1007/978-3-662-45803-7_36__International Symposium on Graph Drawing, vol. 8871, Springer Nature, 2014, pp. 428–36, doi:10.1007/978-3-662-45803-7_36.
LibreCat: https://research-explorer.ista.ac.at/record/10793
DOI: 10.1007/978-3-662-45803-7_36
arXiv: 1305.4519

Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.”10.1007/978-3-319-13075-0_10__25th International Symposium, ISAAC 2014, vol. 8889, Springer Nature, 2014, pp. 117–27, doi:10.1007/978-3-319-13075-0_10.
LibreCat: https://research-explorer.ista.ac.at/record/10892
DOI: 10.1007/978-3-319-13075-0_10

Biswas, Ranita, and Partha Bhowmick. On Finding Spherical Geodesic Paths and Circles in 3. Vol. 8668, Springer, 2014, pp. 396–409, doi:10.1007/978-3-319-09955-2_33.
LibreCat: https://research-explorer.ista.ac.at/record/5810
DOI: 10.1007/978-3-319-09955-2_33

Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.”10.1007/978-3-642-54013-4_5__VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer Nature, 2014, pp. 78–97, doi:10.1007/978-3-642-54013-4_5.
LibreCat: https://research-explorer.ista.ac.at/record/10885
DOI: 10.1007/978-3-642-54013-4_5
arXiv: 1311.3238

Bauer, Ulrich, et al. “PHAT – Persistent Homology Algorithms Toolbox.”10.1007/978-3-662-44199-2_24__ICMS 2014: International Congress on Mathematical Software, vol. 8592, Springer Berlin Heidelberg, 2014, pp. 137–43, doi:10.1007/978-3-662-44199-2_24.
LibreCat: https://research-explorer.ista.ac.at/record/10894
DOI: 10.1007/978-3-662-44199-2_24

Dragoi, Cezara, et al. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.”10.1007/978-3-642-39799-8_11__Computer Aided Verification, vol. 8044, Springer Berlin Heidelberg, 2013, pp. 174–90, doi:10.1007/978-3-642-39799-8_11.
LibreCat: https://research-explorer.ista.ac.at/record/5747
DOI: 10.1007/978-3-642-39799-8_11

Chatterjee, Krishnendu, et al. “How to Travel between Languages.”10.1007/978-3-642-37064-9_20__7th International Conference on Language and Automata Theory and Applications, vol. 7810, Springer Nature, 2013, pp. 214–25, doi:10.1007/978-3-642-37064-9_20.
LibreCat: https://research-explorer.ista.ac.at/record/10902
DOI: 10.1007/978-3-642-37064-9_20

Edelsbrunner, Herbert. “Persistent Homology in Image Processing.”10.1007/978-3-642-38221-5_19__Graph-Based Representations in Pattern Recognition, vol. 7877, Springer Nature, 2013, pp. 182–83, doi:10.1007/978-3-642-38221-5_19.
LibreCat: https://research-explorer.ista.ac.at/record/10897
DOI: 10.1007/978-3-642-38221-5_19

Colini-Baldeschi, Riccardo, et al. “On Multiple Keyword Sponsored Search Auctions with Budgets.”10.1007/978-3-642-31585-5_1__39th International Colloquium on Automata, Languages, and Programming, vol. 7392, Springer Nature, 2012, pp. 1–12, doi:10.1007/978-3-642-31585-5_1.
LibreCat: https://research-explorer.ista.ac.at/record/11795
DOI: 10.1007/978-3-642-31585-5_1

Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.”10.1007/978-3-642-32940-1_10__CONCUR 2012 - Concurrency Theory, edited by Maciej Koutny and Irek Ulidowski, vol. 7454, Springer, 2012, pp. 115–31, doi:10.1007/978-3-642-32940-1_10.
LibreCat: https://research-explorer.ista.ac.at/record/10904
DOI: 10.1007/978-3-642-32940-1_10
arXiv: 1201.5073

Bouajjani, Ahmed, et al. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.”10.1007/978-3-642-33386-6_14__Automated Technology for Verification and Analysis, vol. 7561, Springer, 2012, pp. 167–82, doi:10.1007/978-3-642-33386-6_14.
LibreCat: https://research-explorer.ista.ac.at/record/10903
DOI: 10.1007/978-3-642-33386-6_14

Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.”10.1007/978-3-642-33090-2_27__Algorithms – ESA 2012, vol. 7501, Springer, 2012, pp. 301–12, doi:10.1007/978-3-642-33090-2_27.
LibreCat: https://research-explorer.ista.ac.at/record/10905
DOI: 10.1007/978-3-642-33090-2_27
arXiv: 1604.08234

Grebenshchikov, Sergey, et al. “HSF(C): A Software Verifier Based on Horn Clauses.”10.1007/978-3-642-28756-5_46__Tools and Algorithms for the Construction and Analysis of Systems, edited by Cormac Flanagan and Barbara König, vol. 7214, Springer, 2012, pp. 549–51, doi:10.1007/978-3-642-28756-5_46.
LibreCat: https://research-explorer.ista.ac.at/record/10906
DOI: 10.1007/978-3-642-28756-5_46

Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.”10.1007/978-3-642-33386-6_10__Automated Technology for Verification and Analysis, vol. 7561, Springer Berlin Heidelberg, 2012, pp. 107–21, doi:10.1007/978-3-642-33386-6_10.
LibreCat: https://research-explorer.ista.ac.at/record/5745
DOI: 10.1007/978-3-642-33386-6_10

Artner, Nicole M., et al. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.”10.1007/978-3-642-20844-7_22__Graph-Based Representations in Pattern Recognition, edited by Xiaoyi Jiang et al., vol. 6658, Springer, 2011, pp. 215–24, doi:10.1007/978-3-642-20844-7_22.
LibreCat: https://research-explorer.ista.ac.at/record/10907
DOI: 10.1007/978-3-642-20844-7_22

Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.”10.1007/978-3-642-17511-4_7__Logic for Programming, Artificial Intelligence, and Reasoning, edited by Edmund M Clarke and Andrei Voronkov, vol. 6355, Springer Nature, 2010, pp. 103–18, doi:10.1007/978-3-642-17511-4_7.
LibreCat: https://research-explorer.ista.ac.at/record/10908
DOI: 10.1007/978-3-642-17511-4_7

Juhás, Gabriel, et al. “Instance Deadlock: A Mystery behind Frozen Programs.”10.1007/978-3-642-13675-7_1__Applications and Theory of Petri Nets, Springer Berlin Heidelberg, 2010, pp. 1–17, doi:10.1007/978-3-642-13675-7_1.
LibreCat: https://research-explorer.ista.ac.at/record/5940
DOI: 10.1007/978-3-642-13675-7_1

Henzinger, Monika H. “Algorithmic Aspects of Web Search Engines.”10.1007/978-3-540-30140-0_2__2th Annual European Symposium on Algorithms, vol. 3221, Springer Nature, 2004, p. 3, doi:10.1007/978-3-540-30140-0_2.
LibreCat: https://research-explorer.ista.ac.at/record/11801
DOI: 10.1007/978-3-540-30140-0_2

Henzinger, Monika H. “The Past, Present, and Future of Web Search Engines.”10.1007/978-3-540-27836-8_2__31st International Colloquium on Automata, Languages and Programming, vol. 3142, Springer Nature, 2004, p. 3, doi:10.1007/978-3-540-27836-8_2.
LibreCat: https://research-explorer.ista.ac.at/record/11800
DOI: 10.1007/978-3-540-27836-8_2

Henzinger, Monika H. “Web Information Retrieval - an Algorithmic Perspective.”10.1007/3-540-45253-2_1__8th Annual European Symposium on Algorithms, vol. 1879, Springer Nature, 2000, pp. 1–8, doi:10.1007/3-540-45253-2_1.
LibreCat: https://research-explorer.ista.ac.at/record/11802
DOI: 10.1007/3-540-45253-2_1

Henzinger, Monika H., and Valerie King. “Maintaining Minimum Spanning Trees in Dynamic Graphs.”10.1007/3-540-63165-8_214__24th International Colloquium on Automata, Languages and Programming, vol. 1256, Springer Nature, 1997, pp. 594–604, doi:10.1007/3-540-63165-8_214.
LibreCat: https://research-explorer.ista.ac.at/record/11803
DOI: 10.1007/3-540-63165-8_214

Henzinger, Monika H., and Jan Arne Telle. “Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning.”10.1007/3-540-61422-2_117__5th Scandinavian Workshop on Algorithm Theory, vol. 1097, Springer Nature, 1996, pp. 16–27, doi:10.1007/3-540-61422-2_117.
LibreCat: https://research-explorer.ista.ac.at/record/11804
DOI: 10.1007/3-540-61422-2_117

Henzinger, Monika H., and Mikkel Thorup. “Improved Sampling with Applications to Dynamic Graph Algorithms.”10.1007/3-540-61440-0_136__23rd International Colloquium on Automata, Languages, and Programming, vol. 1099, Springer Nature, 1996, pp. 290–99, doi:10.1007/3-540-61440-0_136.
LibreCat: https://research-explorer.ista.ac.at/record/11910
DOI: 10.1007/3-540-61440-0_136

Alur, Rajeev, et al., editors. Hybrid Systems III: Verification and Control. Vol. 1066, Springer, 1996, doi:10.1007/BFb0020931.
LibreCat: https://research-explorer.ista.ac.at/record/4612
DOI: 10.1007/BFb0020931

Henzinger, Monika H. “Approximating Minimum Cuts under Insertions.”10.1007/3-540-60084-1_81__22nd International Colloquium on Automata, Languages and Programming, vol. 944, Springer Nature, 1995, pp. 280–291, doi:10.1007/3-540-60084-1_81.
LibreCat: https://research-explorer.ista.ac.at/record/11806
DOI: 10.1007/3-540-60084-1_81

Henzinger, Monika H., and Han Poutré. “Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs.”10.1007/3-540-60313-1_142__3rd Annual European Symposium on Algorithms, vol. 979, Springer Nature, 1995, pp. 171–184, doi:10.1007/3-540-60313-1_142.
LibreCat: https://research-explorer.ista.ac.at/record/11805
DOI: 10.1007/3-540-60313-1_142