[{"publication_status":"published","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-01216-8_27","alternative_title":["LNCS"],"date_created":"2024-10-09T07:47:30Z","quality_controlled":"1","title":"ForestHash: Semantic hashing with shallow random forests and tiny convolutional networks","month":"10","volume":11206,"_id":"18282","citation":{"ieee":"Q. Qiu, J. Lezama, A. M. Bronstein, and G. Sapiro, “ForestHash: Semantic hashing with shallow random forests and tiny convolutional networks,” in <i>European Conference on Computer Vision</i>, Munich, Germany, 2018, vol. 11206, no. Part II.","mla":"Qiu, Qiang, et al. “ForestHash: Semantic Hashing with Shallow Random Forests and Tiny Convolutional Networks.” <i>European Conference on Computer Vision</i>, vol. 11206, no. Part II, Springer Nature, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-01216-8_27\">10.1007/978-3-030-01216-8_27</a>.","short":"Q. Qiu, J. Lezama, A.M. Bronstein, G. Sapiro, in:, European Conference on Computer Vision, Springer Nature, 2018.","ista":"Qiu Q, Lezama J, Bronstein AM, Sapiro G. 2018. ForestHash: Semantic hashing with shallow random forests and tiny convolutional networks. European Conference on Computer Vision. ECCV: European Conference on Computer Vision, LNCS, vol. 11206.","chicago":"Qiu, Qiang, José Lezama, Alex M. Bronstein, and Guillermo Sapiro. “ForestHash: Semantic Hashing with Shallow Random Forests and Tiny Convolutional Networks.” In <i>European Conference on Computer Vision</i>, Vol. 11206. Springer Nature, 2018. <a href=\"https://doi.org/10.1007/978-3-030-01216-8_27\">https://doi.org/10.1007/978-3-030-01216-8_27</a>.","apa":"Qiu, Q., Lezama, J., Bronstein, A. M., &#38; Sapiro, G. (2018). ForestHash: Semantic hashing with shallow random forests and tiny convolutional networks. In <i>European Conference on Computer Vision</i> (Vol. 11206). Munich, Germany: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-01216-8_27\">https://doi.org/10.1007/978-3-030-01216-8_27</a>","ama":"Qiu Q, Lezama J, Bronstein AM, Sapiro G. ForestHash: Semantic hashing with shallow random forests and tiny convolutional networks. In: <i>European Conference on Computer Vision</i>. Vol 11206. Springer Nature; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-01216-8_27\">10.1007/978-3-030-01216-8_27</a>"},"abstract":[{"lang":"eng","text":"In this paper, we introduce a random forest semantic hashing scheme that embeds tiny convolutional neural networks (CNN) into shallow random forests. A binary hash code for a data point is obtained by a set of decision trees, setting ‘1’ for the visited tree leaf, and ‘0’ for the rest. We propose to first randomly group arriving classes at each tree split node into two groups, obtaining a significantly simplified two-class classification problem that can be a handled with a light-weight CNN weak learner. Code uniqueness is achieved via the random class grouping, whilst code consistency is achieved using a low-rank loss in the CNN weak learners that encourages intra-class compactness for the two random class groups. Finally, we introduce an information-theoretic approach for aggregating codes of individual trees into a single hash code, producing a near-optimal unique hash for each class. The proposed approach significantly outperforms state-of-the-art hashing methods for image retrieval tasks on large-scale public datasets, and is comparable to image classification methods while utilizing a more compact, efficient and scalable representation. This work proposes a principled and robust procedure to train and deploy in parallel an ensemble of light-weight CNNs, instead of simply going deeper."}],"article_processing_charge":"No","conference":{"location":"Munich, Germany","end_date":"2018-09-14","name":"ECCV: European Conference on Computer Vision","start_date":"2018-09-08"},"year":"2018","oa_version":"None","date_updated":"2025-01-23T13:25:18Z","date_published":"2018-10-09T00:00:00Z","extern":"1","intvolume":"     11206","scopus_import":"1","author":[{"full_name":"Qiu, Qiang","last_name":"Qiu","first_name":"Qiang"},{"first_name":"José","last_name":"Lezama","full_name":"Lezama, José"},{"last_name":"Bronstein","full_name":"Bronstein, Alexander","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730"},{"first_name":"Guillermo","last_name":"Sapiro","full_name":"Sapiro, Guillermo"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication":"European Conference on Computer Vision","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["9783030012168"],"isbn":["9783030012151"]},"status":"public","type":"conference","day":"09","publisher":"Springer Nature","issue":"Part II"},{"publication_status":"published","date_created":"2024-10-09T07:47:49Z","language":[{"iso":"eng"}],"volume":11070,"quality_controlled":"1","abstract":[{"text":"Cardiac ultrasound imaging requires a high frame rate in order to capture rapid motion. This can be achieved by multi-line acquisition (MLA), where several narrow-focused received lines are obtained from each wide-focused transmitted line. This shortens the acquisition time at the expense of introducing block artifacts. In this paper, we propose a data-driven learning-based approach to improve the MLA image quality. We train an end-to-end convolutional neural network on pairs of real ultrasound cardiac data, acquired through MLA and the corresponding single-line acquisition (SLA). The network achieves a significant improvement in image quality for both 5- and 7-line MLA resulting in a decorrelation measure similar to that of SLA while having the frame rate of MLA.","lang":"eng"}],"publication":"International Conference on Medical Image Computing and Computer Assisted Intervention","author":[{"last_name":"Senouf","full_name":"Senouf, Ortal","first_name":"Ortal"},{"first_name":"Sanketh","full_name":"Vedula, Sanketh","last_name":"Vedula"},{"full_name":"Zurakhov, Grigoriy","last_name":"Zurakhov","first_name":"Grigoriy"},{"orcid":"0000-0001-9699-8730","full_name":"Bronstein, Alexander","last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander"},{"first_name":"Michael","full_name":"Zibulevsky, Michael","last_name":"Zibulevsky"},{"first_name":"Oleg","last_name":"Michailovich","full_name":"Michailovich, Oleg"},{"first_name":"Dan","last_name":"Adam","full_name":"Adam, Dan"},{"last_name":"Blondheim","full_name":"Blondheim, David","first_name":"David"}],"scopus_import":"1","intvolume":"     11070","publication_identifier":{"isbn":["9783030009274"],"eisbn":["9783030009281"],"eissn":["1611-3349"],"issn":["0302-9743"]},"doi":"10.1007/978-3-030-00928-1_15","alternative_title":["LNCS"],"_id":"18283","title":"High frame-rate cardiac ultrasound imaging with deep learning","month":"09","article_processing_charge":"No","conference":{"name":"MICCAI: Medical Image Computing and Computer Assisted Intervention","start_date":"2018-09-16","location":"Granada, Spain","end_date":"2018-09-20"},"citation":{"ama":"Senouf O, Vedula S, Zurakhov G, et al. High frame-rate cardiac ultrasound imaging with deep learning. In: <i>International Conference on Medical Image Computing and Computer Assisted Intervention</i>. Vol 11070. Springer Nature; 2018:126-134. doi:<a href=\"https://doi.org/10.1007/978-3-030-00928-1_15\">10.1007/978-3-030-00928-1_15</a>","apa":"Senouf, O., Vedula, S., Zurakhov, G., Bronstein, A. M., Zibulevsky, M., Michailovich, O., … Blondheim, D. (2018). High frame-rate cardiac ultrasound imaging with deep learning. In <i>International Conference on Medical Image Computing and Computer Assisted Intervention</i> (Vol. 11070, pp. 126–134). Granada, Spain: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-00928-1_15\">https://doi.org/10.1007/978-3-030-00928-1_15</a>","chicago":"Senouf, Ortal, Sanketh Vedula, Grigoriy Zurakhov, Alex M. Bronstein, Michael Zibulevsky, Oleg Michailovich, Dan Adam, and David Blondheim. “High Frame-Rate Cardiac Ultrasound Imaging with Deep Learning.” In <i>International Conference on Medical Image Computing and Computer Assisted Intervention</i>, 11070:126–34. Springer Nature, 2018. <a href=\"https://doi.org/10.1007/978-3-030-00928-1_15\">https://doi.org/10.1007/978-3-030-00928-1_15</a>.","ista":"Senouf O, Vedula S, Zurakhov G, Bronstein AM, Zibulevsky M, Michailovich O, Adam D, Blondheim D. 2018. High frame-rate cardiac ultrasound imaging with deep learning. International Conference on Medical Image Computing and Computer Assisted Intervention. MICCAI: Medical Image Computing and Computer Assisted Intervention, LNCS, vol. 11070, 126–134.","mla":"Senouf, Ortal, et al. “High Frame-Rate Cardiac Ultrasound Imaging with Deep Learning.” <i>International Conference on Medical Image Computing and Computer Assisted Intervention</i>, vol. 11070, no. Part 1, Springer Nature, 2018, pp. 126–34, doi:<a href=\"https://doi.org/10.1007/978-3-030-00928-1_15\">10.1007/978-3-030-00928-1_15</a>.","short":"O. Senouf, S. Vedula, G. Zurakhov, A.M. Bronstein, M. Zibulevsky, O. Michailovich, D. Adam, D. Blondheim, in:, International Conference on Medical Image Computing and Computer Assisted Intervention, Springer Nature, 2018, pp. 126–134.","ieee":"O. Senouf <i>et al.</i>, “High frame-rate cardiac ultrasound imaging with deep learning,” in <i>International Conference on Medical Image Computing and Computer Assisted Intervention</i>, Granada, Spain, 2018, vol. 11070, no. Part 1, pp. 126–134."},"date_published":"2018-09-14T00:00:00Z","year":"2018","oa_version":"None","date_updated":"2025-01-23T13:13:01Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","extern":"1","page":"126 - 134","status":"public","type":"conference","publisher":"Springer Nature","day":"14","issue":"Part 1"},{"publication_status":"published","doi":"10.1007/978-3-030-00129-2_17","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"date_created":"2024-10-09T07:48:06Z","quality_controlled":"1","title":"High quality ultrasonic multi-line transmission through deep learning","month":"09","volume":11074,"_id":"18284","citation":{"chicago":"Vedula, Sanketh, Ortal Senouf, Grigoriy Zurakhov, Alex M. Bronstein, Michael Zibulevsky, Oleg Michailovich, Dan Adam, and Diana Gaitini. “High Quality Ultrasonic Multi-Line Transmission through Deep Learning.” In <i>First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018</i>, 11074:147–55. Springer Nature, 2018. <a href=\"https://doi.org/10.1007/978-3-030-00129-2_17\">https://doi.org/10.1007/978-3-030-00129-2_17</a>.","ista":"Vedula S, Senouf O, Zurakhov G, Bronstein AM, Zibulevsky M, Michailovich O, Adam D, Gaitini D. 2018. High quality ultrasonic multi-line transmission through deep learning. First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018. MLMIR: Workshop on Machine Learning for Medical Image Reconstruction, LNCS, vol. 11074, 147–155.","ama":"Vedula S, Senouf O, Zurakhov G, et al. High quality ultrasonic multi-line transmission through deep learning. In: <i>First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018</i>. Vol 11074. Springer Nature; 2018:147-155. doi:<a href=\"https://doi.org/10.1007/978-3-030-00129-2_17\">10.1007/978-3-030-00129-2_17</a>","apa":"Vedula, S., Senouf, O., Zurakhov, G., Bronstein, A. M., Zibulevsky, M., Michailovich, O., … Gaitini, D. (2018). High quality ultrasonic multi-line transmission through deep learning. In <i>First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018</i> (Vol. 11074, pp. 147–155). Granada, Spain: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-00129-2_17\">https://doi.org/10.1007/978-3-030-00129-2_17</a>","ieee":"S. Vedula <i>et al.</i>, “High quality ultrasonic multi-line transmission through deep learning,” in <i>First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018</i>, Granada, Spain, 2018, vol. 11074, pp. 147–155.","short":"S. Vedula, O. Senouf, G. Zurakhov, A.M. Bronstein, M. Zibulevsky, O. Michailovich, D. Adam, D. Gaitini, in:, First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018, Springer Nature, 2018, pp. 147–155.","mla":"Vedula, Sanketh, et al. “High Quality Ultrasonic Multi-Line Transmission through Deep Learning.” <i>First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018</i>, vol. 11074, Springer Nature, 2018, pp. 147–55, doi:<a href=\"https://doi.org/10.1007/978-3-030-00129-2_17\">10.1007/978-3-030-00129-2_17</a>."},"article_processing_charge":"No","abstract":[{"text":"Frame rate is a crucial consideration in cardiac ultrasound imaging and 3D sonography. Several methods have been proposed in the medical ultrasound literature aiming at accelerating the image acquisition. In this paper, we consider one such method called multi-line transmission (MLT), in which several evenly separated focused beams are transmitted simultaneously. While MLT reduces the acquisition time, it comes at the expense of a heavy loss of contrast due to the interactions between the beams (cross-talk artifact). In this paper, we introduce a data-driven method to reduce the artifacts arising in MLT. To this end, we propose to train an end-to-end convolutional neural network consisting of correction layers followed by a constant apodization layer. The network is trained on pairs of raw data obtained through MLT and the corresponding single-line transmission (SLT) data. Experimental evaluation demonstrates significant improvement both in the visual image quality and in objective measures such as contrast ratio and contrast-to-noise ratio, while preserving resolution unlike traditional apodization-based methods. We show that the proposed method is able to generalize well across different patients and anatomies on real and phantom data.","lang":"eng"}],"conference":{"name":"MLMIR: Workshop on Machine Learning for Medical Image Reconstruction","start_date":"2018-09-16","location":"Granada, Spain","end_date":"2018-09-16"},"year":"2018","oa_version":"None","date_updated":"2025-01-23T12:53:22Z","date_published":"2018-09-12T00:00:00Z","extern":"1","intvolume":"     11074","page":"147 - 155","scopus_import":"1","author":[{"first_name":"Sanketh","full_name":"Vedula, Sanketh","last_name":"Vedula"},{"last_name":"Senouf","full_name":"Senouf, Ortal","first_name":"Ortal"},{"full_name":"Zurakhov, Grigoriy","last_name":"Zurakhov","first_name":"Grigoriy"},{"id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","full_name":"Bronstein, Alexander","last_name":"Bronstein","orcid":"0000-0001-9699-8730"},{"last_name":"Zibulevsky","full_name":"Zibulevsky, Michael","first_name":"Michael"},{"first_name":"Oleg","last_name":"Michailovich","full_name":"Michailovich, Oleg"},{"first_name":"Dan","last_name":"Adam","full_name":"Adam, Dan"},{"last_name":"Gaitini","full_name":"Gaitini, Diana","first_name":"Diana"}],"publication":"First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783030001285"],"eisbn":["9783030001292"]},"status":"public","day":"12","publisher":"Springer Nature","type":"conference"},{"alternative_title":["LNCS"],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-99073-6_6","date_created":"2020-08-26T11:47:34Z","publication_status":"published","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>","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>.","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."},"conference":{"location":"Barcelona, Spain","end_date":"2018-09-07","name":"ESORICS: European Symposium on Research in Computer Security","start_date":"2018-09-03"},"article_processing_charge":"No","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."}],"month":"08","title":"Channels: Horizontal scaling and confidentiality on permissioned blockchains","quality_controlled":"1","volume":11098,"_id":"8298","page":"111-131","intvolume":"     11098","extern":"1","author":[{"last_name":"Androulaki","full_name":"Androulaki, Elli","first_name":"Elli"},{"first_name":"Christian","full_name":"Cachin, Christian","last_name":"Cachin"},{"first_name":"Angelo","full_name":"De Caro, Angelo","last_name":"De Caro"},{"last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Computer Security","date_updated":"2021-01-12T08:17:57Z","year":"2018","oa_version":"None","date_published":"2018-08-08T00:00:00Z","publisher":"Springer Nature","type":"conference","day":"08","publication_identifier":{"eisbn":["9783319990736"],"isbn":["9783319990729"],"issn":["0302-9743","1611-3349"]},"status":"public"},{"publication_identifier":{"isbn":["978-3-030-05287-4"],"eisbn":["978-3-030-05288-1"],"issn":["0302-9743"],"eissn":["1611-3349"]},"status":"public","publisher":"Springer","day":"22","type":"conference","oa_version":"None","year":"2018","date_updated":"2022-01-27T15:26:39Z","date_published":"2018-11-22T00:00:00Z","extern":"1","intvolume":"     11255","page":"82-96","author":[{"first_name":"Girish","last_name":"Koshti","full_name":"Koshti, Girish"},{"first_name":"Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas","full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890"},{"first_name":"Gaëlle","last_name":"Largeteau-Skapin","full_name":"Largeteau-Skapin, Gaëlle"},{"full_name":"Zrour, Rita","last_name":"Zrour","first_name":"Rita"},{"full_name":"Andres, Eric","last_name":"Andres","first_name":"Eric"},{"first_name":"Partha","full_name":"Bhowmick, Partha","last_name":"Bhowmick"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication":"19th International Workshop","place":"Cham","title":"Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D","quality_controlled":"1","month":"11","volume":11255,"_id":"6164","citation":{"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>.","short":"G. Koshti, R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, P. Bhowmick, in:, 19th International Workshop, Springer, Cham, 2018, pp. 82–96.","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.","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>","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>","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>.","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."},"abstract":[{"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.","lang":"eng"}],"article_processing_charge":"No","conference":{"start_date":"2018-11-22","name":"IWCIA: International Workshop on Combinatorial Image Analysis","end_date":"2018-11-24","location":"Porto, Portugal"},"publication_status":"published","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-05288-1_7","alternative_title":["LNCS"],"date_created":"2019-03-21T12:16:58Z"},{"_id":"85","month":"08","title":"Snapshot based synchronization: A fast replacement for Hand-over-Hand locking","conference":{"location":"Turin, Italy","end_date":"2018-08-31","name":"Euro-Par: European Conference on Parallel Processing","start_date":"2018-08-27"},"article_processing_charge":"No","citation":{"chicago":"Gilad, Eran, Trevor A Brown, Mark Oskin, and Yoav Etsion. “Snapshot Based Synchronization: A Fast Replacement for Hand-over-Hand Locking,” 11014:465–79. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">https://doi.org/10.1007/978-3-319-96983-1_33</a>.","ista":"Gilad E, Brown TA, Oskin M, Etsion Y. 2018. Snapshot based synchronization: A fast replacement for Hand-over-Hand locking. Euro-Par: European Conference on Parallel Processing, LNCS, vol. 11014, 465–479.","ama":"Gilad E, Brown TA, Oskin M, Etsion Y. Snapshot based synchronization: A fast replacement for Hand-over-Hand locking. In: Vol 11014. Springer; 2018:465-479. doi:<a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">10.1007/978-3-319-96983-1_33</a>","apa":"Gilad, E., Brown, T. A., Oskin, M., &#38; Etsion, Y. (2018). Snapshot based synchronization: A fast replacement for Hand-over-Hand locking (Vol. 11014, pp. 465–479). Presented at the Euro-Par: European Conference on Parallel Processing, Turin, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">https://doi.org/10.1007/978-3-319-96983-1_33</a>","ieee":"E. Gilad, T. A. Brown, M. Oskin, and Y. Etsion, “Snapshot based synchronization: A fast replacement for Hand-over-Hand locking,” presented at the Euro-Par: European Conference on Parallel Processing, Turin, Italy, 2018, vol. 11014, pp. 465–479.","mla":"Gilad, Eran, et al. <i>Snapshot Based Synchronization: A Fast Replacement for Hand-over-Hand Locking</i>. Vol. 11014, Springer, 2018, pp. 465–79, doi:<a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">10.1007/978-3-319-96983-1_33</a>.","short":"E. Gilad, T.A. Brown, M. Oskin, Y. Etsion, in:, Springer, 2018, pp. 465–479."},"ddc":["000"],"alternative_title":["LNCS"],"publist_id":"7969","doi":"10.1007/978-3-319-96983-1_33","status":"public","type":"conference","publisher":"Springer","day":"01","has_accepted_license":"1","date_published":"2018-08-01T00:00:00Z","project":[{"name":"NSERC Postdoctoral fellowship","_id":"26450934-B435-11E9-9278-68D0E5697425"}],"date_updated":"2026-04-16T09:53:41Z","year":"2018","oa_version":"Preprint","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"465 - 479","volume":11014,"quality_controlled":"1","abstract":[{"text":"Concurrent accesses to shared data structures must be synchronized to avoid data races. Coarse-grained synchronization, which locks the entire data structure, is easy to implement but does not scale. Fine-grained synchronization can scale well, but can be hard to reason about. Hand-over-hand locking, in which operations are pipelined as they traverse the data structure, combines fine-grained synchronization with ease of use. However, the traditional implementation suffers from inherent overheads. This paper introduces snapshot-based synchronization (SBS), a novel hand-over-hand locking mechanism. SBS decouples the synchronization state from the data, significantly improving cache utilization. Further, it relies on guarantees provided by pipelining to minimize synchronization that requires cross-thread communication. Snapshot-based synchronization thus scales much better than traditional hand-over-hand locking, while maintaining the same ease of use.","lang":"eng"}],"publication_status":"published","date_created":"2018-12-11T11:44:33Z","external_id":{"isi":["000851042300031"]},"department":[{"_id":"DaAl"}],"language":[{"iso":"eng"}],"acknowledgement":"Trevor Brown was supported in part by the ISF (grants 2005/17 & 1749/14) and by a NSERC post-doctoral fellowship.","file":[{"relation":"main_file","access_level":"open_access","file_size":665372,"date_created":"2019-02-12T07:40:40Z","file_id":"5954","file_name":"2018_Brown.pdf","creator":"dernst","date_updated":"2020-07-14T12:48:14Z","checksum":"13a3f250be8878405e791b53c19722ad","content_type":"application/pdf"}],"publication_identifier":{"issn":["0302-9743"]},"oa":1,"author":[{"last_name":"Gilad","full_name":"Gilad, Eran","first_name":"Eran"},{"full_name":"Brown, Trevor A","last_name":"Brown","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","first_name":"Trevor A"},{"full_name":"Oskin, Mark","last_name":"Oskin","first_name":"Mark"},{"full_name":"Etsion, Yoav","last_name":"Etsion","first_name":"Yoav"}],"scopus_import":"1","file_date_updated":"2020-07-14T12:48:14Z","intvolume":"     11014","isi":1},{"file":[{"content_type":"application/pdf","checksum":"6dca832f575d6b3f0ea9dff56f579142","date_updated":"2020-07-14T12:44:50Z","file_name":"IST-2018-1010-v1+1_space-time_interpolants.pdf","creator":"system","date_created":"2018-12-12T10:17:53Z","file_id":"5310","file_size":563710,"access_level":"open_access","relation":"main_file"}],"oa":1,"publication_identifier":{"issn":["0302-9743"]},"scopus_import":"1","author":[{"full_name":"Frehse, Goran","last_name":"Frehse","first_name":"Goran"},{"last_name":"Giacobbe","full_name":"Giacobbe, Mirco","first_name":"Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8180-0904"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2020-07-14T12:44:50Z","intvolume":"     10981","isi":1,"abstract":[{"lang":"eng","text":"Reachability analysis is difficult for hybrid automata with affine differential equations, because the reach set needs to be approximated. Promising abstraction techniques usually employ interval methods or template polyhedra. Interval methods account for dense time and guarantee soundness, and there are interval-based tools that overapproximate affine flowpipes. But interval methods impose bounded and rigid shapes, which make refinement expensive and fixpoint detection difficult. Template polyhedra, on the other hand, can be adapted flexibly and can be unbounded, but sound template refinement for unbounded reachability analysis has been implemented only for systems with piecewise constant dynamics. We capitalize on the advantages of both techniques, combining interval arithmetic and template polyhedra, using the former to abstract time and the latter to abstract space. During a CEGAR loop, whenever a spurious error trajectory is found, we compute additional space constraints and split time intervals, and use these space-time interpolants to eliminate the counterexample. Space-time interpolation offers a lazy, flexible framework for increasing precision while guaranteeing soundness, both for error avoidance and fixpoint detection. To the best of out knowledge, this is the first abstraction refinement scheme for the reachability analysis over unbounded and dense time of affine hybrid systems, which is both sound and automatic. We demonstrate the effectiveness of our algorithm with several benchmark examples, which cannot be handled by other tools."}],"license":"https://creativecommons.org/licenses/by/4.0/","volume":10981,"quality_controlled":"1","department":[{"_id":"ToHe"}],"external_id":{"isi":["000491481600025"]},"date_created":"2018-12-11T11:44:50Z","language":[{"iso":"eng"}],"publication_status":"published","day":"18","publisher":"Springer","type":"conference","status":"public","tmp":{"short":"CC BY (4.0)","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)"},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"468 - 486","has_accepted_license":"1","date_published":"2018-07-18T00:00:00Z","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"oa_version":"Published Version","year":"2018","date_updated":"2026-04-16T09:55:04Z","article_processing_charge":"No","conference":{"end_date":"2018-07-17","location":"Oxford, United Kingdom","start_date":"2018-07-14","name":"CAV: Computer Aided Verification"},"citation":{"mla":"Frehse, Goran, et al. <i>Space-Time Interpolants</i>. Vol. 10981, Springer, 2018, pp. 468–86, doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">10.1007/978-3-319-96145-3_25</a>.","short":"G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2018, pp. 468–486.","ieee":"G. Frehse, M. Giacobbe, and T. A. Henzinger, “Space-time interpolants,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 468–486.","apa":"Frehse, G., Giacobbe, M., &#38; Henzinger, T. A. (2018). Space-time interpolants (Vol. 10981, pp. 468–486). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">https://doi.org/10.1007/978-3-319-96145-3_25</a>","ama":"Frehse G, Giacobbe M, Henzinger TA. Space-time interpolants. In: Vol 10981. Springer; 2018:468-486. doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">10.1007/978-3-319-96145-3_25</a>","ista":"Frehse G, Giacobbe M, Henzinger TA. 2018. Space-time interpolants. CAV: Computer Aided Verification, LNCS, vol. 10981, 468–486.","chicago":"Frehse, Goran, Mirco Giacobbe, and Thomas A Henzinger. “Space-Time Interpolants,” 10981:468–86. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">https://doi.org/10.1007/978-3-319-96145-3_25</a>."},"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"6894"}]},"_id":"140","title":"Space-time interpolants","month":"07","doi":"10.1007/978-3-319-96145-3_25","publist_id":"7783","alternative_title":["LNCS"],"ddc":["005"],"pubrep_id":"1010"},{"_id":"5788","title":"Infinite-duration poorman-bidding games","month":"11","article_processing_charge":"No","conference":{"name":"14th International Conference on Web and Internet Economics, WINE","start_date":"2018-12-15","location":"Oxford, UK","end_date":"2018-12-17"},"citation":{"ieee":"G. Avni, T. A. Henzinger, and R. Ibsen-Jensen, “Infinite-duration poorman-bidding games,” presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK, 2018, vol. 11316, pp. 21–36.","short":"G. Avni, T.A. Henzinger, R. Ibsen-Jensen, in:, Springer, 2018, pp. 21–36.","mla":"Avni, Guy, et al. <i>Infinite-Duration Poorman-Bidding Games</i>. Vol. 11316, Springer, 2018, pp. 21–36, doi:<a href=\"https://doi.org/10.1007/978-3-030-04612-5_2\">10.1007/978-3-030-04612-5_2</a>.","chicago":"Avni, Guy, Thomas A Henzinger, and Rasmus Ibsen-Jensen. “Infinite-Duration Poorman-Bidding Games,” 11316:21–36. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-04612-5_2\">https://doi.org/10.1007/978-3-030-04612-5_2</a>.","ista":"Avni G, Henzinger TA, Ibsen-Jensen R. 2018. Infinite-duration poorman-bidding games. 14th International Conference on Web and Internet Economics, WINE, LNCS, vol. 11316, 21–36.","ama":"Avni G, Henzinger TA, Ibsen-Jensen R. Infinite-duration poorman-bidding games. In: Vol 11316. Springer; 2018:21-36. doi:<a href=\"https://doi.org/10.1007/978-3-030-04612-5_2\">10.1007/978-3-030-04612-5_2</a>","apa":"Avni, G., Henzinger, T. A., &#38; Ibsen-Jensen, R. (2018). Infinite-duration poorman-bidding games (Vol. 11316, pp. 21–36). Presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-030-04612-5_2\">https://doi.org/10.1007/978-3-030-04612-5_2</a>"},"arxiv":1,"doi":"10.1007/978-3-030-04612-5_2","alternative_title":["LNCS"],"status":"public","type":"conference","day":"21","publisher":"Springer","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369"}],"date_published":"2018-11-21T00:00:00Z","year":"2018","oa_version":"Preprint","date_updated":"2026-04-16T09:54:39Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"21-36","volume":11316,"quality_controlled":"1","abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner or payoff of the game. Such games are central in formal verification since they model the interaction between a non-terminating system and its environment. We study bidding games in which the players bid for the right to move the token. Two bidding rules have been defined. In Richman bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Poorman bidding is similar except that the winner of the bidding pays the “bank” rather than the other player. While poorman reachability games have been studied before, we present, for the first time, results on infinite-duration poorman games. A central quantity in these games is the ratio between the two players’ initial budgets. The questions we study concern a necessary and sufficient ratio with which a player can achieve a goal. For reachability objectives, such threshold ratios are known to exist for both bidding rules. We show that the properties of poorman reachability games extend to complex qualitative objectives such as parity, similarly to the Richman case. Our most interesting results concern quantitative poorman games, namely poorman mean-payoff games, where we construct optimal strategies depending on the initial ratio, by showing a connection with random-turn based games. The connection in itself is interesting, because it does not hold for reachability poorman games. We also solve the complexity problems that arise in poorman bidding games."}],"department":[{"_id":"ToHe"}],"external_id":{"arxiv":["1804.04372"],"isi":["000865933000002"]},"date_created":"2018-12-30T22:59:14Z","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783030046118"],"issn":["0302-9743"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1804.04372","open_access":"1"}],"author":[{"orcid":"0000-0001-5588-8287","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy","last_name":"Avni"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389"}],"scopus_import":"1","isi":1,"intvolume":"     11316"},{"isi":1,"intvolume":"     11275","author":[{"first_name":"Mingzhang","full_name":"Huang, Mingzhang","last_name":"Huang"},{"full_name":"Fu, Hongfei","last_name":"Fu","first_name":"Hongfei"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"}],"scopus_import":"1","publication_identifier":{"isbn":["9783030027674"],"issn":["0302-9743"]},"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1806.06683"}],"language":[{"iso":"eng"}],"external_id":{"isi":["000916310900011"],"arxiv":["1806.06683"]},"department":[{"_id":"KrCh"}],"date_created":"2018-12-16T22:59:20Z","quality_controlled":"1","volume":11275,"editor":[{"full_name":"Ryu, Sukyoung","last_name":"Ryu","first_name":"Sukyoung"}],"abstract":[{"text":"We study the almost-sure termination problem for probabilistic programs. First, we show that supermartingales with lower bounds on conditional absolute difference provide a sound approach for the almost-sure termination problem. Moreover, using this approach we can obtain explicit optimal bounds on tail probabilities of non-termination within a given number of steps. Second, we present a new approach based on Central Limit Theorem for the almost-sure termination problem, and show that this approach can establish almost-sure termination of programs which none of the existing approaches can handle. Finally, we discuss algorithmic approaches for the two above methods that lead to automated analysis techniques for almost-sure termination of probabilistic programs.","lang":"eng"}],"year":"2018","oa_version":"Preprint","date_updated":"2026-04-16T09:54:21Z","date_published":"2018-12-01T00:00:00Z","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"page":"181-201","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","status":"public","publisher":"Springer","day":"01","type":"conference","arxiv":1,"doi":"10.1007/978-3-030-02768-1_11","alternative_title":["LNCS"],"title":"New approaches for almost-sure termination of probabilistic programs","month":"12","_id":"5679","citation":{"ieee":"M. Huang, H. Fu, and K. Chatterjee, “New approaches for almost-sure termination of probabilistic programs,” presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand, 2018, vol. 11275, pp. 181–201.","mla":"Huang, Mingzhang, et al. <i>New Approaches for Almost-Sure Termination of Probabilistic Programs</i>. Edited by Sukyoung Ryu, vol. 11275, Springer, 2018, pp. 181–201, doi:<a href=\"https://doi.org/10.1007/978-3-030-02768-1_11\">10.1007/978-3-030-02768-1_11</a>.","short":"M. Huang, H. Fu, K. Chatterjee, in:, S. Ryu (Ed.), Springer, 2018, pp. 181–201.","ista":"Huang M, Fu H, Chatterjee K. 2018. New approaches for almost-sure termination of probabilistic programs. 16th Asian Symposium on Programming Languages and Systems, APLAS, LNCS, vol. 11275, 181–201.","chicago":"Huang, Mingzhang, Hongfei Fu, and Krishnendu Chatterjee. “New Approaches for Almost-Sure Termination of Probabilistic Programs.” edited by Sukyoung Ryu, 11275:181–201. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-02768-1_11\">https://doi.org/10.1007/978-3-030-02768-1_11</a>.","apa":"Huang, M., Fu, H., &#38; Chatterjee, K. (2018). New approaches for almost-sure termination of probabilistic programs. In S. Ryu (Ed.) (Vol. 11275, pp. 181–201). Presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand: Springer. <a href=\"https://doi.org/10.1007/978-3-030-02768-1_11\">https://doi.org/10.1007/978-3-030-02768-1_11</a>","ama":"Huang M, Fu H, Chatterjee K. New approaches for almost-sure termination of probabilistic programs. In: Ryu S, ed. Vol 11275. Springer; 2018:181-201. doi:<a href=\"https://doi.org/10.1007/978-3-030-02768-1_11\">10.1007/978-3-030-02768-1_11</a>"},"article_processing_charge":"No","conference":{"end_date":"2018-12-06","location":"Wellington, New Zealand","start_date":"2018-12-02","name":"16th Asian Symposium on Programming Languages and Systems, APLAS"}},{"alternative_title":["LNCS"],"doi":"10.1007/978-3-662-58387-6_26","month":"12","title":"SpaceMint: A cryptocurrency based on proofs of space","_id":"6941","citation":{"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.","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>.","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>","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>","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.","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>.","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."},"conference":{"location":"Nieuwpoort, Curacao","end_date":"2018-03-02","name":"FC: Financial Cryptography and Data Security","start_date":"2018-02-26"},"article_processing_charge":"No","date_updated":"2026-04-16T10:30:49Z","oa_version":"Submitted Version","year":"2018","project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"date_published":"2018-12-07T00:00:00Z","page":"480-499","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","status":"public","day":"07","type":"conference","publisher":"Springer Nature","publication_status":"published","language":[{"iso":"eng"}],"date_created":"2019-10-14T06:35:38Z","department":[{"_id":"KrPi"}],"external_id":{"isi":["000540656400026"]},"quality_controlled":"1","volume":10957,"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"}],"isi":1,"intvolume":"     10957","ec_funded":1,"author":[{"first_name":"Sunoo","full_name":"Park, Sunoo","last_name":"Park"},{"first_name":"Albert","full_name":"Kwon, Albert","last_name":"Kwon"},{"last_name":"Fuchsbauer","full_name":"Fuchsbauer, Georg","first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Gazi, Peter","last_name":"Gazi","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","first_name":"Peter"},{"last_name":"Alwen","full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654"}],"scopus_import":"1","publication":"22nd International Conference on Financial Cryptography and Data Security","oa":1,"publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783662583876"],"isbn":["9783662583869"]},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2015/528"}]},{"publication_status":"published","date_created":"2022-08-08T13:16:37Z","alternative_title":["LNCS"],"doi":"10.1007/978-3-319-73117-9_3","language":[{"iso":"eng"}],"_id":"11772","volume":10706,"month":"12","quality_controlled":"1","title":"The state of the art in dynamic graph algorithms","conference":{"name":"SOFSEM: Theory and Practice of Computer Science","start_date":"2018-01-29","location":"Krems, Austria","end_date":"2018-02-02"},"article_processing_charge":"No","abstract":[{"lang":"eng","text":"A dynamic graph algorithm is a data structure that supports operations on dynamically changing graphs."}],"citation":{"ieee":"M. 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.","mla":"Henzinger, Monika. “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>.","short":"M. Henzinger, in:, 44th International Conference on Current Trends in Theory and Practice of Computer Science, Springer Nature, 2017, pp. 40–44.","chicago":"Henzinger, Monika. “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>.","ista":"Henzinger M. 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.","ama":"Henzinger M. 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>","apa":"Henzinger, M. (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>"},"date_published":"2017-12-22T00:00:00Z","date_updated":"2024-11-06T08:15:42Z","oa_version":"None","year":"2017","publication":"44th International Conference on Current Trends in Theory and Practice of Computer Science","author":[{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530"}],"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"     10706","page":"40–44","extern":"1","status":"public","publication_identifier":{"issn":["0302-9743"],"eisbn":["9783319731179"],"isbn":["9783319731162"]},"day":"22","publisher":"Springer Nature","type":"conference"},{"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-58771-4_54","alternative_title":["LNCS"],"date_created":"2024-10-15T11:20:54Z","publication_status":"published","citation":{"ama":"Boyarski A, Bronstein AM, Bronstein MM. Subspace least squares multidimensional scaling. In: <i>International Conference on Scale Space and Variational Methods in Computer Vision</i>. Vol 10302. Springer Nature; 2017:681-693. doi:<a href=\"https://doi.org/10.1007/978-3-319-58771-4_54\">10.1007/978-3-319-58771-4_54</a>","apa":"Boyarski, A., Bronstein, A. M., &#38; Bronstein, M. M. (2017). Subspace least squares multidimensional scaling. In <i>International Conference on Scale Space and Variational Methods in Computer Vision</i> (Vol. 10302, pp. 681–693). Kolding, Denmark: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-58771-4_54\">https://doi.org/10.1007/978-3-319-58771-4_54</a>","chicago":"Boyarski, Amit, Alex M. Bronstein, and Michael M. Bronstein. “Subspace Least Squares Multidimensional Scaling.” In <i>International Conference on Scale Space and Variational Methods in Computer Vision</i>, 10302:681–93. Springer Nature, 2017. <a href=\"https://doi.org/10.1007/978-3-319-58771-4_54\">https://doi.org/10.1007/978-3-319-58771-4_54</a>.","ista":"Boyarski A, Bronstein AM, Bronstein MM. 2017. Subspace least squares multidimensional scaling. International Conference on Scale Space and Variational Methods in Computer Vision. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 681–693.","mla":"Boyarski, Amit, et al. “Subspace Least Squares Multidimensional Scaling.” <i>International Conference on Scale Space and Variational Methods in Computer Vision</i>, vol. 10302, Springer Nature, 2017, pp. 681–93, doi:<a href=\"https://doi.org/10.1007/978-3-319-58771-4_54\">10.1007/978-3-319-58771-4_54</a>.","short":"A. Boyarski, A.M. Bronstein, M.M. Bronstein, in:, International Conference on Scale Space and Variational Methods in Computer Vision, Springer Nature, 2017, pp. 681–693.","ieee":"A. Boyarski, A. M. Bronstein, and M. M. Bronstein, “Subspace least squares multidimensional scaling,” in <i>International Conference on Scale Space and Variational Methods in Computer Vision</i>, Kolding, Denmark, 2017, vol. 10302, pp. 681–693."},"abstract":[{"text":"Multidimensional Scaling (MDS) is one of the most popular methods for dimensionality reduction and visualization of high dimensional data. Apart from these tasks, it also found applications in the field of geometry processing for the analysis and reconstruction of non-rigid shapes. In this regard, MDS can be thought of as a shape from metric algorithm, consisting of finding a configuration of points in the Euclidean space that realize, as isometrically as possible, some given distance structure. In the present work we cast the least squares variant of MDS (LS-MDS) in the spectral domain. This uncovers a multiresolution property of distance scaling which speeds up the optimization by a significant amount, while producing comparable, and sometimes even better, embeddings.","lang":"eng"}],"article_processing_charge":"No","conference":{"location":"Kolding, Denmark","end_date":"2017-06-08","name":"SSVM: Scale Space and Variational Methods in Computer Vision","start_date":"2017-06-04"},"quality_controlled":"1","title":"Subspace least squares multidimensional scaling","month":"05","volume":10302,"_id":"18329","extern":"1","page":"681-693","intvolume":"     10302","publication":"International Conference on Scale Space and Variational Methods in Computer Vision","scopus_import":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Amit","full_name":"Boyarski, Amit","last_name":"Boyarski"},{"orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","last_name":"Bronstein","full_name":"Bronstein, Alexander"},{"first_name":"Michael M.","last_name":"Bronstein","full_name":"Bronstein, Michael M."}],"oa_version":"None","year":"2017","date_updated":"2025-01-23T08:42:25Z","date_published":"2017-05-18T00:00:00Z","type":"conference","publisher":"Springer Nature","day":"18","publication_identifier":{"eisbn":["9783319587714"],"isbn":["9783319587707"],"issn":["0302-9743"],"eissn":["1611-3349"]},"status":"public"},{"issue":"Part 1","type":"conference","publisher":"Springer Nature","day":"04","status":"public","page":"566 - 574","extern":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-01-16T16:04:30Z","oa_version":"None","year":"2017","date_published":"2017-09-04T00:00:00Z","citation":{"ieee":"G. Alexandroni <i>et al.</i>, “White matter fiber representation using continuous dictionary learning,” in <i>20th International Conference on Medical Image Computing and Computer-Assisted Intervention</i>, Quebec City, QC, Canada, 2017, vol. 10433, no. Part 1, pp. 566–574.","mla":"Alexandroni, Guy, et al. “White Matter Fiber Representation Using Continuous Dictionary Learning.” <i>20th International Conference on Medical Image Computing and Computer-Assisted Intervention</i>, vol. 10433, no. Part 1, Springer Nature, 2017, pp. 566–74, doi:<a href=\"https://doi.org/10.1007/978-3-319-66182-7_65\">10.1007/978-3-319-66182-7_65</a>.","short":"G. Alexandroni, Y. Podolsky, H. Greenspan, T. Remez, O. Litany, A.M. Bronstein, R. Giryes, in:, 20th International Conference on Medical Image Computing and Computer-Assisted Intervention, Springer Nature, 2017, pp. 566–574.","chicago":"Alexandroni, Guy, Yana Podolsky, Hayit Greenspan, Tal Remez, Or Litany, Alex M. Bronstein, and Raja Giryes. “White Matter Fiber Representation Using Continuous Dictionary Learning.” In <i>20th International Conference on Medical Image Computing and Computer-Assisted Intervention</i>, 10433:566–74. Springer Nature, 2017. <a href=\"https://doi.org/10.1007/978-3-319-66182-7_65\">https://doi.org/10.1007/978-3-319-66182-7_65</a>.","ista":"Alexandroni G, Podolsky Y, Greenspan H, Remez T, Litany O, Bronstein AM, Giryes R. 2017. White matter fiber representation using continuous dictionary learning. 20th International Conference on Medical Image Computing and Computer-Assisted Intervention. MICCAI: Medical Image Computing and Computer-Assisted Intervention, LNCS, vol. 10433, 566–574.","ama":"Alexandroni G, Podolsky Y, Greenspan H, et al. White matter fiber representation using continuous dictionary learning. In: <i>20th International Conference on Medical Image Computing and Computer-Assisted Intervention</i>. Vol 10433. Springer Nature; 2017:566-574. doi:<a href=\"https://doi.org/10.1007/978-3-319-66182-7_65\">10.1007/978-3-319-66182-7_65</a>","apa":"Alexandroni, G., Podolsky, Y., Greenspan, H., Remez, T., Litany, O., Bronstein, A. M., &#38; Giryes, R. (2017). White matter fiber representation using continuous dictionary learning. In <i>20th International Conference on Medical Image Computing and Computer-Assisted Intervention</i> (Vol. 10433, pp. 566–574). Quebec City, QC, Canada: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-66182-7_65\">https://doi.org/10.1007/978-3-319-66182-7_65</a>"},"conference":{"name":"MICCAI: Medical Image Computing and Computer-Assisted Intervention","start_date":"2017-09-11","location":"Quebec City, QC, Canada","end_date":"2017-09-13"},"article_processing_charge":"No","month":"09","title":"White matter fiber representation using continuous dictionary learning","_id":"18330","alternative_title":["LNCS"],"doi":"10.1007/978-3-319-66182-7_65","publication_identifier":{"isbn":["9783319661810"],"eissn":["1611-3349","9783319661827"],"issn":["0302-9743"]},"intvolume":"     10433","publication":"20th International Conference on Medical Image Computing and Computer-Assisted Intervention","author":[{"full_name":"Alexandroni, Guy","last_name":"Alexandroni","first_name":"Guy"},{"full_name":"Podolsky, Yana","last_name":"Podolsky","first_name":"Yana"},{"first_name":"Hayit","last_name":"Greenspan","full_name":"Greenspan, Hayit"},{"last_name":"Remez","full_name":"Remez, Tal","first_name":"Tal"},{"full_name":"Litany, Or","last_name":"Litany","first_name":"Or"},{"orcid":"0000-0001-9699-8730","full_name":"Bronstein, Alexander","last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander"},{"first_name":"Raja","last_name":"Giryes","full_name":"Giryes, Raja"}],"scopus_import":"1","abstract":[{"lang":"eng","text":"With increasingly sophisticated Diffusion Weighted MRI acquisition methods and modeling techniques, very large sets of streamlines (fibers) are presently generated per imaged brain. These reconstructions of white matter architecture, which are important for human brain research and pre-surgical planning, require a large amount of storage and are often unwieldy and difficult to manipulate and analyze. This work proposes a novel continuous parsimonious framework in which signals are sparsely represented in a dictionary with continuous atoms. The significant innovation in our new methodology is the ability to train such continuous dictionaries, unlike previous approaches that either used pre-fixed continuous transforms or training with finite atoms. This leads to an innovative fiber representation method, which uses Continuous Dictionary Learning to sparsely code each fiber with high accuracy. This method is tested on numerous tractograms produced from the Human Connectome Project data and achieves state-of-the-art performances in compression ratio and reconstruction error."}],"quality_controlled":"1","volume":10433,"language":[{"iso":"eng"}],"date_created":"2024-10-15T11:20:54Z","publication_status":"published"},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.00198"}],"oa":1,"publication_identifier":{"isbn":["9783319592497"],"eisbn":["9783319592503"],"issn":["0302-9743","1611-3349"]},"publication":"19th International Conference on Integer Programming and Combinatorial Optimization","scopus_import":"1","author":[{"full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya","first_name":"Sayan"},{"full_name":"Chakrabarty, Deeparnab","last_name":"Chakrabarty","first_name":"Deeparnab"},{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"}],"intvolume":"     10328","abstract":[{"lang":"eng","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."}],"volume":10328,"quality_controlled":"1","external_id":{"arxiv":["1611.00198"]},"date_created":"2023-02-20T07:52:31Z","language":[{"iso":"eng"}],"publication_status":"published","day":"24","publisher":"Springer Nature","type":"conference","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","page":"86-98","date_published":"2017-05-24T00:00:00Z","year":"2017","oa_version":"Preprint","date_updated":"2024-11-06T12:03:44Z","article_processing_charge":"No","conference":{"location":"Waterloo, ON, Canada","end_date":"2017-06-28","name":"IPCO: Integer Programming and Combinatorial Optimization","start_date":"2017-06-26"},"citation":{"ama":"Bhattacharya S, Chakrabarty D, Henzinger M. 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>","apa":"Bhattacharya, S., Chakrabarty, D., &#38; Henzinger, M. (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>","chicago":"Bhattacharya, Sayan, Deeparnab Chakrabarty, and Monika 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>.","ista":"Bhattacharya S, Chakrabarty D, Henzinger M. 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.","short":"S. Bhattacharya, D. Chakrabarty, M. Henzinger, in:, 19th International Conference on Integer Programming and Combinatorial Optimization, Springer Nature, 2017, pp. 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>.","ieee":"S. Bhattacharya, D. Chakrabarty, and M. 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."},"_id":"12571","title":"Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time","month":"05","doi":"10.1007/978-3-319-59250-3_8","alternative_title":["LNCS"],"arxiv":1},{"publication_status":"published","external_id":{"arxiv":["1701.05738"],"isi":["000440734900026"]},"department":[{"_id":"KrCh"}],"date_created":"2023-06-21T13:21:14Z","corr_author":"1","language":[{"iso":"eng"}],"volume":10205,"quality_controlled":"1","abstract":[{"lang":"eng","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."}],"publication":"Tools and Algorithms for the Construction and Analysis of Systems","author":[{"last_name":"Kretinsky","full_name":"Kretinsky, Jan","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881"},{"last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias","first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165"},{"full_name":"Waldmann, Clara","last_name":"Waldmann","first_name":"Clara"},{"first_name":"Maximilian","full_name":"Weininger, Maximilian","last_name":"Weininger"}],"isi":1,"intvolume":"     10205","acknowledgement":"This work is partially funded by the DFG project “Verified Model Checkers” and by the Czech Science Foundation, grant No. P202/12/G061.","oa":1,"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["9783662545775"],"isbn":["9783662545768"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1701.05738"}],"arxiv":1,"doi":"10.1007/978-3-662-54577-5_26","alternative_title":["LNCS"],"_id":"13160","title":"Index appearance record for transforming Rabin automata into parity automata","month":"03","article_processing_charge":"No","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2017-04-22","location":"Uppsala, Sweden","end_date":"2017-04-29"},"citation":{"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>.","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.","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>","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.","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>."},"date_published":"2017-03-31T00:00:00Z","oa_version":"Preprint","year":"2017","date_updated":"2025-09-18T10:42:48Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"443-460","status":"public","type":"conference","publisher":"Springer","day":"31"},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1701.04914"}],"publication_identifier":{"issn":["0302-9743"]},"oa":1,"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"orcid":"0000-0001-7745-9117","first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","full_name":"Kragl, Bernhard","last_name":"Kragl"},{"first_name":"Samarth","last_name":"Mishra","full_name":"Mishra, Samarth"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722"}],"scopus_import":"1","intvolume":"     10201","isi":1,"ec_funded":1,"abstract":[{"lang":"eng","text":"Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis. Yet RSMs are more convenient as they (a) explicitly model function calls and returns, and (b) specify many natural parameters for algorithmic analysis, e.g., the number of entries and exits. We consider a general framework where RSM transitions are labeled from a semiring and path properties are algebraic with semiring operations, which can model, e.g., interprocedural reachability and dataflow analysis problems. Our main contributions are new algorithms for several fundamental problems. As compared to a direct translation of RSMs to PDSs and the best-known existing bounds of PDSs, our analysis algorithm improves the complexity for finite-height semirings (that subsumes reachability and standard dataflow properties). We further consider the problem of extracting distance values from the representation structures computed by our algorithm, and give efficient algorithms that distinguish the complexity of a one-time preprocessing from the complexity of each individual query. Another advantage of our algorithm is that our improvements carry over to the concurrent setting, where we improve the bestknown complexity for the context-bounded analysis of concurrent RSMs. Finally, we provide a prototype implementation that gives a significant speed-up on several benchmarks from the SLAM/SDV project."}],"editor":[{"first_name":"Hongseok","last_name":"Yang","full_name":"Yang, Hongseok"}],"volume":10201,"quality_controlled":"1","date_created":"2018-12-11T11:49:41Z","external_id":{"isi":["000681702400011"],"arxiv":["1701.04914"]},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"language":[{"iso":"eng"}],"publication_status":"published","type":"conference","publisher":"Springer","day":"19","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"287 - 313","project":[{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"}],"date_published":"2017-03-19T00:00:00Z","date_updated":"2025-06-04T08:09:18Z","year":"2017","oa_version":"Submitted Version","conference":{"end_date":"2017-04-29","location":"Uppsala, Sweden","start_date":"2017-04-22","name":"ESOP: European Symposium on Programming"},"article_processing_charge":"No","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Weighted Recursive State Machines</i>. Edited by Hongseok Yang, vol. 10201, Springer, 2017, pp. 287–313, doi:<a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">10.1007/978-3-662-54434-1_11</a>.","short":"K. Chatterjee, B. Kragl, S. Mishra, A. Pavlogiannis, in:, H. Yang (Ed.), Springer, 2017, pp. 287–313.","ieee":"K. Chatterjee, B. Kragl, S. Mishra, and A. Pavlogiannis, “Faster algorithms for weighted recursive state machines,” presented at the ESOP: European Symposium on Programming, Uppsala, Sweden, 2017, vol. 10201, pp. 287–313.","apa":"Chatterjee, K., Kragl, B., Mishra, S., &#38; Pavlogiannis, A. (2017). Faster algorithms for weighted recursive state machines. In H. Yang (Ed.) (Vol. 10201, pp. 287–313). Presented at the ESOP: European Symposium on Programming, Uppsala, Sweden: Springer. <a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">https://doi.org/10.1007/978-3-662-54434-1_11</a>","ama":"Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. Faster algorithms for weighted recursive state machines. In: Yang H, ed. Vol 10201. Springer; 2017:287-313. doi:<a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">10.1007/978-3-662-54434-1_11</a>","ista":"Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. 2017. Faster algorithms for weighted recursive state machines. ESOP: European Symposium on Programming, LNCS, vol. 10201, 287–313.","chicago":"Chatterjee, Krishnendu, Bernhard Kragl, Samarth Mishra, and Andreas Pavlogiannis. “Faster Algorithms for Weighted Recursive State Machines.” edited by Hongseok Yang, 10201:287–313. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">https://doi.org/10.1007/978-3-662-54434-1_11</a>."},"_id":"1011","month":"03","title":"Faster algorithms for weighted recursive state machines","alternative_title":["LNCS"],"publist_id":"6384","doi":"10.1007/978-3-662-54434-1_11","arxiv":1},{"alternative_title":["LNCS"],"publist_id":"6815","doi":"10.1007/978-3-319-64689-3_32","arxiv":1,"conference":{"end_date":"2017-08-24","location":"Ystad, Sweden","start_date":"2017-08-22","name":"CAIP: Computer Analysis of Images and Patterns"},"article_processing_charge":"No","citation":{"ieee":"T. Heiss and H. Wagner, “Streaming algorithm for Euler characteristic curves of multidimensional images,” presented at the CAIP: Computer Analysis of Images and Patterns, Ystad, Sweden, 2017, vol. 10424, pp. 397–409.","mla":"Heiss, Teresa, and Hubert Wagner. <i>Streaming Algorithm for Euler Characteristic Curves of Multidimensional Images</i>. Edited by Michael Felsberg et al., vol. 10424, Springer, 2017, pp. 397–409, doi:<a href=\"https://doi.org/10.1007/978-3-319-64689-3_32\">10.1007/978-3-319-64689-3_32</a>.","short":"T. Heiss, H. Wagner, in:, M. Felsberg, A. Heyden, N. Krüger (Eds.), Springer, 2017, pp. 397–409.","ista":"Heiss T, Wagner H. 2017. Streaming algorithm for Euler characteristic curves of multidimensional images. CAIP: Computer Analysis of Images and Patterns, LNCS, vol. 10424, 397–409.","chicago":"Heiss, Teresa, and Hubert Wagner. “Streaming Algorithm for Euler Characteristic Curves of Multidimensional Images.” edited by Michael Felsberg, Anders Heyden, and Norbert Krüger, 10424:397–409. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-64689-3_32\">https://doi.org/10.1007/978-3-319-64689-3_32</a>.","apa":"Heiss, T., &#38; Wagner, H. (2017). Streaming algorithm for Euler characteristic curves of multidimensional images. In M. Felsberg, A. Heyden, &#38; N. Krüger (Eds.) (Vol. 10424, pp. 397–409). Presented at the CAIP: Computer Analysis of Images and Patterns, Ystad, Sweden: Springer. <a href=\"https://doi.org/10.1007/978-3-319-64689-3_32\">https://doi.org/10.1007/978-3-319-64689-3_32</a>","ama":"Heiss T, Wagner H. Streaming algorithm for Euler characteristic curves of multidimensional images. In: Felsberg M, Heyden A, Krüger N, eds. Vol 10424. Springer; 2017:397-409. doi:<a href=\"https://doi.org/10.1007/978-3-319-64689-3_32\">10.1007/978-3-319-64689-3_32</a>"},"_id":"833","month":"07","title":"Streaming algorithm for Euler characteristic curves of multidimensional images","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"397 - 409","date_published":"2017-07-28T00:00:00Z","date_updated":"2025-06-04T09:54:22Z","oa_version":"Submitted Version","year":"2017","day":"28","publisher":"Springer","type":"conference","status":"public","date_created":"2018-12-11T11:48:45Z","department":[{"_id":"HeEd"}],"external_id":{"isi":["000432085900032"],"arxiv":["1705.02045"]},"corr_author":"1","language":[{"iso":"eng"}],"publication_status":"published","abstract":[{"lang":"eng","text":"We present an efficient algorithm to compute Euler characteristic curves of gray scale images of arbitrary dimension. In various applications the Euler characteristic curve is used as a descriptor of an image. Our algorithm is the first streaming algorithm for Euler characteristic curves. The usage of streaming removes the necessity to store the entire image in RAM. Experiments show that our implementation handles terabyte scale images on commodity hardware. Due to lock-free parallelism, it scales well with the number of processor cores. Additionally, we put the concept of the Euler characteristic curve in the wider context of computational topology. In particular, we explain the connection with persistence diagrams."}],"editor":[{"first_name":"Michael","full_name":"Felsberg, Michael","last_name":"Felsberg"},{"full_name":"Heyden, Anders","last_name":"Heyden","first_name":"Anders"},{"first_name":"Norbert","full_name":"Krüger, Norbert","last_name":"Krüger"}],"volume":10424,"quality_controlled":"1","scopus_import":"1","author":[{"orcid":"0000-0002-1780-2689","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","first_name":"Teresa","last_name":"Heiss","full_name":"Heiss, Teresa"},{"last_name":"Wagner","full_name":"Wagner, Hubert","first_name":"Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87"}],"isi":1,"intvolume":"     10424","main_file_link":[{"url":"https://arxiv.org/abs/1705.02045","open_access":"1"}],"publication_identifier":{"issn":["0302-9743"]},"oa":1},{"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"}],"article_processing_charge":"No","conference":{"end_date":"2017-09-21","location":"Vienna, Austria","start_date":"2017-09-19","name":"DGCI: International Conference on Discrete Geometry for Computer Imagery"},"citation":{"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.","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>.","short":"S. Dwivedi, A. Gupta, S. Roy, R. Biswas, P. Bhowmick, in:, 20th IAPR International Conference, Springer Nature, Cham, 2017, pp. 347–359.","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>.","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>","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>"},"_id":"5801","volume":10502,"title":"Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space","quality_controlled":"1","month":"08","date_created":"2019-01-08T20:42:22Z","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-66272-5_28","alternative_title":["LNCS"],"publication_status":"published","day":"22","type":"conference","publisher":"Springer Nature","status":"public","publication_identifier":{"isbn":["978-3-319-66271-8"],"eisbn":["978-3-319-66272-5"],"issn":["0302-9743"],"eissn":["1611-3349"]},"author":[{"first_name":"Shivam","last_name":"Dwivedi","full_name":"Dwivedi, Shivam"},{"first_name":"Aniket","last_name":"Gupta","full_name":"Gupta, Aniket"},{"first_name":"Siddhant","last_name":"Roy","full_name":"Roy, Siddhant"},{"full_name":"Biswas, Ranita","last_name":"Biswas","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","first_name":"Ranita","orcid":"0000-0002-5372-7890"},{"first_name":"Partha","full_name":"Bhowmick, Partha","last_name":"Bhowmick"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication":"20th IAPR International Conference","place":"Cham","extern":"1","intvolume":"     10502","page":"347-359","date_published":"2017-08-22T00:00:00Z","year":"2017","oa_version":"None","date_updated":"2022-01-27T15:34:25Z"},{"author":[{"last_name":"Andres","full_name":"Andres, Eric","first_name":"Eric"},{"first_name":"Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas","full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890"},{"last_name":"Bhowmick","full_name":"Bhowmick, Partha","first_name":"Partha"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication":"20th IAPR International Conference","place":"Cham","extern":"1","intvolume":"     10502","page":"388-398","date_published":"2017-08-22T00:00:00Z","oa_version":"None","year":"2017","date_updated":"2022-01-27T15:38:35Z","day":"22","type":"conference","publisher":"Springer Nature","status":"public","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["978-3-319-66271-8"],"eisbn":["978-3-319-66272-5"]},"date_created":"2019-01-08T20:42:39Z","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-66272-5_31","alternative_title":["LNCS"],"publication_status":"published","article_processing_charge":"No","abstract":[{"lang":"eng","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."}],"conference":{"location":"Vienna, Austria","end_date":"2017-09-21","name":"DGCI: International Conference on Discrete Geometry for Computer Imagery","start_date":"2017-09-19"},"citation":{"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.","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>.","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>","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>","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.","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."},"volume":10502,"_id":"5802","quality_controlled":"1","title":"Digital primitives defined by weighted focal set","month":"08"},{"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."}],"quality_controlled":"1","volume":10256,"language":[{"iso":"eng"}],"date_created":"2019-01-08T20:42:56Z","department":[{"_id":"HeEd"}],"publication_status":"published","publication_identifier":{"isbn":["978-3-319-59107-0","978-3-319-59108-7"],"issn":["0302-9743","1611-3349"]},"intvolume":"     10256","publication":"Combinatorial image analysis","author":[{"id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","first_name":"Ranita","last_name":"Biswas","full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890"},{"first_name":"Partha","full_name":"Bhowmick, Partha","last_name":"Bhowmick"}],"citation":{"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>","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>","ista":"Biswas R, Bhowmick P. 2017.Construction of persistent Voronoi diagram on 3D digital plane. In: Combinatorial image analysis. LNCS, vol. 10256, 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>.","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.","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."},"conference":{"end_date":"2017-06-21","location":"Plovdiv, Bulgaria","start_date":"2017-06-19","name":"IWCIA: International Workshop on Combinatorial Image Analysis"},"article_processing_charge":"No","month":"05","title":"Construction of persistent Voronoi diagram on 3D digital plane","_id":"5803","alternative_title":["LNCS"],"doi":"10.1007/978-3-319-59108-7_8","type":"book_chapter","day":"17","publisher":"Springer Nature","status":"public","page":"93-104","extern":"1","place":"Cham","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2022-01-28T07:48:24Z","oa_version":"None","year":"2017","date_published":"2017-05-17T00:00:00Z"}]