[{"volume":11477,"isi":1,"publication_identifier":{"issn":["0302-9743"],"isbn":["9783030176556","9783030176563"],"eissn":["1611-3349"]},"quality_controlled":"1","month":"04","intvolume":"     11477","conference":{"end_date":"2019-05-23","start_date":"2019-05-19","name":"International Conference on the Theory and Applications of Cryptographic Techniques","location":"Darmstadt, Germany"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","department":[{"_id":"KrPi"}],"date_created":"2020-01-30T09:26:14Z","date_published":"2019-04-24T00:00:00Z","_id":"7411","oa":1,"author":[{"id":"40297222-F248-11E8-B48F-1D18A9856A87","last_name":"Abusalah","first_name":"Hamza M","full_name":"Abusalah, Hamza M"},{"first_name":"Chethan","full_name":"Kamath Hosdurg, Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","last_name":"Kamath Hosdurg"},{"last_name":"Klein","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","first_name":"Karen","full_name":"Klein, Karen"},{"orcid":"0000-0002-9139-1654","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"},{"full_name":"Walter, Michael","first_name":"Michael","last_name":"Walter","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3186-2482"}],"type":"conference","year":"2019","publisher":"Springer International Publishing","doi":"10.1007/978-3-030-17656-3_10","language":[{"iso":"eng"}],"title":"Reversible proofs of sequential work","external_id":{"isi":["000483516200010"]},"publication":"Advances in Cryptology – EUROCRYPT 2019","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/252"}],"alternative_title":["LNCS"],"scopus_import":"1","citation":{"ieee":"H. M. Abusalah, C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “Reversible proofs of sequential work,” in <i>Advances in Cryptology – EUROCRYPT 2019</i>, Darmstadt, Germany, 2019, vol. 11477, pp. 277–291.","chicago":"Abusalah, Hamza M, Chethan Kamath Hosdurg, Karen Klein, Krzysztof Z Pietrzak, and Michael Walter. “Reversible Proofs of Sequential Work.” In <i>Advances in Cryptology – EUROCRYPT 2019</i>, 11477:277–91. Springer International Publishing, 2019. <a href=\"https://doi.org/10.1007/978-3-030-17656-3_10\">https://doi.org/10.1007/978-3-030-17656-3_10</a>.","ama":"Abusalah HM, Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. Reversible proofs of sequential work. In: <i>Advances in Cryptology – EUROCRYPT 2019</i>. Vol 11477. Springer International Publishing; 2019:277-291. doi:<a href=\"https://doi.org/10.1007/978-3-030-17656-3_10\">10.1007/978-3-030-17656-3_10</a>","apa":"Abusalah, H. M., Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &#38; Walter, M. (2019). Reversible proofs of sequential work. In <i>Advances in Cryptology – EUROCRYPT 2019</i> (Vol. 11477, pp. 277–291). Darmstadt, Germany: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-17656-3_10\">https://doi.org/10.1007/978-3-030-17656-3_10</a>","ista":"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.","short":"H.M. Abusalah, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, Advances in Cryptology – EUROCRYPT 2019, Springer International Publishing, 2019, pp. 277–291.","mla":"Abusalah, Hamza M., et al. “Reversible Proofs of Sequential Work.” <i>Advances in Cryptology – EUROCRYPT 2019</i>, vol. 11477, Springer International Publishing, 2019, pp. 277–91, doi:<a href=\"https://doi.org/10.1007/978-3-030-17656-3_10\">10.1007/978-3-030-17656-3_10</a>."},"project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815","call_identifier":"H2020"}],"abstract":[{"text":"Proofs of sequential work (PoSW) are proof systems where a prover, upon receiving a statement χ and a time parameter T computes a proof ϕ(χ,T) which is efficiently and publicly verifiable. The proof can be computed in T sequential steps, but not much less, even by a malicious party having large parallelism. A PoSW thus serves as a proof that T units of time have passed since χ\r\n\r\nwas received.\r\n\r\nPoSW were introduced by Mahmoody, Moran and Vadhan [MMV11], a simple and practical construction was only recently proposed by Cohen and Pietrzak [CP18].\r\n\r\nIn this work we construct a new simple PoSW in the random permutation model which is almost as simple and efficient as [CP18] but conceptually very different. Whereas the structure underlying [CP18] is a hash tree, our construction is based on skip lists and has the interesting property that computing the PoSW is a reversible computation.\r\nThe fact that the construction is reversible can potentially be used for new applications like constructing proofs of replication. We also show how to “embed” the sloth function of Lenstra and Weselowski [LW17] into our PoSW to get a PoSW where one additionally can verify correctness of the output much more efficiently than recomputing it (though recent constructions of “verifiable delay functions” subsume most of the applications this construction was aiming at).","lang":"eng"}],"ec_funded":1,"day":"24","page":"277-291","oa_version":"Submitted Version","publication_status":"published","status":"public","date_updated":"2023-09-06T15:26:06Z"},{"type":"conference","status":"public","year":"2019","publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-27T14:25:17Z","doi":"10.1007/978-3-030-14085-4_3","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We propose a new non-orthogonal basis to express the 3D Euclidean space in terms of a regular grid. Every grid point, each represented by integer 3-coordinates, corresponds to rhombic dodecahedron centroid. Rhombic dodecahedron is a space filling polyhedron which represents the close packing of spheres in 3D space and the Voronoi structures of the face centered cubic (FCC) lattice. In order to illustrate the interest of the new coordinate system, we propose the characterization of 3D digital plane with its topological features, such as the interrelation between the thickness of the digital plane and the separability constraint we aim to obtain. A characterization of a 3D digital sphere with relevant topological features is proposed as well with the help of a 48 symmetry that comes with the new coordinate system."}],"day":"23","page":"27-37","date_published":"2019-02-23T00:00:00Z","publication_status":"published","oa_version":"None","_id":"6163","author":[{"orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas","first_name":"Ranita","full_name":"Biswas, Ranita"},{"last_name":"Largeteau-Skapin","full_name":"Largeteau-Skapin, Gaëlle","first_name":"Gaëlle"},{"last_name":"Zrour","first_name":"Rita","full_name":"Zrour, Rita"},{"last_name":"Andres","first_name":"Eric","full_name":"Andres, Eric"}],"intvolume":"     11414","alternative_title":["LNCS"],"conference":{"location":"Marne-la-Vallée, France","start_date":"2019-03-26","end_date":"2019-03-28","name":"DGCI: International Conference on Discrete Geometry for Computer Imagery"},"place":"Berlin, Heidelberg","extern":"1","article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ista":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. 2019. Rhombic dodecahedron grid—coordinate system and 3D digital object definitions. 21st IAPR International Conference on Discrete Geometry for Computer Imagery. DGCI: International Conference on Discrete Geometry for Computer Imagery, LNCS, vol. 11414, 27–37.","apa":"Biswas, R., Largeteau-Skapin, G., Zrour, R., &#38; Andres, E. (2019). Rhombic dodecahedron grid—coordinate system and 3D digital object definitions. In <i>21st IAPR International Conference on Discrete Geometry for Computer Imagery</i> (Vol. 11414, pp. 27–37). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-030-14085-4_3\">https://doi.org/10.1007/978-3-030-14085-4_3</a>","short":"R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, in:, 21st IAPR International Conference on Discrete Geometry for Computer Imagery, Springer Berlin Heidelberg, Berlin, Heidelberg, 2019, pp. 27–37.","mla":"Biswas, Ranita, et al. “Rhombic Dodecahedron Grid—Coordinate System and 3D Digital Object Definitions.” <i>21st IAPR International Conference on Discrete Geometry for Computer Imagery</i>, vol. 11414, Springer Berlin Heidelberg, 2019, pp. 27–37, doi:<a href=\"https://doi.org/10.1007/978-3-030-14085-4_3\">10.1007/978-3-030-14085-4_3</a>.","ama":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. Rhombic dodecahedron grid—coordinate system and 3D digital object definitions. In: <i>21st IAPR International Conference on Discrete Geometry for Computer Imagery</i>. Vol 11414. Berlin, Heidelberg: Springer Berlin Heidelberg; 2019:27-37. doi:<a href=\"https://doi.org/10.1007/978-3-030-14085-4_3\">10.1007/978-3-030-14085-4_3</a>","chicago":"Biswas, Ranita, Gaëlle Largeteau-Skapin, Rita Zrour, and Eric Andres. “Rhombic Dodecahedron Grid—Coordinate System and 3D Digital Object Definitions.” In <i>21st IAPR International Conference on Discrete Geometry for Computer Imagery</i>, 11414:27–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2019. <a href=\"https://doi.org/10.1007/978-3-030-14085-4_3\">https://doi.org/10.1007/978-3-030-14085-4_3</a>.","ieee":"R. Biswas, G. Largeteau-Skapin, R. Zrour, and E. Andres, “Rhombic dodecahedron grid—coordinate system and 3D digital object definitions,” in <i>21st IAPR International Conference on Discrete Geometry for Computer Imagery</i>, Marne-la-Vallée, France, 2019, vol. 11414, pp. 27–37."},"date_created":"2019-03-21T12:12:19Z","title":"Rhombic dodecahedron grid—coordinate system and 3D digital object definitions","volume":11414,"publication":"21st IAPR International Conference on Discrete Geometry for Computer Imagery","publication_identifier":{"isbn":["978-3-6624-6446-5","978-3-6624-6447-2"],"issn":["0302-9743","1611-3349"]},"quality_controlled":"1","month":"02"},{"date_created":"2019-05-16T11:22:30Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"conference":{"location":"New York, NY, United States","name":"CAV: Computer Aided Verification","start_date":"2019-07-13","end_date":"2019-07-18"},"file_date_updated":"2020-07-14T12:47:31Z","ddc":["000"],"article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":"     11561","month":"07","publication_identifier":{"isbn":["9783030255398"],"issn":["0302-9743"]},"quality_controlled":"1","isi":1,"volume":11561,"doi":"10.1007/978-3-030-25540-4_36","language":[{"iso":"eng"}],"year":"2019","publisher":"Springer","type":"conference","author":[{"orcid":"0000-0001-5588-8287","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy","first_name":"Guy"},{"full_name":"Bloem, Roderick","first_name":"Roderick","last_name":"Bloem"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"first_name":"Bettina","full_name":"Konighofer, Bettina","last_name":"Konighofer"},{"last_name":"Pranger","first_name":"Stefan","full_name":"Pranger, Stefan"}],"_id":"6462","oa":1,"date_published":"2019-07-12T00:00:00Z","citation":{"ieee":"G. Avni, R. Bloem, K. Chatterjee, T. A. Henzinger, B. Konighofer, and S. Pranger, “Run-time optimization for learned controllers through quantitative games,” in <i>31st International Conference on Computer-Aided Verification</i>, New York, NY, United States, 2019, vol. 11561, pp. 630–649.","chicago":"Avni, Guy, Roderick Bloem, Krishnendu Chatterjee, Thomas A Henzinger, Bettina Konighofer, and Stefan Pranger. “Run-Time Optimization for Learned Controllers through Quantitative Games.” In <i>31st International Conference on Computer-Aided Verification</i>, 11561:630–49. Springer, 2019. <a href=\"https://doi.org/10.1007/978-3-030-25540-4_36\">https://doi.org/10.1007/978-3-030-25540-4_36</a>.","ama":"Avni G, Bloem R, Chatterjee K, Henzinger TA, Konighofer B, Pranger S. Run-time optimization for learned controllers through quantitative games. In: <i>31st International Conference on Computer-Aided Verification</i>. Vol 11561. Springer; 2019:630-649. doi:<a href=\"https://doi.org/10.1007/978-3-030-25540-4_36\">10.1007/978-3-030-25540-4_36</a>","short":"G. Avni, R. Bloem, K. Chatterjee, T.A. Henzinger, B. Konighofer, S. Pranger, in:, 31st International Conference on Computer-Aided Verification, Springer, 2019, pp. 630–649.","apa":"Avni, G., Bloem, R., Chatterjee, K., Henzinger, T. A., Konighofer, B., &#38; Pranger, S. (2019). Run-time optimization for learned controllers through quantitative games. In <i>31st International Conference on Computer-Aided Verification</i> (Vol. 11561, pp. 630–649). New York, NY, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-030-25540-4_36\">https://doi.org/10.1007/978-3-030-25540-4_36</a>","mla":"Avni, Guy, et al. “Run-Time Optimization for Learned Controllers through Quantitative Games.” <i>31st International Conference on Computer-Aided Verification</i>, vol. 11561, Springer, 2019, pp. 630–49, doi:<a href=\"https://doi.org/10.1007/978-3-030-25540-4_36\">10.1007/978-3-030-25540-4_36</a>.","ista":"Avni G, Bloem R, Chatterjee K, Henzinger TA, Konighofer B, Pranger S. 2019. Run-time optimization for learned controllers through quantitative games. 31st International Conference on Computer-Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 11561, 630–649."},"project":[{"_id":"264B3912-B435-11E9-9278-68D0E5697425","name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF","grant_number":"M02369"},{"call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"scopus_import":"1","has_accepted_license":"1","alternative_title":["LNCS"],"publication":"31st International Conference on Computer-Aided Verification","file":[{"creator":"dernst","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"2019_CAV_Avni.pdf","file_size":659766,"checksum":"c231579f2485c6fd4df17c9443a4d80b","date_created":"2019-08-14T09:35:24Z","file_id":"6816","date_updated":"2020-07-14T12:47:31Z"}],"title":"Run-time optimization for learned controllers through quantitative games","external_id":{"isi":["000491468000036"]},"date_updated":"2023-08-25T10:33:27Z","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"day":"12","page":"630-649","oa_version":"Published Version","publication_status":"published","abstract":[{"lang":"eng","text":"A controller is a device that interacts with a plant. At each time point,it reads the plant’s state and issues commands with the goal that the plant oper-ates optimally. Constructing optimal controllers is a fundamental and challengingproblem. Machine learning techniques have recently been successfully applied totrain controllers, yet they have limitations. Learned controllers are monolithic andhard to reason about. In particular, it is difficult to add features without retraining,to guarantee any level of performance, and to achieve acceptable performancewhen encountering untrained scenarios. These limitations can be addressed bydeploying quantitative run-timeshieldsthat serve as a proxy for the controller.At each time point, the shield reads the command issued by the controller andmay choose to alter it before passing it on to the plant. We show how optimalshields that interfere as little as possible while guaranteeing a desired level ofcontroller performance, can be generated systematically and automatically usingreactive  synthesis.  First,  we  abstract  the  plant  by  building  a  stochastic  model.Second, we consider the learned controller to be a black box. Third, we mea-surecontroller performanceandshield interferenceby two quantitative run-timemeasures that are formally defined using weighted automata. Then, the problemof constructing a shield that guarantees maximal performance with minimal inter-ference is the problem of finding an optimal strategy in a stochastic2-player game“controller versus shield” played on the abstract state space of the plant with aquantitative objective obtained from combining the performance and interferencemeasures. We illustrate the effectiveness of our approach by automatically con-structing lightweight shields for learned traffic-light controllers in various roadnetworks. The shields we generate avoid liveness bugs, improve controller per-formance in untrained and changing traffic situations, and add features to learnedcontrollers, such as giving priority to emergency vehicles."}]},{"oa_version":"Preprint","publication_status":"published","page":"244-259","day":"14","ec_funded":1,"abstract":[{"text":"Computer vision systems for automatic image categorization have become accurate and reliable enough that they can run continuously for days or even years as components of real-world commercial applications. A major open problem in this context, however, is quality control. Good classification performance can only be expected if systems run under the specific conditions, in particular data distributions, that they were trained for. Surprisingly, none of the currently used deep network architectures have a built-in functionality that could detect if a network operates on data from a distribution it was not trained for, such that potentially a warning to the human users could be triggered. In this work, we describe KS(conf), a procedure for detecting such outside of specifications (out-of-specs) operation, based on statistical testing of the network outputs. We show by extensive experiments using the ImageNet, AwA2 and DAVIS datasets on a variety of ConvNets architectures that KS(conf) reliably detects out-of-specs situations. It furthermore has a number of properties that make it a promising candidate for practical deployment: it is easy to implement, adds almost no overhead to the system, works with all networks, including pretrained ones, and requires no a priori knowledge of how the data distribution could change. ","lang":"eng"}],"date_updated":"2024-02-22T14:57:29Z","status":"public","main_file_link":[{"url":"https://arxiv.org/abs/1804.04171","open_access":"1"}],"external_id":{"arxiv":["1804.04171"]},"related_material":{"record":[{"id":"6944","status":"public","relation":"later_version"}]},"title":"KS(conf): A light-weight test if a ConvNet operates outside of Its specifications","project":[{"call_identifier":"FP7","grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"arxiv":1,"citation":{"ieee":"R. Sun and C. Lampert, “KS(conf): A light-weight test if a ConvNet operates outside of Its specifications,” presented at the GCPR: Conference on Pattern Recognition, Stuttgart, Germany, 2019, vol. 11269, pp. 244–259.","chicago":"Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a ConvNet Operates Outside of Its Specifications,” 11269:244–59. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-030-12939-2_18\">https://doi.org/10.1007/978-3-030-12939-2_18</a>.","ama":"Sun R, Lampert C. KS(conf): A light-weight test if a ConvNet operates outside of Its specifications. In: Vol 11269. Springer Nature; 2019:244-259. doi:<a href=\"https://doi.org/10.1007/978-3-030-12939-2_18\">10.1007/978-3-030-12939-2_18</a>","ista":"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.","short":"R. Sun, C. Lampert, in:, Springer Nature, 2019, pp. 244–259.","mla":"Sun, Rémy, and Christoph Lampert. <i>KS(Conf): A Light-Weight Test If a ConvNet Operates Outside of Its Specifications</i>. Vol. 11269, Springer Nature, 2019, pp. 244–59, doi:<a href=\"https://doi.org/10.1007/978-3-030-12939-2_18\">10.1007/978-3-030-12939-2_18</a>.","apa":"Sun, R., &#38; Lampert, C. (2019). KS(conf): A light-weight test if a ConvNet operates outside of Its specifications (Vol. 11269, pp. 244–259). Presented at the GCPR: Conference on Pattern Recognition, Stuttgart, Germany: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-12939-2_18\">https://doi.org/10.1007/978-3-030-12939-2_18</a>"},"scopus_import":"1","alternative_title":["LNCS"],"author":[{"full_name":"Sun, Rémy","first_name":"Rémy","last_name":"Sun"},{"full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","orcid":"0000-0001-8622-7887"}],"oa":1,"_id":"6482","date_published":"2019-02-14T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-12939-2_18","publisher":"Springer Nature","year":"2019","type":"conference","month":"02","quality_controlled":"1","publication_identifier":{"isbn":["9783030129385","9783030129392"],"issn":["0302-9743"],"eissn":["1611-3349"]},"volume":11269,"date_created":"2019-05-24T09:48:36Z","department":[{"_id":"ChLa"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","conference":{"location":"Stuttgart, Germany","name":"GCPR: Conference on Pattern Recognition","start_date":"2018-10-09","end_date":"2018-10-12"},"intvolume":"     11269"},{"date_published":"2019-07-12T00:00:00Z","_id":"6493","oa":1,"author":[{"id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","last_name":"Garcia Soto","orcid":"0000−0003−2936−5719","first_name":"Miriam","full_name":"Garcia Soto, Miriam"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Schilling, Christian","first_name":"Christian","last_name":"Schilling","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065"},{"first_name":"Luka","full_name":"Zeleznik, Luka","last_name":"Zeleznik","id":"3ADCA2E4-F248-11E8-B48F-1D18A9856A87"}],"type":"conference","year":"2019","publisher":"Springer","doi":"10.1007/978-3-030-25540-4_16","language":[{"iso":"eng"}],"volume":11561,"isi":1,"publication_identifier":{"isbn":["9783030255398"],"issn":["0302-9743"]},"quality_controlled":"1","month":"07","intvolume":"     11561","keyword":["Synthesis","Linear hybrid automaton","Membership"],"conference":{"location":"New York City, NY, USA","name":"CAV: Computer-Aided Verification","end_date":"2019-07-18","start_date":"2019-07-15"},"file_date_updated":"2020-07-14T12:47:32Z","article_processing_charge":"No","ddc":["000"],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"ToHe"}],"date_created":"2019-05-27T07:09:53Z","abstract":[{"text":"We present two algorithmic approaches for synthesizing linear hybrid automata from experimental data. Unlike previous approaches, our algorithms work without a template and generate an automaton with nondeterministic guards and invariants, and with an arbitrary number and topology of modes. They thus construct a succinct model from the data and provide formal guarantees. In particular, (1) the generated automaton can reproduce the data up to a specified tolerance and (2) the automaton is tight, given the first guarantee. Our first approach encodes the synthesis problem as a logical formula in the theory of linear arithmetic, which can then be solved by an SMT solver. This approach minimizes the number of modes in the resulting model but is only feasible for limited data sets. To address scalability, we propose a second approach that does not enforce to find a minimal model. The algorithm constructs an initial automaton and then iteratively extends the automaton based on processing new data. Therefore the algorithm is well-suited for online and synthesis-in-the-loop applications. The core of the algorithm is a membership query that checks whether, within the specified tolerance, a given data set can result from the execution of a given automaton. We solve this membership problem for linear hybrid automata by repeated reachability computations. We demonstrate the effectiveness of the algorithm on synthetic data sets and on cardiac-cell measurements.","lang":"eng"}],"ec_funded":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"day":"12","page":"297-314","oa_version":"Published Version","publication_status":"published","status":"public","date_updated":"2023-08-25T10:40:41Z","file":[{"file_size":674795,"file_name":"2019_CAV_GarciaSoto.pdf","date_updated":"2020-07-14T12:47:32Z","checksum":"1f1d61b83a151031745ef70a501da3d6","date_created":"2019-08-14T11:05:30Z","file_id":"6817","creator":"dernst","relation":"main_file","content_type":"application/pdf","access_level":"open_access"}],"title":"Membership-based synthesis of linear hybrid automata","external_id":{"isi":["000491468000016"]},"publication":"31st International Conference on Computer-Aided Verification","has_accepted_license":"1","alternative_title":["LNCS"],"scopus_import":"1","citation":{"ieee":"M. Garcia Soto, T. A. Henzinger, C. Schilling, and L. Zeleznik, “Membership-based synthesis of linear hybrid automata,” in <i>31st International Conference on Computer-Aided Verification</i>, New York City, NY, USA, 2019, vol. 11561, pp. 297–314.","chicago":"Garcia Soto, Miriam, Thomas A Henzinger, Christian Schilling, and Luka Zeleznik. “Membership-Based Synthesis of Linear Hybrid Automata.” In <i>31st International Conference on Computer-Aided Verification</i>, 11561:297–314. Springer, 2019. <a href=\"https://doi.org/10.1007/978-3-030-25540-4_16\">https://doi.org/10.1007/978-3-030-25540-4_16</a>.","ama":"Garcia Soto M, Henzinger TA, Schilling C, Zeleznik L. Membership-based synthesis of linear hybrid automata. In: <i>31st International Conference on Computer-Aided Verification</i>. Vol 11561. Springer; 2019:297-314. doi:<a href=\"https://doi.org/10.1007/978-3-030-25540-4_16\">10.1007/978-3-030-25540-4_16</a>","ista":"Garcia Soto M, Henzinger TA, Schilling C, Zeleznik L. 2019. Membership-based synthesis of linear hybrid automata. 31st International Conference on Computer-Aided Verification. CAV: Computer-Aided Verification, LNCS, vol. 11561, 297–314.","short":"M. Garcia Soto, T.A. Henzinger, C. Schilling, L. Zeleznik, in:, 31st International Conference on Computer-Aided Verification, Springer, 2019, pp. 297–314.","mla":"Garcia Soto, Miriam, et al. “Membership-Based Synthesis of Linear Hybrid Automata.” <i>31st International Conference on Computer-Aided Verification</i>, vol. 11561, Springer, 2019, pp. 297–314, doi:<a href=\"https://doi.org/10.1007/978-3-030-25540-4_16\">10.1007/978-3-030-25540-4_16</a>.","apa":"Garcia Soto, M., Henzinger, T. A., Schilling, C., &#38; Zeleznik, L. (2019). Membership-based synthesis of linear hybrid automata. In <i>31st International Conference on Computer-Aided Verification</i> (Vol. 11561, pp. 297–314). New York City, NY, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-030-25540-4_16\">https://doi.org/10.1007/978-3-030-25540-4_16</a>"},"project":[{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF"}]},{"quality_controlled":"1","publication_identifier":{"eisbn":["9783319990736"],"isbn":["9783319990729"],"issn":["0302-9743","1611-3349"]},"month":"08","volume":11098,"title":"Channels: Horizontal scaling and confidentiality on permissioned blockchains","publication":"Computer Security","citation":{"ama":"Androulaki E, Cachin C, De Caro A, Kokoris Kogias E. Channels: Horizontal scaling and confidentiality on permissioned blockchains. In: <i>Computer Security</i>. Vol 11098. Springer Nature; 2018:111-131. doi:<a href=\"https://doi.org/10.1007/978-3-319-99073-6_6\">10.1007/978-3-319-99073-6_6</a>","apa":"Androulaki, E., Cachin, C., De Caro, A., &#38; Kokoris Kogias, E. (2018). Channels: Horizontal scaling and confidentiality on permissioned blockchains. In <i>Computer Security</i> (Vol. 11098, pp. 111–131). Barcelona, Spain: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-99073-6_6\">https://doi.org/10.1007/978-3-319-99073-6_6</a>","ista":"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.","short":"E. Androulaki, C. Cachin, A. De Caro, E. Kokoris Kogias, in:, Computer Security, Springer Nature, 2018, pp. 111–131.","mla":"Androulaki, Elli, et al. “Channels: Horizontal Scaling and Confidentiality on Permissioned Blockchains.” <i>Computer Security</i>, vol. 11098, Springer Nature, 2018, pp. 111–31, doi:<a href=\"https://doi.org/10.1007/978-3-319-99073-6_6\">10.1007/978-3-319-99073-6_6</a>.","ieee":"E. Androulaki, C. Cachin, A. De Caro, and E. Kokoris Kogias, “Channels: Horizontal scaling and confidentiality on permissioned blockchains,” in <i>Computer Security</i>, Barcelona, Spain, 2018, vol. 11098, pp. 111–131.","chicago":"Androulaki, Elli, Christian Cachin, Angelo De Caro, and Eleftherios Kokoris Kogias. “Channels: Horizontal Scaling and Confidentiality on Permissioned Blockchains.” In <i>Computer Security</i>, 11098:111–31. Springer Nature, 2018. <a href=\"https://doi.org/10.1007/978-3-319-99073-6_6\">https://doi.org/10.1007/978-3-319-99073-6_6</a>."},"date_created":"2020-08-26T11:47:34Z","alternative_title":["LNCS"],"intvolume":"     11098","extern":"1","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2018-09-07","start_date":"2018-09-03","name":"ESORICS: European Symposium on Research in Computer Security","location":"Barcelona, Spain"},"_id":"8298","author":[{"first_name":"Elli","full_name":"Androulaki, Elli","last_name":"Androulaki"},{"first_name":"Christian","full_name":"Cachin, Christian","last_name":"Cachin"},{"last_name":"De Caro","first_name":"Angelo","full_name":"De Caro, Angelo"},{"full_name":"Kokoris Kogias, Eleftherios","first_name":"Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","last_name":"Kokoris Kogias"}],"abstract":[{"lang":"eng","text":"Sharding, or partitioning the system’s state so that different subsets of participants handle it, is a proven approach to building distributed systems whose total capacity scales horizontally with the number of participants. Many distributed ledgers have adopted this approach to increase their performance, however, they focus on the permissionless setting that assumes the existence of a strong adversary. In this paper, we deploy channels for permissioned blockchains. Our first contribution is to adapt sharding on asset-management applications for the permissioned setting, while preserving liveness and safety even on transactions spanning across-channels. Our second contribution is to leverage channels as a confidentiality boundary, enabling different organizations and consortia to preserve their privacy within their channels and still be part of a bigger collaborative ecosystem. To make our system concrete we map it on top of Hyperledger Fabric."}],"oa_version":"None","publication_status":"published","date_published":"2018-08-08T00:00:00Z","page":"111-131","day":"08","publisher":"Springer Nature","date_updated":"2021-01-12T08:17:57Z","year":"2018","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-99073-6_6","type":"conference","status":"public"},{"year":"2018","publisher":"Springer Nature","doi":"10.1007/978-3-662-58387-6_26","language":[{"iso":"eng"}],"type":"conference","_id":"6941","oa":1,"author":[{"first_name":"Sunoo","full_name":"Park, Sunoo","last_name":"Park"},{"full_name":"Kwon, Albert","first_name":"Albert","last_name":"Kwon"},{"full_name":"Fuchsbauer, Georg","first_name":"Georg","last_name":"Fuchsbauer","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87"},{"id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","last_name":"Gazi","first_name":"Peter","full_name":"Gazi, Peter"},{"last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F","full_name":"Alwen, Joel F"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z"}],"date_published":"2018-12-07T00:00:00Z","department":[{"_id":"KrPi"}],"date_created":"2019-10-14T06:35:38Z","intvolume":"     10957","conference":{"location":"Nieuwpoort, Curacao","name":"FC: Financial Cryptography and Data Security","end_date":"2018-03-02","start_date":"2018-02-26"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","publication_identifier":{"isbn":["9783662583869","9783662583876"],"issn":["0302-9743"],"eissn":["1611-3349"]},"quality_controlled":"1","month":"12","volume":10957,"isi":1,"date_updated":"2023-09-19T15:02:13Z","status":"public","abstract":[{"text":"Bitcoin has become the most successful cryptocurrency ever deployed, and its most distinctive feature is that it is decentralized. Its underlying protocol (Nakamoto consensus) achieves this by using proof of work, which has the drawback that it causes the consumption of vast amounts of energy to maintain the ledger. Moreover, Bitcoin mining dynamics have become less distributed over time.\r\n\r\nTowards addressing these issues, we propose SpaceMint, a cryptocurrency based on proofs of space instead of proofs of work. Miners in SpaceMint dedicate disk space rather than computation. We argue that SpaceMint’s design solves or alleviates several of Bitcoin’s issues: most notably, its large energy consumption. SpaceMint also rewards smaller miners fairly according to their contribution to the network, thus incentivizing more distributed participation.\r\n\r\nThis paper adapts proof of space to enable its use in cryptocurrency, studies the attacks that can arise against a Bitcoin-like blockchain that uses proof of space, and proposes a new blockchain format and transaction types to address these attacks. Our prototype shows that initializing 1 TB for mining takes about a day (a one-off setup cost), and miners spend on average just a fraction of a second per block mined. Finally, we provide a game-theoretic analysis modeling SpaceMint as an extensive game (the canonical game-theoretic notion for games that take place over time) and show that this stylized game satisfies a strong equilibrium notion, thereby arguing for SpaceMint ’s stability and consensus.","lang":"eng"}],"ec_funded":1,"day":"07","page":"480-499","publication_status":"published","oa_version":"Submitted Version","citation":{"ama":"Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. SpaceMint: A cryptocurrency based on proofs of space. In: <i>22nd International Conference on Financial Cryptography and Data Security</i>. Vol 10957. Springer Nature; 2018:480-499. doi:<a href=\"https://doi.org/10.1007/978-3-662-58387-6_26\">10.1007/978-3-662-58387-6_26</a>","mla":"Park, Sunoo, et al. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” <i>22nd International Conference on Financial Cryptography and Data Security</i>, vol. 10957, Springer Nature, 2018, pp. 480–99, doi:<a href=\"https://doi.org/10.1007/978-3-662-58387-6_26\">10.1007/978-3-662-58387-6_26</a>.","apa":"Park, S., Kwon, A., Fuchsbauer, G., Gazi, P., Alwen, J. F., &#38; Pietrzak, K. Z. (2018). SpaceMint: A cryptocurrency based on proofs of space. In <i>22nd International Conference on Financial Cryptography and Data Security</i> (Vol. 10957, pp. 480–499). Nieuwpoort, Curacao: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-58387-6_26\">https://doi.org/10.1007/978-3-662-58387-6_26</a>","ista":"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.","short":"S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J.F. Alwen, K.Z. Pietrzak, in:, 22nd International Conference on Financial Cryptography and Data Security, Springer Nature, 2018, pp. 480–499.","ieee":"S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J. F. Alwen, and K. Z. Pietrzak, “SpaceMint: A cryptocurrency based on proofs of space,” in <i>22nd International Conference on Financial Cryptography and Data Security</i>, Nieuwpoort, Curacao, 2018, vol. 10957, pp. 480–499.","chicago":"Park, Sunoo, Albert Kwon, Georg Fuchsbauer, Peter Gazi, Joel F Alwen, and Krzysztof Z Pietrzak. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” In <i>22nd International Conference on Financial Cryptography and Data Security</i>, 10957:480–99. Springer Nature, 2018. <a href=\"https://doi.org/10.1007/978-3-662-58387-6_26\">https://doi.org/10.1007/978-3-662-58387-6_26</a>."},"project":[{"grant_number":"682815","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"alternative_title":["LNCS"],"scopus_import":"1","main_file_link":[{"url":"https://eprint.iacr.org/2015/528","open_access":"1"}],"title":"SpaceMint: A cryptocurrency based on proofs of space","external_id":{"isi":["000540656400026"]},"publication":"22nd International Conference on Financial Cryptography and Data Security"},{"abstract":[{"lang":"eng","text":"In this paper, we propose an algorithm to build discrete spherical shell having integer center and real-valued inner and outer radii on the face-centered cubic (FCC) grid. We address the problem by mapping it to a 2D scenario and building the shell layer by layer on hexagonal grids with additive manufacturing in mind. The layered hexagonal grids get shifted according to need as we move from one layer to another and forms the FCC grid in 3D. However, we restrict our computation strictly to 2D in order to utilize symmetry and simplicity."}],"day":"22","oa_version":"None","date_published":"2018-11-22T00:00:00Z","publication_status":"published","page":"82-96","_id":"6164","author":[{"last_name":"Koshti","full_name":"Koshti, Girish","first_name":"Girish"},{"first_name":"Ranita","full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas"},{"full_name":"Largeteau-Skapin, Gaëlle","first_name":"Gaëlle","last_name":"Largeteau-Skapin"},{"last_name":"Zrour","first_name":"Rita","full_name":"Zrour, Rita"},{"full_name":"Andres, Eric","first_name":"Eric","last_name":"Andres"},{"last_name":"Bhowmick","first_name":"Partha","full_name":"Bhowmick, Partha"}],"type":"conference","status":"public","year":"2018","date_updated":"2022-01-27T15:26:39Z","publisher":"Springer","doi":"10.1007/978-3-030-05288-1_7","language":[{"iso":"eng"}],"title":"Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D","volume":11255,"publication":"19th International Workshop","publication_identifier":{"eisbn":["978-3-030-05288-1"],"isbn":["978-3-030-05287-4"],"issn":["0302-9743"],"eissn":["1611-3349"]},"quality_controlled":"1","month":"11","intvolume":"     11255","alternative_title":["LNCS"],"conference":{"name":"IWCIA: International Workshop on Combinatorial Image Analysis","end_date":"2018-11-24","start_date":"2018-11-22","location":"Porto, Portugal"},"place":"Cham","extern":"1","article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"apa":"Koshti, G., Biswas, R., Largeteau-Skapin, G., Zrour, R., Andres, E., &#38; Bhowmick, P. (2018). Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D. In <i>19th International Workshop</i> (Vol. 11255, pp. 82–96). Cham: Springer. <a href=\"https://doi.org/10.1007/978-3-030-05288-1_7\">https://doi.org/10.1007/978-3-030-05288-1_7</a>","short":"G. Koshti, R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, P. Bhowmick, in:, 19th International Workshop, Springer, Cham, 2018, pp. 82–96.","ista":"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.","mla":"Koshti, Girish, et al. “Sphere Construction on the FCC Grid Interpreted as Layered Hexagonal Grids in 3D.” <i>19th International Workshop</i>, vol. 11255, Springer, 2018, pp. 82–96, doi:<a href=\"https://doi.org/10.1007/978-3-030-05288-1_7\">10.1007/978-3-030-05288-1_7</a>.","ama":"Koshti G, Biswas R, Largeteau-Skapin G, Zrour R, Andres E, Bhowmick P. Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D. In: <i>19th International Workshop</i>. Vol 11255. Cham: Springer; 2018:82-96. doi:<a href=\"https://doi.org/10.1007/978-3-030-05288-1_7\">10.1007/978-3-030-05288-1_7</a>","chicago":"Koshti, Girish, Ranita Biswas, Gaëlle Largeteau-Skapin, Rita Zrour, Eric Andres, and Partha Bhowmick. “Sphere Construction on the FCC Grid Interpreted as Layered Hexagonal Grids in 3D.” In <i>19th International Workshop</i>, 11255:82–96. Cham: Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-05288-1_7\">https://doi.org/10.1007/978-3-030-05288-1_7</a>.","ieee":"G. Koshti, R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, and P. Bhowmick, “Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D,” in <i>19th International Workshop</i>, Porto, Portugal, 2018, vol. 11255, pp. 82–96."},"date_created":"2019-03-21T12:16:58Z"},{"doi":"10.1007/978-3-319-73117-9_3","language":[{"iso":"eng"}],"year":"2017","publisher":"Springer Nature","date_updated":"2023-02-10T08:36:03Z","status":"public","type":"conference","author":[{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","full_name":"Henzinger, Monika H"}],"_id":"11772","day":"22","publication_status":"published","oa_version":"None","date_published":"2017-12-22T00:00:00Z","page":"40–44","abstract":[{"lang":"eng","text":"A dynamic graph algorithm is a data structure that supports operations on dynamically changing graphs."}],"date_created":"2022-08-08T13:16:37Z","citation":{"ieee":"M. H. Henzinger, “The state of the art in dynamic graph algorithms,” in <i>44th International Conference on Current Trends in Theory and Practice of Computer Science</i>, Krems, Austria, 2017, vol. 10706, pp. 40–44.","chicago":"Henzinger, Monika H. “The State of the Art in Dynamic Graph Algorithms.” In <i>44th International Conference on Current Trends in Theory and Practice of Computer Science</i>, 10706:40–44. Springer Nature, 2017. <a href=\"https://doi.org/10.1007/978-3-319-73117-9_3\">https://doi.org/10.1007/978-3-319-73117-9_3</a>.","ama":"Henzinger MH. The state of the art in dynamic graph algorithms. In: <i>44th International Conference on Current Trends in Theory and Practice of Computer Science</i>. Vol 10706. Springer Nature; 2017:40–44. doi:<a href=\"https://doi.org/10.1007/978-3-319-73117-9_3\">10.1007/978-3-319-73117-9_3</a>","ista":"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.","short":"M.H. Henzinger, in:, 44th International Conference on Current Trends in Theory and Practice of Computer Science, Springer Nature, 2017, pp. 40–44.","apa":"Henzinger, M. H. (2017). The state of the art in dynamic graph algorithms. In <i>44th International Conference on Current Trends in Theory and Practice of Computer Science</i> (Vol. 10706, pp. 40–44). Krems, Austria: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-73117-9_3\">https://doi.org/10.1007/978-3-319-73117-9_3</a>","mla":"Henzinger, Monika H. “The State of the Art in Dynamic Graph Algorithms.” <i>44th International Conference on Current Trends in Theory and Practice of Computer Science</i>, vol. 10706, Springer Nature, 2017, pp. 40–44, doi:<a href=\"https://doi.org/10.1007/978-3-319-73117-9_3\">10.1007/978-3-319-73117-9_3</a>."},"scopus_import":"1","conference":{"name":"SOFSEM: Theory and Practice of Computer Science","end_date":"2018-02-02","start_date":"2018-01-29","location":"Krems, Austria"},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","intvolume":"     10706","alternative_title":["LNCS"],"month":"12","publication_identifier":{"issn":["0302-9743"],"isbn":["9783319731162"],"eisbn":["9783319731179"]},"quality_controlled":"1","publication":"44th International Conference on Current Trends in Theory and Practice of Computer Science","title":"The state of the art in dynamic graph algorithms","volume":10706},{"type":"conference","status":"public","date_updated":"2022-01-27T15:34:25Z","publisher":"Springer Nature","year":"2017","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-66272-5_28","abstract":[{"text":"Space filling circles and spheres have various applications in mathematical imaging and physical modeling. In this paper, we first show how the thinnest (i.e., 2-minimal) model of digital sphere can be augmented to a space filling model by fixing certain “simple voxels” and “filler voxels” associated with it. Based on elementary number-theoretic properties of such voxels, we design an efficient incremental algorithm for generation of these space filling spheres with successively increasing radius. The novelty of the proposed technique is established further through circular space filling on 3D digital plane. As evident from a preliminary set of experimental result, this can particularly be useful for parallel computing of 3D Voronoi diagrams in the digital space.","lang":"eng"}],"page":"347-359","date_published":"2017-08-22T00:00:00Z","publication_status":"published","oa_version":"None","day":"22","_id":"5801","author":[{"full_name":"Dwivedi, Shivam","first_name":"Shivam","last_name":"Dwivedi"},{"first_name":"Aniket","full_name":"Gupta, Aniket","last_name":"Gupta"},{"last_name":"Roy","first_name":"Siddhant","full_name":"Roy, Siddhant"},{"id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas","orcid":"0000-0002-5372-7890","first_name":"Ranita","full_name":"Biswas, Ranita"},{"last_name":"Bhowmick","first_name":"Partha","full_name":"Bhowmick, Partha"}],"alternative_title":["LNCS"],"intvolume":"     10502","extern":"1","article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","conference":{"location":"Vienna, Austria","end_date":"2017-09-21","start_date":"2017-09-19","name":"DGCI: International Conference on Discrete Geometry for Computer Imagery"},"place":"Cham","citation":{"apa":"Dwivedi, S., Gupta, A., Roy, S., Biswas, R., &#38; Bhowmick, P. (2017). Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space. In <i>20th IAPR International Conference</i> (Vol. 10502, pp. 347–359). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-66272-5_28\">https://doi.org/10.1007/978-3-319-66272-5_28</a>","short":"S. Dwivedi, A. Gupta, S. Roy, R. Biswas, P. Bhowmick, in:, 20th IAPR International Conference, Springer Nature, Cham, 2017, pp. 347–359.","mla":"Dwivedi, Shivam, et al. “Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space.” <i>20th IAPR International Conference</i>, vol. 10502, Springer Nature, 2017, pp. 347–59, doi:<a href=\"https://doi.org/10.1007/978-3-319-66272-5_28\">10.1007/978-3-319-66272-5_28</a>.","ista":"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.","ama":"Dwivedi S, Gupta A, Roy S, Biswas R, Bhowmick P. Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space. In: <i>20th IAPR International Conference</i>. Vol 10502. Cham: Springer Nature; 2017:347-359. doi:<a href=\"https://doi.org/10.1007/978-3-319-66272-5_28\">10.1007/978-3-319-66272-5_28</a>","chicago":"Dwivedi, Shivam, Aniket Gupta, Siddhant Roy, Ranita Biswas, and Partha Bhowmick. “Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space.” In <i>20th IAPR International Conference</i>, 10502:347–59. Cham: Springer Nature, 2017. <a href=\"https://doi.org/10.1007/978-3-319-66272-5_28\">https://doi.org/10.1007/978-3-319-66272-5_28</a>.","ieee":"S. Dwivedi, A. Gupta, S. Roy, R. Biswas, and P. Bhowmick, “Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space,” in <i>20th IAPR International Conference</i>, Vienna, Austria, 2017, vol. 10502, pp. 347–359."},"date_created":"2019-01-08T20:42:22Z","volume":10502,"title":"Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space","publication":"20th IAPR International Conference","quality_controlled":"1","publication_identifier":{"issn":["0302-9743"],"eisbn":["978-3-319-66272-5"],"isbn":["978-3-319-66271-8"],"eissn":["1611-3349"]},"month":"08"},{"citation":{"ama":"Andres E, Biswas R, Bhowmick P. Digital primitives defined by weighted focal set. In: <i>20th IAPR International Conference</i>. Vol 10502. Cham: Springer Nature; 2017:388-398. doi:<a href=\"https://doi.org/10.1007/978-3-319-66272-5_31\">10.1007/978-3-319-66272-5_31</a>","mla":"Andres, Eric, et al. “Digital Primitives Defined by Weighted Focal Set.” <i>20th IAPR International Conference</i>, vol. 10502, Springer Nature, 2017, pp. 388–98, doi:<a href=\"https://doi.org/10.1007/978-3-319-66272-5_31\">10.1007/978-3-319-66272-5_31</a>.","short":"E. Andres, R. Biswas, P. Bhowmick, in:, 20th IAPR International Conference, Springer Nature, Cham, 2017, pp. 388–398.","ista":"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.","apa":"Andres, E., Biswas, R., &#38; Bhowmick, P. (2017). Digital primitives defined by weighted focal set. In <i>20th IAPR International Conference</i> (Vol. 10502, pp. 388–398). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-66272-5_31\">https://doi.org/10.1007/978-3-319-66272-5_31</a>","ieee":"E. Andres, R. Biswas, and P. Bhowmick, “Digital primitives defined by weighted focal set,” in <i>20th IAPR International Conference</i>, Vienna, Austria, 2017, vol. 10502, pp. 388–398.","chicago":"Andres, Eric, Ranita Biswas, and Partha Bhowmick. “Digital Primitives Defined by Weighted Focal Set.” In <i>20th IAPR International Conference</i>, 10502:388–98. Cham: Springer Nature, 2017. <a href=\"https://doi.org/10.1007/978-3-319-66272-5_31\">https://doi.org/10.1007/978-3-319-66272-5_31</a>."},"date_created":"2019-01-08T20:42:39Z","alternative_title":["LNCS"],"intvolume":"     10502","article_processing_charge":"No","extern":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","place":"Cham","conference":{"start_date":"2017-09-19","end_date":"2017-09-21","name":"DGCI: International Conference on Discrete Geometry for Computer Imagery","location":"Vienna, Austria"},"quality_controlled":"1","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["978-3-319-66271-8"],"eisbn":["978-3-319-66272-5"]},"month":"08","volume":10502,"title":"Digital primitives defined by weighted focal set","publication":"20th IAPR International Conference","publisher":"Springer Nature","date_updated":"2022-01-27T15:38:35Z","year":"2017","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-66272-5_31","type":"conference","status":"public","_id":"5802","author":[{"full_name":"Andres, Eric","first_name":"Eric","last_name":"Andres"},{"first_name":"Ranita","full_name":"Biswas, Ranita","last_name":"Biswas","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890"},{"first_name":"Partha","full_name":"Bhowmick, Partha","last_name":"Bhowmick"}],"abstract":[{"text":"This papers introduces a definition of digital primitives based on focal points and weighted distances (with positive weights). The proposed definition is applicable to general dimensions and covers in its gamut various regular curves and surfaces like circles, ellipses, digital spheres and hyperspheres, ellipsoids and k-ellipsoids, Cartesian k-ovals, etc. Several interesting properties are presented for this class of digital primitives such as space partitioning, topological separation, and connectivity properties. To demonstrate further the potential of this new way of defining digital primitives, we propose, as extension, another class of digital conics defined by focus-directrix combination.","lang":"eng"}],"page":"388-398","date_published":"2017-08-22T00:00:00Z","oa_version":"None","publication_status":"published","day":"22"},{"date_published":"2017-05-17T00:00:00Z","_id":"5803","author":[{"last_name":"Biswas","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890","first_name":"Ranita","full_name":"Biswas, Ranita"},{"full_name":"Bhowmick, Partha","first_name":"Partha","last_name":"Bhowmick"}],"type":"book_chapter","publisher":"Springer Nature","year":"2017","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-59108-7_8","volume":10256,"quality_controlled":"1","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["978-3-319-59107-0","978-3-319-59108-7"]},"month":"05","intvolume":"     10256","article_processing_charge":"No","extern":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","conference":{"location":"Plovdiv, Bulgaria","name":"IWCIA: International Workshop on Combinatorial Image Analysis","end_date":"2017-06-21","start_date":"2017-06-19"},"place":"Cham","department":[{"_id":"HeEd"}],"date_created":"2019-01-08T20:42:56Z","abstract":[{"lang":"eng","text":"Different distance metrics produce Voronoi diagrams with different properties. It is a well-known that on the (real) 2D plane or even on any 3D plane, a Voronoi diagram (VD) based on the Euclidean distance metric produces convex Voronoi regions. In this paper, we first show that this metric produces a persistent VD on the 2D digital plane, as it comprises digitally convex Voronoi regions and hence correctly approximates the corresponding VD on the 2D real plane. Next, we show that on a 3D digital plane D, the Euclidean metric spanning over its voxel set does not guarantee a digital VD which is persistent with the real-space VD. As a solution, we introduce a novel concept of functional-plane-convexity, which is ensured by the Euclidean metric spanning over the pedal set of D. Necessary proofs and some visual result have been provided to adjudge the merit and usefulness of the proposed concept."}],"page":"93-104","publication_status":"published","oa_version":"None","day":"17","status":"public","date_updated":"2022-01-28T07:48:24Z","title":"Construction of persistent Voronoi diagram on 3D digital plane","publication":"Combinatorial image analysis","alternative_title":["LNCS"],"citation":{"ieee":"R. Biswas and P. Bhowmick, “Construction of persistent Voronoi diagram on 3D digital plane,” in <i>Combinatorial image analysis</i>, vol. 10256, Cham: Springer Nature, 2017, pp. 93–104.","chicago":"Biswas, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi Diagram on 3D Digital Plane.” In <i>Combinatorial Image Analysis</i>, 10256:93–104. Cham: Springer Nature, 2017. <a href=\"https://doi.org/10.1007/978-3-319-59108-7_8\">https://doi.org/10.1007/978-3-319-59108-7_8</a>.","ama":"Biswas R, Bhowmick P. Construction of persistent Voronoi diagram on 3D digital plane. In: <i>Combinatorial Image Analysis</i>. Vol 10256. Cham: Springer Nature; 2017:93-104. doi:<a href=\"https://doi.org/10.1007/978-3-319-59108-7_8\">10.1007/978-3-319-59108-7_8</a>","apa":"Biswas, R., &#38; Bhowmick, P. (2017). Construction of persistent Voronoi diagram on 3D digital plane. In <i>Combinatorial image analysis</i> (Vol. 10256, pp. 93–104). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-59108-7_8\">https://doi.org/10.1007/978-3-319-59108-7_8</a>","ista":"Biswas R, Bhowmick P. 2017.Construction of persistent Voronoi diagram on 3D digital plane. In: Combinatorial image analysis. LNCS, vol. 10256, 93–104.","mla":"Biswas, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi Diagram on 3D Digital Plane.” <i>Combinatorial Image Analysis</i>, vol. 10256, Springer Nature, 2017, pp. 93–104, doi:<a href=\"https://doi.org/10.1007/978-3-319-59108-7_8\">10.1007/978-3-319-59108-7_8</a>.","short":"R. Biswas, P. Bhowmick, in:, Combinatorial Image Analysis, Springer Nature, Cham, 2017, pp. 93–104."}},{"date_updated":"2025-06-02T08:53:45Z","status":"public","page":"367 - 381","oa_version":"Submitted Version","publication_status":"published","day":"25","ec_funded":1,"abstract":[{"text":"In the analysis of reactive systems a quantitative objective assigns a real value to every trace of the system. The value decision problem for a quantitative objective requires a trace whose value is at least a given threshold, and the exact value decision problem requires a trace whose value is exactly the threshold. We compare the computational complexity of the value and exact value decision problems for classical quantitative objectives, such as sum, discounted sum, energy, and mean-payoff for two standard models of reactive systems, namely, graphs and graph games.","lang":"eng"}],"project":[{"grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF"},{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"citation":{"ama":"Chatterjee K, Doyen L, Henzinger TA. The cost of exactness in quantitative reachability. In: Aceto L, Bacci G, Ingólfsdóttir A, Legay A, Mardare R, eds. <i>Models, Algorithms, Logics and Tools</i>. Vol 10460. Theoretical Computer Science and General Issues. Springer; 2017:367-381. doi:<a href=\"https://doi.org/10.1007/978-3-319-63121-9_18\">10.1007/978-3-319-63121-9_18</a>","ista":"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.","mla":"Chatterjee, Krishnendu, et al. “The Cost of Exactness in Quantitative Reachability.” <i>Models, Algorithms, Logics and Tools</i>, edited by Luca Aceto et al., vol. 10460, Springer, 2017, pp. 367–81, doi:<a href=\"https://doi.org/10.1007/978-3-319-63121-9_18\">10.1007/978-3-319-63121-9_18</a>.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, R. Mardare (Eds.), Models, Algorithms, Logics and Tools, Springer, 2017, pp. 367–381.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2017). The cost of exactness in quantitative reachability. In L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, &#38; R. Mardare (Eds.), <i>Models, Algorithms, Logics and Tools</i> (Vol. 10460, pp. 367–381). Springer. <a href=\"https://doi.org/10.1007/978-3-319-63121-9_18\">https://doi.org/10.1007/978-3-319-63121-9_18</a>","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “The cost of exactness in quantitative reachability,” in <i>Models, Algorithms, Logics and Tools</i>, vol. 10460, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, and R. Mardare, Eds. Springer, 2017, pp. 367–381.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “The Cost of Exactness in Quantitative Reachability.” In <i>Models, Algorithms, Logics and Tools</i>, edited by Luca Aceto, Giorgio Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare, 10460:367–81. Theoretical Computer Science and General Issues. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-63121-9_18\">https://doi.org/10.1007/978-3-319-63121-9_18</a>."},"editor":[{"last_name":"Aceto","first_name":"Luca","full_name":"Aceto, Luca"},{"last_name":"Bacci","first_name":"Giorgio","full_name":"Bacci, Giorgio"},{"full_name":"Ingólfsdóttir, Anna","first_name":"Anna","last_name":"Ingólfsdóttir"},{"first_name":"Axel","full_name":"Legay, Axel","last_name":"Legay"},{"last_name":"Mardare","full_name":"Mardare, Radu","first_name":"Radu"}],"scopus_import":"1","alternative_title":["LNCS"],"has_accepted_license":"1","publication":"Models, Algorithms, Logics and Tools","series_title":"Theoretical Computer Science and General Issues","file":[{"file_name":"2017_ModelsAlgorithms_Chatterjee.pdf","file_size":192826,"file_id":"7048","checksum":"b2402766ec02c79801aac634bd8f9f6c","date_created":"2019-11-19T08:06:50Z","date_updated":"2020-07-14T12:47:25Z","creator":"dernst","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"title":"The cost of exactness in quantitative reachability","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-63121-9_18","publisher":"Springer","year":"2017","type":"book_chapter","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"oa":1,"_id":"625","date_published":"2017-07-25T00:00:00Z","date_created":"2018-12-11T11:47:34Z","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 and S11407-N23 (RiSE/SHiNE), and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003.","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"ddc":["000"],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:47:25Z","intvolume":"     10460","month":"07","quality_controlled":"1","publication_identifier":{"issn":["0302-9743"],"isbn":["978-3-319-63120-2"]},"publist_id":"7170","volume":10460},{"series_title":"LNCS","title":"Numerical Software Verification","volume":10152,"month":"01","publication_identifier":{"issn":["0302-9743"],"eisbn":["978-3-319-54292-8"]},"publist_id":"7150","quality_controlled":"1","editor":[{"last_name":"Bogomolov","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365","first_name":"Sergiy","full_name":"Bogomolov, Sergiy"},{"last_name":"Martel","full_name":"Martel, Matthieu","first_name":"Matthieu"},{"last_name":"Prabhakar","full_name":"Prabhakar, Pavithra","first_name":"Pavithra"}],"conference":{"location":"Toronto, ON, Canada","start_date":"2016-07-17","end_date":"2016-07-18","name":"NSV: Numerical Software Verification"},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"     10152","date_created":"2018-12-11T11:47:38Z","department":[{"_id":"ToHe"}],"citation":{"short":"S. Bogomolov, M. Martel, P. Prabhakar, eds., Numerical Software Verification, Springer, 2017.","apa":"Bogomolov, S., Martel, M., &#38; Prabhakar, P. (Eds.). (2017). <i>Numerical Software Verification</i> (Vol. 10152). Presented at the NSV: Numerical Software Verification, Toronto, ON, Canada: Springer. <a href=\"https://doi.org/10.1007/978-3-319-54292-8\">https://doi.org/10.1007/978-3-319-54292-8</a>","mla":"Bogomolov, Sergiy, et al., editors. <i>Numerical Software Verification</i>. Vol. 10152, Springer, 2017, doi:<a href=\"https://doi.org/10.1007/978-3-319-54292-8\">10.1007/978-3-319-54292-8</a>.","ista":"Bogomolov S, Martel M, Prabhakar P eds. 2017. Numerical Software Verification, Springer,p.","ama":"Bogomolov S, Martel M, Prabhakar P, eds. <i>Numerical Software Verification</i>. Vol 10152. Springer; 2017. doi:<a href=\"https://doi.org/10.1007/978-3-319-54292-8\">10.1007/978-3-319-54292-8</a>","chicago":"Bogomolov, Sergiy, Matthieu Martel, and Pavithra Prabhakar, eds. <i>Numerical Software Verification</i>. Vol. 10152. LNCS. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-54292-8\">https://doi.org/10.1007/978-3-319-54292-8</a>.","ieee":"S. Bogomolov, M. Martel, and P. Prabhakar, Eds., <i>Numerical Software Verification</i>, vol. 10152. Springer, 2017."},"day":"01","publication_status":"published","oa_version":"None","date_published":"2017-01-01T00:00:00Z","abstract":[{"lang":"eng","text":"This book constitutes the refereed proceedings of the 9th InternationalWorkshop on Numerical Software Verification, NSV 2016, held in Toronto, ON, Canada in July 2011 - colocated with CAV 2016, the 28th International Conference on Computer Aided Verification.\r\nThe NSV workshop is dedicated to the development of logical and mathematical techniques for the reasoning about programmability and reliability."}],"_id":"638","status":"public","type":"conference_editor","doi":"10.1007/978-3-319-54292-8","language":[{"iso":"eng"}],"year":"2017","publisher":"Springer","date_updated":"2022-05-24T07:09:52Z"},{"status":"public","date_updated":"2023-06-21T13:29:46Z","publication_status":"published","oa_version":"Preprint","page":"443-460","day":"31","abstract":[{"text":"Transforming deterministic ω\r\n-automata into deterministic parity automata is traditionally done using variants of appearance records. We present a more efficient variant of this approach, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and find out that our method produces smaller automata than previous approaches. Moreover, the experiments demonstrate the potential of our method for LTL synthesis, using LTL-to-Rabin translators. It leads to significantly smaller parity automata when compared to state-of-the-art approaches on complex formulae.","lang":"eng"}],"alternative_title":["LNCS"],"arxiv":1,"citation":{"chicago":"Kretinsky, Jan, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger. “Index Appearance Record for Transforming Rabin Automata into Parity Automata.” In <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, 10205:443–60. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-662-54577-5_26\">https://doi.org/10.1007/978-3-662-54577-5_26</a>.","ieee":"J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record for transforming Rabin automata into parity automata,” in <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, Uppsala, Sweden, 2017, vol. 10205, pp. 443–460.","ista":"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.","short":"J. Kretinsky, T. Meggendorfer, C. Waldmann, M. Weininger, in:, Tools and Algorithms for the Construction and Analysis of Systems, Springer, 2017, pp. 443–460.","mla":"Kretinsky, Jan, et al. “Index Appearance Record for Transforming Rabin Automata into Parity Automata.” <i>Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 10205, Springer, 2017, pp. 443–60, doi:<a href=\"https://doi.org/10.1007/978-3-662-54577-5_26\">10.1007/978-3-662-54577-5_26</a>.","apa":"Kretinsky, J., Meggendorfer, T., Waldmann, C., &#38; Weininger, M. (2017). Index appearance record for transforming Rabin automata into parity automata. In <i>Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 10205, pp. 443–460). Uppsala, Sweden: Springer. <a href=\"https://doi.org/10.1007/978-3-662-54577-5_26\">https://doi.org/10.1007/978-3-662-54577-5_26</a>","ama":"Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record for transforming Rabin automata into parity automata. In: <i>Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 10205. Springer; 2017:443-460. doi:<a href=\"https://doi.org/10.1007/978-3-662-54577-5_26\">10.1007/978-3-662-54577-5_26</a>"},"publication":"Tools and Algorithms for the Construction and Analysis of Systems","external_id":{"arxiv":["1701.05738"]},"title":"Index appearance record for transforming Rabin automata into parity automata","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1701.05738","open_access":"1"}],"type":"conference","language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-54577-5_26","publisher":"Springer","year":"2017","date_published":"2017-03-31T00:00:00Z","author":[{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","orcid":"0000-0002-8122-2881","first_name":"Jan","full_name":"Kretinsky, Jan"},{"orcid":"0000-0002-1712-2165","last_name":"Meggendorfer","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias","full_name":"Meggendorfer, Tobias"},{"last_name":"Waldmann","full_name":"Waldmann, Clara","first_name":"Clara"},{"first_name":"Maximilian","full_name":"Weininger, Maximilian","last_name":"Weininger"}],"oa":1,"_id":"13160","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","conference":{"end_date":"2017-04-29","start_date":"2017-04-22","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Uppsala, Sweden"},"intvolume":"     10205","date_created":"2023-06-21T13:21:14Z","acknowledgement":"This work is partially funded by the DFG project “Verified Model Checkers” and by the Czech Science Foundation, grant No. P202/12/G061.","department":[{"_id":"KrCh"}],"volume":10205,"month":"03","quality_controlled":"1","publication_identifier":{"issn":["0302-9743"],"eisbn":["9783662545775"],"isbn":["9783662545768"],"eissn":["1611-3349"]}},{"article_processing_charge":"No","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Waterloo, ON, Canada","start_date":"2017-06-26","end_date":"2017-06-28","name":"IPCO: Integer Programming and Combinatorial Optimization"},"intvolume":"     10328","date_created":"2023-02-20T07:52:31Z","volume":10328,"month":"05","quality_controlled":"1","publication_identifier":{"eisbn":["9783319592503"],"isbn":["9783319592497"],"issn":["0302-9743","1611-3349"]},"type":"conference","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-59250-3_8","publisher":"Springer Nature","year":"2017","date_published":"2017-05-24T00:00:00Z","author":[{"full_name":"Bhattacharya, Sayan","first_name":"Sayan","last_name":"Bhattacharya"},{"full_name":"Chakrabarty, Deeparnab","first_name":"Deeparnab","last_name":"Chakrabarty"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530"}],"oa":1,"_id":"12571","scopus_import":"1","alternative_title":["LNCS"],"arxiv":1,"citation":{"chicago":"Bhattacharya, Sayan, Deeparnab Chakrabarty, and Monika H Henzinger. “Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time.” In <i>19th International Conference on Integer Programming and Combinatorial Optimization</i>, 10328:86–98. Springer Nature, 2017. <a href=\"https://doi.org/10.1007/978-3-319-59250-3_8\">https://doi.org/10.1007/978-3-319-59250-3_8</a>.","ieee":"S. Bhattacharya, D. Chakrabarty, and M. H. Henzinger, “Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time,” in <i>19th International Conference on Integer Programming and Combinatorial Optimization</i>, Waterloo, ON, Canada, 2017, vol. 10328, pp. 86–98.","ista":"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.","mla":"Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time.” <i>19th International Conference on Integer Programming and Combinatorial Optimization</i>, vol. 10328, Springer Nature, 2017, pp. 86–98, doi:<a href=\"https://doi.org/10.1007/978-3-319-59250-3_8\">10.1007/978-3-319-59250-3_8</a>.","short":"S. Bhattacharya, D. Chakrabarty, M.H. Henzinger, in:, 19th International Conference on Integer Programming and Combinatorial Optimization, Springer Nature, 2017, pp. 86–98.","apa":"Bhattacharya, S., Chakrabarty, D., &#38; Henzinger, M. H. (2017). Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. In <i>19th International Conference on Integer Programming and Combinatorial Optimization</i> (Vol. 10328, pp. 86–98). Waterloo, ON, Canada: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-59250-3_8\">https://doi.org/10.1007/978-3-319-59250-3_8</a>","ama":"Bhattacharya S, Chakrabarty D, Henzinger MH. Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. In: <i>19th International Conference on Integer Programming and Combinatorial Optimization</i>. Vol 10328. Springer Nature; 2017:86-98. doi:<a href=\"https://doi.org/10.1007/978-3-319-59250-3_8\">10.1007/978-3-319-59250-3_8</a>"},"publication":"19th International Conference on Integer Programming and Combinatorial Optimization","external_id":{"arxiv":["1611.00198"]},"title":"Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.00198"}],"status":"public","date_updated":"2023-02-20T07:57:24Z","oa_version":"Preprint","page":"86-98","publication_status":"published","day":"24","abstract":[{"text":"We consider the problems of maintaining approximate maximum matching and minimum vertex cover in a dynamic graph. Starting with the seminal work of Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. Very recently, extending the framework of Baswana, Gupta and Sen [FOCS 2011], Solomon [FOCS 2016] gave a randomized 2-approximation dynamic algorithm for this problem that has amortized update time of O(1) with high probability. We consider the natural open question of derandomizing this result. We present a new deterministic fully dynamic algorithm that maintains a O(1)-approximate minimum vertex cover and maximum fractional matching, with an amortized update time of O(1). Previously, the best deterministic algorithm for this problem was due to Bhattacharya, Henzinger and Italiano [SODA 2015]; it had an approximation ratio of (2+ϵ) and an amortized update time of O(logn/ϵ2). Our result can be generalized to give a fully dynamic O(f3)-approximation algorithm with O(f2) amortized update time for the hypergraph vertex cover and fractional matching problems, where every hyperedge has at most f vertices.","lang":"eng"}]},{"ec_funded":1,"abstract":[{"lang":"eng","text":"Immunogold labeling of freeze-fracture replicas has recently been used for high-resolution visualization of protein localization in electron microscopy. This method has higher labeling efficiency than conventional immunogold methods for membrane molecules allowing precise quantitative measurements. However, one of the limitations of freeze-fracture replica immunolabeling is difficulty in keeping structural orientation and identifying labeled profiles in complex tissues like brain. The difficulty is partly due to fragmentation of freeze-fracture replica preparations during labeling procedures and limited morphological clues on the replica surface. To overcome these issues, we introduce here a grid-glued replica method combined with SEM observation. This method allows histological staining before dissolving the tissue and easy handling of replicas during immunogold labeling, and keeps the whole replica surface intact without fragmentation. The procedure described here is also useful for matched double-replica analysis allowing further identification of labeled profiles in corresponding P-face and E-face."}],"publication_status":"published","oa_version":"None","page":"203 - 216","day":"12","acknowledged_ssus":[{"_id":"EM-Fac"}],"status":"public","date_updated":"2023-09-05T14:09:01Z","title":"Immunogold protein localization on grid-glued freeze-fracture replicas","publication":"High-Resolution Imaging of Cellular Proteins","alternative_title":["Methods in Molecular Biology"],"project":[{"call_identifier":"FP7","grant_number":"604102","_id":"25CD3DD2-B435-11E9-9278-68D0E5697425","name":"Localization of ion channels and receptors by two and three-dimensional immunoelectron microscopic approaches"}],"citation":{"chicago":"Harada, Harumi, and Ryuichi Shigemoto. “Immunogold Protein Localization on Grid-Glued Freeze-Fracture Replicas.” In <i>High-Resolution Imaging of Cellular Proteins</i>, 1474:203–16. Springer, 2016. <a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">https://doi.org/10.1007/978-1-4939-6352-2_12</a>.","ieee":"H. Harada and R. Shigemoto, “Immunogold protein localization on grid-glued freeze-fracture replicas,” in <i>High-Resolution Imaging of Cellular Proteins</i>, vol. 1474, Springer, 2016, pp. 203–216.","apa":"Harada, H., &#38; Shigemoto, R. (2016). Immunogold protein localization on grid-glued freeze-fracture replicas. In <i>High-Resolution Imaging of Cellular Proteins</i> (Vol. 1474, pp. 203–216). Springer. <a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">https://doi.org/10.1007/978-1-4939-6352-2_12</a>","ista":"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.","short":"H. Harada, R. Shigemoto, in:, High-Resolution Imaging of Cellular Proteins, Springer, 2016, pp. 203–216.","mla":"Harada, Harumi, and Ryuichi Shigemoto. “Immunogold Protein Localization on Grid-Glued Freeze-Fracture Replicas.” <i>High-Resolution Imaging of Cellular Proteins</i>, vol. 1474, Springer, 2016, pp. 203–16, doi:<a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">10.1007/978-1-4939-6352-2_12</a>.","ama":"Harada H, Shigemoto R. Immunogold protein localization on grid-glued freeze-fracture replicas. In: <i>High-Resolution Imaging of Cellular Proteins</i>. Vol 1474. Springer; 2016:203-216. doi:<a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">10.1007/978-1-4939-6352-2_12</a>"},"date_published":"2016-08-12T00:00:00Z","_id":"1094","author":[{"orcid":"0000-0001-7429-7896","id":"2E55CDF2-F248-11E8-B48F-1D18A9856A87","last_name":"Harada","full_name":"Harada, Harumi","first_name":"Harumi"},{"orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","full_name":"Shigemoto, Ryuichi","first_name":"Ryuichi"}],"type":"book_chapter","publisher":"Springer","year":"2016","language":[{"iso":"eng"}],"doi":"10.1007/978-1-4939-6352-2_12","volume":1474,"quality_controlled":"1","publist_id":"6281","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"]},"month":"08","intvolume":"      1474","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","acknowledgement":"We thank Prof. Elek Molnár for providing us a pan-AMPAR anti-body used in Fig.2 and Dr. Ludek Lovicar for technical assistance in scanning electron microscope imaging. This work was supported by the European Union (HBP—Project Ref. 604102). ","department":[{"_id":"RySh"}],"date_created":"2018-12-11T11:50:06Z"},{"publication":"Computational Topology in Image Context","title":"On some local topological properties of naive discrete sphere","alternative_title":["LNCS"],"citation":{"chicago":"Sen, Nabhasmita, Ranita Biswas, and Partha Bhowmick. “On Some Local Topological Properties of Naive Discrete Sphere.” In <i>Computational Topology in Image Context</i>, 9667:253–64. Cham: Springer Nature, 2016. <a href=\"https://doi.org/10.1007/978-3-319-39441-1_23\">https://doi.org/10.1007/978-3-319-39441-1_23</a>.","ieee":"N. Sen, R. Biswas, and P. Bhowmick, “On some local topological properties of naive discrete sphere,” in <i>Computational Topology in Image Context</i>, vol. 9667, Cham: Springer Nature, 2016, pp. 253–264.","short":"N. Sen, R. Biswas, P. Bhowmick, in:, Computational Topology in Image Context, Springer Nature, Cham, 2016, pp. 253–264.","apa":"Sen, N., Biswas, R., &#38; Bhowmick, P. (2016). On some local topological properties of naive discrete sphere. In <i>Computational Topology in Image Context</i> (Vol. 9667, pp. 253–264). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-39441-1_23\">https://doi.org/10.1007/978-3-319-39441-1_23</a>","ista":"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.","mla":"Sen, Nabhasmita, et al. “On Some Local Topological Properties of Naive Discrete Sphere.” <i>Computational Topology in Image Context</i>, vol. 9667, Springer Nature, 2016, pp. 253–64, doi:<a href=\"https://doi.org/10.1007/978-3-319-39441-1_23\">10.1007/978-3-319-39441-1_23</a>.","ama":"Sen N, Biswas R, Bhowmick P. On some local topological properties of naive discrete sphere. In: <i>Computational Topology in Image Context</i>. Vol 9667. Cham: Springer Nature; 2016:253-264. doi:<a href=\"https://doi.org/10.1007/978-3-319-39441-1_23\">10.1007/978-3-319-39441-1_23</a>"},"day":"02","oa_version":"None","publication_status":"published","page":"253-264","abstract":[{"lang":"eng","text":"Discretization of sphere in the integer space follows a particular discretization scheme, which, in principle, conforms to some topological model. This eventually gives rise to interesting topological properties of a discrete spherical surface, which need to be investigated for its analytical characterization. This paper presents some novel results on the local topological properties of the naive model of discrete sphere. They follow from the bijection of each quadraginta octant of naive sphere with its projection map called f -map on the corresponding functional plane and from the characterization of certain jumps in the f-map. As an application, we have shown how these properties can be used in designing an efficient reconstruction algorithm for a naive spherical surface from an input voxel set when it is sparse or noisy."}],"status":"public","date_updated":"2022-01-28T08:01:22Z","volume":9667,"month":"06","publication_identifier":{"issn":["0302-9743"],"isbn":["978-3-319-39440-4"],"eisbn":["978-3-319-39441-1"],"eissn":["1611-3349"]},"quality_controlled":"1","conference":{"start_date":"2016-06-15","end_date":"2016-06-17","name":"CTIC: Computational Topology in Image Context","location":"Marseille, France"},"place":"Cham","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","extern":"1","intvolume":"      9667","date_created":"2019-01-08T20:44:24Z","department":[{"_id":"HeEd"}],"date_published":"2016-06-02T00:00:00Z","author":[{"full_name":"Sen, Nabhasmita","first_name":"Nabhasmita","last_name":"Sen"},{"first_name":"Ranita","full_name":"Biswas, Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas","orcid":"0000-0002-5372-7890"},{"last_name":"Bhowmick","first_name":"Partha","full_name":"Bhowmick, Partha"}],"_id":"5805","type":"book_chapter","doi":"10.1007/978-3-319-39441-1_23","language":[{"iso":"eng"}],"year":"2016","publisher":"Springer Nature"},{"date_published":"2016-04-09T00:00:00Z","_id":"5806","author":[{"first_name":"Ranita","full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890","last_name":"Biswas","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bhowmick, Partha","first_name":"Partha","last_name":"Bhowmick"}],"type":"conference","publisher":"Springer Nature","year":"2016","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-32360-2_20","volume":9647,"quality_controlled":"1","publication_identifier":{"eisbn":["978-3-319-32360-2"],"isbn":["978-3-319-32359-6"],"issn":["0302-9743","1611-3349"]},"month":"04","intvolume":"      9647","extern":"1","article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","conference":{"location":"Nantes, France","name":"DGCI: International Conference on Discrete Geometry for Computer Imagery","end_date":"2016-04-20","start_date":"2016-04-18"},"place":"Cham","department":[{"_id":"HeEd"}],"date_created":"2019-01-08T20:44:37Z","abstract":[{"lang":"eng","text":"Although the concept of functional plane for naive plane is studied and reported in the literature in great detail, no similar study is yet found for naive sphere. This article exposes the first study in this line, opening up further prospects of analyzing the topological properties of sphere in the discrete space. We show that each quadraginta octant Q of a naive sphere forms a bijection with its projected pixel set on a unique coordinate plane, which thereby serves as the functional plane of Q, and hence gives rise to merely mono-jumps during back projection. The other two coordinate planes serve as para-functional and dia-functional planes for Q, as the former is ‘mono-jumping’ but not bijective, whereas the latter holds neither of the two. Owing to this, the quadraginta octants form symmetry groups and subgroups with equivalent jump conditions. We also show a potential application in generating a special class of discrete 3D circles based on back projection and jump bridging by Steiner voxels. A circle in this class possesses 4-symmetry, uniqueness, and bounded distance from the underlying real sphere and real plane."}],"page":"256-267","oa_version":"None","publication_status":"published","day":"09","status":"public","date_updated":"2022-01-28T08:10:11Z","title":"On functionality of quadraginta octants of naive sphere with application to circle drawing","publication":"Discrete Geometry for Computer Imagery","alternative_title":["LNCS"],"citation":{"ama":"Biswas R, Bhowmick P. On functionality of quadraginta octants of naive sphere with application to circle drawing. In: <i>Discrete Geometry for Computer Imagery</i>. Vol 9647. Cham: Springer Nature; 2016:256-267. doi:<a href=\"https://doi.org/10.1007/978-3-319-32360-2_20\">10.1007/978-3-319-32360-2_20</a>","apa":"Biswas, R., &#38; Bhowmick, P. (2016). On functionality of quadraginta octants of naive sphere with application to circle drawing. In <i>Discrete Geometry for Computer Imagery</i> (Vol. 9647, pp. 256–267). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-32360-2_20\">https://doi.org/10.1007/978-3-319-32360-2_20</a>","mla":"Biswas, Ranita, and Partha Bhowmick. “On Functionality of Quadraginta Octants of Naive Sphere with Application to Circle Drawing.” <i>Discrete Geometry for Computer Imagery</i>, vol. 9647, Springer Nature, 2016, pp. 256–67, doi:<a href=\"https://doi.org/10.1007/978-3-319-32360-2_20\">10.1007/978-3-319-32360-2_20</a>.","ista":"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.","short":"R. Biswas, P. Bhowmick, in:, Discrete Geometry for Computer Imagery, Springer Nature, Cham, 2016, pp. 256–267.","ieee":"R. Biswas and P. Bhowmick, “On functionality of quadraginta octants of naive sphere with application to circle drawing,” in <i>Discrete Geometry for Computer Imagery</i>, Nantes, France, 2016, vol. 9647, pp. 256–267.","chicago":"Biswas, Ranita, and Partha Bhowmick. “On Functionality of Quadraginta Octants of Naive Sphere with Application to Circle Drawing.” In <i>Discrete Geometry for Computer Imagery</i>, 9647:256–67. Cham: Springer Nature, 2016. <a href=\"https://doi.org/10.1007/978-3-319-32360-2_20\">https://doi.org/10.1007/978-3-319-32360-2_20</a>."}},{"month":"01","quality_controlled":"1","publication_identifier":{"issn":["0302-9743"],"eisbn":["978-3-319-26145-4"],"isbn":["978-3-319-26144-7"],"eissn":["1611-3349"]},"publication":"Combinatorial image analysis","volume":9448,"title":"On the connectivity and smoothness of discrete spherical circles","date_created":"2019-01-08T20:45:19Z","department":[{"_id":"HeEd"}],"citation":{"chicago":"Biswas, Ranita, Partha Bhowmick, and Valentin E. Brimkov. “On the Connectivity and Smoothness of Discrete Spherical Circles.” In <i>Combinatorial Image Analysis</i>, 9448:86–100. Cham: Springer Nature, 2016. <a href=\"https://doi.org/10.1007/978-3-319-26145-4_7\">https://doi.org/10.1007/978-3-319-26145-4_7</a>.","ieee":"R. Biswas, P. Bhowmick, and V. E. Brimkov, “On the connectivity and smoothness of discrete spherical circles,” in <i>Combinatorial image analysis</i>, vol. 9448, Cham: Springer Nature, 2016, pp. 86–100.","ista":"Biswas R, Bhowmick P, Brimkov VE. 2016.On the connectivity and smoothness of discrete spherical circles. In: Combinatorial image analysis. vol. 9448, 86–100.","apa":"Biswas, R., Bhowmick, P., &#38; Brimkov, V. E. (2016). On the connectivity and smoothness of discrete spherical circles. In <i>Combinatorial image analysis</i> (Vol. 9448, pp. 86–100). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-26145-4_7\">https://doi.org/10.1007/978-3-319-26145-4_7</a>","short":"R. Biswas, P. Bhowmick, V.E. Brimkov, in:, Combinatorial Image Analysis, Springer Nature, Cham, 2016, pp. 86–100.","mla":"Biswas, Ranita, et al. “On the Connectivity and Smoothness of Discrete Spherical Circles.” <i>Combinatorial Image Analysis</i>, vol. 9448, Springer Nature, 2016, pp. 86–100, doi:<a href=\"https://doi.org/10.1007/978-3-319-26145-4_7\">10.1007/978-3-319-26145-4_7</a>.","ama":"Biswas R, Bhowmick P, Brimkov VE. On the connectivity and smoothness of discrete spherical circles. In: <i>Combinatorial Image Analysis</i>. Vol 9448. Cham: Springer Nature; 2016:86-100. doi:<a href=\"https://doi.org/10.1007/978-3-319-26145-4_7\">10.1007/978-3-319-26145-4_7</a>"},"article_processing_charge":"No","extern":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","conference":{"name":"IWCIA: International Workshop on Combinatorial Image Analysis","end_date":"2015-11-27","start_date":"2015-11-24","location":"Kolkata, India"},"place":"Cham","intvolume":"      9448","author":[{"full_name":"Biswas, Ranita","first_name":"Ranita","orcid":"0000-0002-5372-7890","last_name":"Biswas","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bhowmick, Partha","first_name":"Partha","last_name":"Bhowmick"},{"last_name":"Brimkov","first_name":"Valentin E.","full_name":"Brimkov, Valentin E."}],"_id":"5809","page":"86-100","publication_status":"published","oa_version":"None","date_published":"2016-01-06T00:00:00Z","day":"06","abstract":[{"text":"A discrete spherical circle is a topologically well-connected 3D circle in the integer space, which belongs to a discrete sphere as well as a discrete plane. It is one of the most important 3D geometric primitives, but has not possibly yet been studied up to its merit. This paper is a maiden exposition of some of its elementary properties, which indicates a sense of its profound theoretical prospects in the framework of digital geometry. We have shown how different types of discretization can lead to forbidden and admissible classes, when one attempts to define the discretization of a spherical circle in terms of intersection between a discrete sphere and a discrete plane. Several fundamental theoretical results have been presented, the algorithm for construction of discrete spherical circles has been discussed, and some test results have been furnished to demonstrate its practicality and usefulness.","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-26145-4_7","date_updated":"2022-01-28T08:13:03Z","publisher":"Springer Nature","year":"2016","status":"public","type":"book_chapter"}]