[{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Zimin, Alexander. Learning from Dependent Data. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH1048.","ama":"Zimin A. Learning from dependent data. 2018. doi:10.15479/AT:ISTA:TH1048","apa":"Zimin, A. (2018). Learning from dependent data. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH1048","ieee":"A. Zimin, “Learning from dependent data,” Institute of Science and Technology Austria, 2018.","short":"A. Zimin, Learning from Dependent Data, Institute of Science and Technology Austria, 2018.","chicago":"Zimin, Alexander. “Learning from Dependent Data.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH1048.","ista":"Zimin A. 2018. Learning from dependent data. Institute of Science and Technology Austria."},"title":"Learning from dependent data","article_processing_charge":"No","author":[{"id":"37099E9C-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander","last_name":"Zimin","full_name":"Zimin, Alexander"}],"publist_id":"7986","project":[{"call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036"}],"day":"01","year":"2018","has_accepted_license":"1","date_created":"2018-12-11T11:44:27Z","date_published":"2018-09-01T00:00:00Z","doi":"10.15479/AT:ISTA:TH1048","page":"92","oa":1,"publisher":"Institute of Science and Technology Austria","ddc":["004","519"],"date_updated":"2023-09-07T12:29:07Z","supervisor":[{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert"}],"file_date_updated":"2020-07-14T12:47:40Z","department":[{"_id":"ChLa"}],"_id":"68","pubrep_id":"1048","status":"public","type":"dissertation","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"6253","checksum":"e849dd40a915e4d6c5572b51b517f098","file_size":1036137,"date_updated":"2020-07-14T12:47:40Z","creator":"dernst","file_name":"2018_Thesis_Zimin.pdf","date_created":"2019-04-09T07:32:47Z"},{"date_created":"2019-04-09T07:32:47Z","file_name":"2018_Thesis_Zimin_Source.zip","date_updated":"2020-07-14T12:47:40Z","file_size":637490,"creator":"dernst","file_id":"6254","checksum":"da092153cec55c97461bd53c45c5d139","content_type":"application/zip","access_level":"closed","relation":"source_file"}],"degree_awarded":"PhD","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"ec_funded":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"The most common assumption made in statistical learning theory is the assumption of the independent and identically distributed (i.i.d.) data. While being very convenient mathematically, it is often very clearly violated in practice. This disparity between the machine learning theory and applications underlies a growing demand in the development of algorithms that learn from dependent data and theory that can provide generalization guarantees similar to the independent situations. This thesis is dedicated to two variants of dependencies that can arise in practice. One is a dependence on the level of samples in a single learning task. Another dependency type arises in the multi-task setting when the tasks are dependent on each other even though the data for them can be i.i.d. In both cases we model the data (samples or tasks) as stochastic processes and introduce new algorithms for both settings that take into account and exploit the resulting dependencies. We prove the theoretical guarantees on the performance of the introduced algorithms under different evaluation criteria and, in addition, we compliment the theoretical study by the empirical one, where we evaluate some of the algorithms on two real world datasets to highlight their practical applicability."}],"month":"09","alternative_title":["ISTA Thesis"]},{"project":[{"call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","grant_number":"259668"},{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"title":"Proof systems for sustainable decentralized cryptocurrencies","article_processing_charge":"No","publist_id":"7971","author":[{"last_name":"Abusalah","full_name":"Abusalah, Hamza M","first_name":"Hamza M","id":"40297222-F248-11E8-B48F-1D18A9856A87"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Abusalah, Hamza M. “Proof Systems for Sustainable Decentralized Cryptocurrencies.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1046.","ista":"Abusalah HM. 2018. Proof systems for sustainable decentralized cryptocurrencies. Institute of Science and Technology Austria.","mla":"Abusalah, Hamza M. Proof Systems for Sustainable Decentralized Cryptocurrencies. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1046.","apa":"Abusalah, H. M. (2018). Proof systems for sustainable decentralized cryptocurrencies. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1046","ama":"Abusalah HM. Proof systems for sustainable decentralized cryptocurrencies. 2018. doi:10.15479/AT:ISTA:TH_1046","ieee":"H. M. Abusalah, “Proof systems for sustainable decentralized cryptocurrencies,” Institute of Science and Technology Austria, 2018.","short":"H.M. Abusalah, Proof Systems for Sustainable Decentralized Cryptocurrencies, Institute of Science and Technology Austria, 2018."},"oa":1,"publisher":"Institute of Science and Technology Austria","date_created":"2018-12-11T11:44:32Z","date_published":"2018-09-05T00:00:00Z","doi":"10.15479/AT:ISTA:TH_1046","page":"59","day":"05","year":"2018","has_accepted_license":"1","pubrep_id":"1046","status":"public","type":"dissertation","_id":"83","file_date_updated":"2020-07-14T12:48:11Z","department":[{"_id":"KrPi"}],"ddc":["004"],"date_updated":"2023-09-07T12:30:23Z","supervisor":[{"last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"month":"09","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","abstract":[{"text":"A proof system is a protocol between a prover and a verifier over a common input in which an honest prover convinces the verifier of the validity of true statements. Motivated by the success of decentralized cryptocurrencies, exemplified by Bitcoin, the focus of this thesis will be on proof systems which found applications in some sustainable alternatives to Bitcoin, such as the Spacemint and Chia cryptocurrencies. In particular, we focus on proofs of space and proofs of sequential work.\r\nProofs of space (PoSpace) were suggested as more ecological, economical, and egalitarian alternative to the energy-wasteful proof-of-work mining of Bitcoin. However, the state-of-the-art constructions of PoSpace are based on sophisticated graph pebbling lower bounds, and are therefore complex. Moreover, when these PoSpace are used in cryptocurrencies like Spacemint, miners can only start mining after ensuring that a commitment to their space is already added in a special transaction to the blockchain. Proofs of sequential work (PoSW) are proof systems in which a prover, upon receiving a statement x and a time parameter T, computes a proof which convinces the verifier that T time units had passed since x was received. Whereas Spacemint assumes synchrony to retain some interesting Bitcoin dynamics, Chia requires PoSW with unique proofs, i.e., PoSW in which it is hard to come up with more than one accepting proof for any true statement. In this thesis we construct simple and practically-efficient PoSpace and PoSW. When using our PoSpace in cryptocurrencies, miners can start mining on the fly, like in Bitcoin, and unlike current constructions of PoSW, which either achieve efficient verification of sequential work, or faster-than-recomputing verification of correctness of proofs, but not both at the same time, ours achieve the best of these two worlds.","lang":"eng"}],"ec_funded":1,"related_material":{"record":[{"relation":"part_of_dissertation","id":"1229","status":"public"},{"relation":"part_of_dissertation","id":"1235","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"1236"},{"status":"public","id":"559","relation":"part_of_dissertation"}]},"language":[{"iso":"eng"}],"file":[{"file_name":"2018_Thesis_Abusalah.pdf","date_created":"2019-04-09T06:43:41Z","file_size":876241,"date_updated":"2020-07-14T12:48:11Z","creator":"dernst","checksum":"c4b5f7d111755d1396787f41886fc674","file_id":"6245","content_type":"application/pdf","relation":"main_file","access_level":"open_access"},{"file_id":"6246","checksum":"0f382ac56b471c48fd907d63eb87dafe","relation":"source_file","access_level":"closed","content_type":"application/x-gzip","file_name":"2018_Thesis_Abusalah_source.tar.gz","date_created":"2019-04-09T06:43:41Z","creator":"dernst","file_size":2029190,"date_updated":"2020-07-14T12:48:11Z"}],"publication_status":"published","degree_awarded":"PhD","publication_identifier":{"issn":["2663-337X"]}},{"ec_funded":1,"language":[{"iso":"eng"}],"file":[{"date_updated":"2020-07-14T12:45:22Z","file_size":12918758,"creator":"system","date_created":"2018-12-12T10:14:57Z","file_name":"IST-2018-1021-v1+1_thesis-unsigned-pdfa.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"bc678e02468d8ebc39dc7267dfb0a1c4","file_id":"5113"},{"creator":"dernst","file_size":55973760,"date_updated":"2020-07-14T12:45:22Z","file_name":"2018_Thesis_Kolesnikov_source.zip","date_created":"2019-04-05T09:34:49Z","relation":"source_file","access_level":"closed","content_type":"application/zip","file_id":"6225","checksum":"bc66973b086da5a043f1162dcfb1fde4"}],"degree_awarded":"PhD","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"month":"05","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Modern computer vision systems heavily rely on statistical machine learning models, which typically require large amounts of labeled data to be learned reliably. Moreover, very recently computer vision research widely adopted techniques for representation learning, which further increase the demand for labeled data. However, for many important practical problems there is relatively small amount of labeled data available, so it is problematic to leverage full potential of the representation learning methods. One way to overcome this obstacle is to invest substantial resources into producing large labelled datasets. Unfortunately, this can be prohibitively expensive in practice. In this thesis we focus on the alternative way of tackling the aforementioned issue. We concentrate on methods, which make use of weakly-labeled or even unlabeled data. Specifically, the first half of the thesis is dedicated to the semantic image segmentation task. We develop a technique, which achieves competitive segmentation performance and only requires annotations in a form of global image-level labels instead of dense segmentation masks. Subsequently, we present a new methodology, which further improves segmentation performance by leveraging tiny additional feedback from a human annotator. By using our methods practitioners can greatly reduce the amount of data annotation effort, which is required to learn modern image segmentation models. In the second half of the thesis we focus on methods for learning from unlabeled visual data. We study a family of autoregressive models for modeling structure of natural images and discuss potential applications of these models. Moreover, we conduct in-depth study of one of these applications, where we develop the state-of-the-art model for the probabilistic image colorization task."}],"department":[{"_id":"ChLa"}],"file_date_updated":"2020-07-14T12:45:22Z","ddc":["004"],"date_updated":"2023-09-07T12:51:46Z","supervisor":[{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"pubrep_id":"1021","status":"public","type":"dissertation","_id":"197","date_created":"2018-12-11T11:45:09Z","date_published":"2018-05-25T00:00:00Z","doi":"10.15479/AT:ISTA:th_1021","page":"113","day":"25","year":"2018","has_accepted_license":"1","oa":1,"publisher":"Institute of Science and Technology Austria","acknowledgement":"I also gratefully acknowledge the support of NVIDIA Corporation with the donation of the GPUs used for this research.","title":"Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images","article_processing_charge":"No","author":[{"last_name":"Kolesnikov","full_name":"Kolesnikov, Alexander","first_name":"Alexander","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7718","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Kolesnikov, Alexander. Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1021.","short":"A. Kolesnikov, Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images, Institute of Science and Technology Austria, 2018.","ieee":"A. Kolesnikov, “Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images,” Institute of Science and Technology Austria, 2018.","apa":"Kolesnikov, A. (2018). Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1021","ama":"Kolesnikov A. Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images. 2018. doi:10.15479/AT:ISTA:th_1021","chicago":"Kolesnikov, Alexander. “Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1021.","ista":"Kolesnikov A. 2018. Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images. Institute of Science and Technology Austria."},"project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036"}]},{"project":[{"call_identifier":"FWF","_id":"25F8B9BC-B435-11E9-9278-68D0E5697425","grant_number":"M01980","name":"Robust invariants of Nonlinear Systems"},{"name":"FWF Open Access Fund","call_identifier":"FWF","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1"}],"citation":{"apa":"Filakovský, M., Franek, P., Wagner, U., & Zhechev, S. Y. (2018). Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. Springer. https://doi.org/10.1007/s41468-018-0021-5","ama":"Filakovský M, Franek P, Wagner U, Zhechev SY. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2018;2(3-4):177-231. doi:10.1007/s41468-018-0021-5","short":"M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and Computational Topology 2 (2018) 177–231.","ieee":"M. Filakovský, P. Franek, U. Wagner, and S. Y. Zhechev, “Computing simplicial representatives of homotopy group elements,” Journal of Applied and Computational Topology, vol. 2, no. 3–4. Springer, pp. 177–231, 2018.","mla":"Filakovský, Marek, et al. “Computing Simplicial Representatives of Homotopy Group Elements.” Journal of Applied and Computational Topology, vol. 2, no. 3–4, Springer, 2018, pp. 177–231, doi:10.1007/s41468-018-0021-5.","ista":"Filakovský M, Franek P, Wagner U, Zhechev SY. 2018. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2(3–4), 177–231.","chicago":"Filakovský, Marek, Peter Franek, Uli Wagner, and Stephan Y Zhechev. “Computing Simplicial Representatives of Homotopy Group Elements.” Journal of Applied and Computational Topology. Springer, 2018. https://doi.org/10.1007/s41468-018-0021-5."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Filakovský, Marek","last_name":"Filakovský","first_name":"Marek","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-8878-8397","full_name":"Franek, Peter","last_name":"Franek","first_name":"Peter","id":"473294AE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wagner","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli"},{"id":"3AA52972-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan Y","last_name":"Zhechev","full_name":"Zhechev, Stephan Y"}],"title":"Computing simplicial representatives of homotopy group elements","quality_controlled":"1","publisher":"Springer","oa":1,"has_accepted_license":"1","year":"2018","day":"01","publication":"Journal of Applied and Computational Topology","page":"177-231","date_published":"2018-12-01T00:00:00Z","doi":"10.1007/s41468-018-0021-5","date_created":"2019-08-08T06:47:40Z","_id":"6774","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","date_updated":"2023-09-07T13:10:36Z","ddc":["514"],"department":[{"_id":"UlWa"}],"file_date_updated":"2020-07-14T12:47:40Z","abstract":[{"lang":"eng","text":"A central problem of algebraic topology is to understand the homotopy groups 𝜋𝑑(𝑋) of a topological space X. For the computational version of the problem, it is well known that there is no algorithm to decide whether the fundamental group 𝜋1(𝑋) of a given finite simplicial complex X is trivial. On the other hand, there are several algorithms that, given a finite simplicial complex X that is simply connected (i.e., with 𝜋1(𝑋) trivial), compute the higher homotopy group 𝜋𝑑(𝑋) for any given 𝑑≥2 . However, these algorithms come with a caveat: They compute the isomorphism type of 𝜋𝑑(𝑋) , 𝑑≥2 as an abstract finitely generated abelian group given by generators and relations, but they work with very implicit representations of the elements of 𝜋𝑑(𝑋) . Converting elements of this abstract group into explicit geometric maps from the d-dimensional sphere 𝑆𝑑 to X has been one of the main unsolved problems in the emerging field of computational homotopy theory. Here we present an algorithm that, given a simply connected space X, computes 𝜋𝑑(𝑋) and represents its elements as simplicial maps from a suitable triangulation of the d-sphere 𝑆𝑑 to X. For fixed d, the algorithm runs in time exponential in size(𝑋) , the number of simplices of X. Moreover, we prove that this is optimal: For every fixed 𝑑≥2 , we construct a family of simply connected spaces X such that for any simplicial map representing a generator of 𝜋𝑑(𝑋) , the size of the triangulation of 𝑆𝑑 on which the map is defined, is exponential in size(𝑋) ."}],"oa_version":"Published Version","month":"12","intvolume":" 2","publication_identifier":{"issn":["2367-1726"],"eissn":["2367-1734"]},"publication_status":"published","file":[{"date_created":"2019-08-08T06:55:21Z","file_name":"2018_JourAppliedComputTopology_Filakovsky.pdf","creator":"dernst","date_updated":"2020-07-14T12:47:40Z","file_size":1056278,"checksum":"cf9e7fcd2a113dd4828774fc75cdb7e8","file_id":"6775","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"issue":"3-4","volume":2,"related_material":{"record":[{"relation":"dissertation_contains","id":"6681","status":"public"}]},"license":"https://creativecommons.org/licenses/by/4.0/"},{"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"day":"13","has_accepted_license":"1","year":"2018","doi":"10.4230/LIPIcs.CONCUR.2018.21","date_published":"2018-08-13T00:00:00Z","date_created":"2018-12-11T11:44:48Z","article_number":"21","project":[{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S11402-N23"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Synchronizing the Asynchronous,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.CONCUR.2018.21.","ista":"Kragl B, Qadeer S, Henzinger TA. 2018. Synchronizing the asynchronous. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 118, 21.","mla":"Kragl, Bernhard, et al. Synchronizing the Asynchronous. Vol. 118, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.21.","ama":"Kragl B, Qadeer S, Henzinger TA. Synchronizing the asynchronous. In: Vol 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.CONCUR.2018.21","apa":"Kragl, B., Qadeer, S., & Henzinger, T. A. (2018). Synchronizing the asynchronous (Vol. 118). Presented at the CONCUR: International Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.21","short":"B. Kragl, S. Qadeer, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ieee":"B. Kragl, S. Qadeer, and T. A. Henzinger, “Synchronizing the asynchronous,” presented at the CONCUR: International Conference on Concurrency Theory, Beijing, China, 2018, vol. 118."},"title":"Synchronizing the asynchronous","author":[{"id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117","last_name":"Kragl"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"publist_id":"7790","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Synchronous programs are easy to specify because the side effects of an operation are finished by the time the invocation of the operation returns to the caller. Asynchronous programs, on the other hand, are difficult to specify because there are side effects due to pending computation scheduled as a result of the invocation of an operation. They are also difficult to verify because of the large number of possible interleavings of concurrent computation threads. We present synchronization, a new proof rule that simplifies the verification of asynchronous programs by introducing the fiction, for proof purposes, that asynchronous operations complete synchronously. Synchronization summarizes an asynchronous computation as immediate atomic effect. Modular verification is enabled via pending asynchronous calls in atomic summaries, and a complementary proof rule that eliminates pending asynchronous calls when components and their specifications are composed. We evaluate synchronization in the context of a multi-layer refinement verification methodology on a collection of benchmark programs."}],"month":"08","intvolume":" 118","scopus_import":1,"alternative_title":["LIPIcs"],"file":[{"creator":"system","date_updated":"2020-07-14T12:44:44Z","file_size":745438,"date_created":"2018-12-12T10:18:46Z","file_name":"IST-2018-853-v2+2_concur2018.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"c90895f4c5fafc18ddc54d1c8848077e","file_id":"5368"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["18688969"]},"publication_status":"published","volume":118,"related_material":{"record":[{"status":"public","id":"6426","relation":"earlier_version"},{"relation":"dissertation_contains","status":"public","id":"8332"}]},"_id":"133","status":"public","pubrep_id":"1039","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"CONCUR: International Conference on Concurrency Theory","location":"Beijing, China","end_date":"2018-09-07","start_date":"2018-09-04"},"ddc":["000"],"date_updated":"2023-09-07T13:18:00Z","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:44:44Z"}]