[{"type":"conference","department":[{"_id":"7"},{"_id":"77"}],"date_created":"2020-09-24T12:53:02Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"publication":"Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)","citation":{"bibtex":"@inproceedings{Sharma_Wehrheim, series={LNCS}, title={Automatic Fairness Testing of Machine Learning Models}, booktitle={Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)}, publisher={Springer}, author={Sharma, Arnab and Wehrheim, Heike}, collection={LNCS} }","ama":"Sharma A, Wehrheim H. Automatic Fairness Testing of Machine Learning Models. In: <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>. LNCS. Springer.","mla":"Sharma, Arnab, and Heike Wehrheim. “Automatic Fairness Testing of Machine Learning Models.” <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>, Springer.","chicago":"Sharma, Arnab, and Heike Wehrheim. “Automatic Fairness Testing of Machine Learning Models.” In <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>. LNCS. Springer, n.d.","short":"A. Sharma, H. Wehrheim, in: Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS), Springer, n.d.","ieee":"A. Sharma and H. Wehrheim, “Automatic Fairness Testing of Machine Learning Models,” in <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>.","apa":"Sharma, A., &#38; Wehrheim, H. (n.d.). Automatic Fairness Testing of Machine Learning Models. In <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>. Springer."},"user_id":"477","_id":"19656","publisher":"Springer","series_title":"LNCS","language":[{"iso":"eng"}],"publication_status":"accepted","date_updated":"2022-01-06T06:54:09Z","year":"2020","status":"public","title":"Automatic Fairness Testing of Machine Learning Models","author":[{"first_name":"Arnab","last_name":"Sharma","full_name":"Sharma, Arnab","id":"67200"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}]},{"date_updated":"2022-01-06T06:54:14Z","article_type":"original","year":"2020","title":"Research and Consulting in Data-Driven Strategic Product Planning","status":"public","author":[{"full_name":"Meyer, Maurice","last_name":"Meyer","first_name":"Maurice","orcid":"0000-0003-0606-7321","id":"77201"},{"first_name":"Maximilian","last_name":"Frank","full_name":"Frank, Maximilian"},{"full_name":"Massmann, Melina","first_name":"Melina","last_name":"Massmann"},{"id":"16190","first_name":"Roman","last_name":"Dumitrescu","full_name":"Dumitrescu, Roman"}],"user_id":"77201","_id":"19864","language":[{"iso":"eng"}],"publication":"Proceedings of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020)","citation":{"ama":"Meyer M, Frank M, Massmann M, Dumitrescu R. Research and Consulting in Data-Driven Strategic Product Planning. <i>Proceedings of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020)</i>. 2020.","bibtex":"@article{Meyer_Frank_Massmann_Dumitrescu_2020, title={Research and Consulting in Data-Driven Strategic Product Planning}, journal={Proceedings of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020)}, author={Meyer, Maurice and Frank, Maximilian and Massmann, Melina and Dumitrescu, Roman}, year={2020} }","mla":"Meyer, Maurice, et al. “Research and Consulting in Data-Driven Strategic Product Planning.” <i>Proceedings of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020)</i>, 2020.","short":"M. Meyer, M. Frank, M. Massmann, R. Dumitrescu, Proceedings of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020) (2020).","chicago":"Meyer, Maurice, Maximilian Frank, Melina Massmann, and Roman Dumitrescu. “Research and Consulting in Data-Driven Strategic Product Planning.” <i>Proceedings of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020)</i>, 2020.","apa":"Meyer, M., Frank, M., Massmann, M., &#38; Dumitrescu, R. (2020). Research and Consulting in Data-Driven Strategic Product Planning. <i>Proceedings of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020)</i>.","ieee":"M. Meyer, M. Frank, M. Massmann, and R. Dumitrescu, “Research and Consulting in Data-Driven Strategic Product Planning,” <i>Proceedings of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020)</i>, 2020."},"type":"journal_article","department":[{"_id":"563"}],"date_created":"2020-10-02T16:19:50Z"},{"department":[{"_id":"563"}],"type":"journal_article","date_created":"2020-10-02T16:21:47Z","citation":{"short":"M. Meyer, M. Frank, M. Massmann, R. Dumitrescu, Journal of Systemics, Cybernetics and Informatics 18 (2020) 55–61.","chicago":"Meyer, Maurice, Maximilian Frank, Melina Massmann, and Roman Dumitrescu. “Research and Consulting in Data-Driven Strategic Product Planning.” <i>Journal of Systemics, Cybernetics and Informatics</i> 18, no. 2 (2020): 55–61.","ieee":"M. Meyer, M. Frank, M. Massmann, and R. Dumitrescu, “Research and Consulting in Data-Driven Strategic Product Planning,” <i>Journal of Systemics, Cybernetics and Informatics</i>, vol. 18, no. 2, pp. 55–61, 2020.","apa":"Meyer, M., Frank, M., Massmann, M., &#38; Dumitrescu, R. (2020). Research and Consulting in Data-Driven Strategic Product Planning. <i>Journal of Systemics, Cybernetics and Informatics</i>, <i>18</i>(2), 55–61.","bibtex":"@article{Meyer_Frank_Massmann_Dumitrescu_2020, title={Research and Consulting in Data-Driven Strategic Product Planning}, volume={18}, number={2}, journal={Journal of Systemics, Cybernetics and Informatics}, author={Meyer, Maurice and Frank, Maximilian and Massmann, Melina and Dumitrescu, Roman}, year={2020}, pages={55–61} }","ama":"Meyer M, Frank M, Massmann M, Dumitrescu R. Research and Consulting in Data-Driven Strategic Product Planning. <i>Journal of Systemics, Cybernetics and Informatics</i>. 2020;18(2):55-61.","mla":"Meyer, Maurice, et al. “Research and Consulting in Data-Driven Strategic Product Planning.” <i>Journal of Systemics, Cybernetics and Informatics</i>, vol. 18, no. 2, 2020, pp. 55–61."},"publication":"Journal of Systemics, Cybernetics and Informatics","issue":"2","volume":18,"user_id":"77201","_id":"19866","language":[{"iso":"eng"}],"page":"55-61","article_type":"original","intvolume":"        18","date_updated":"2022-01-06T06:54:14Z","author":[{"id":"77201","full_name":"Meyer, Maurice","last_name":"Meyer","orcid":"0000-0003-0606-7321","first_name":"Maurice"},{"first_name":"Maximilian","last_name":"Frank","full_name":"Frank, Maximilian"},{"first_name":"Melina","last_name":"Massmann","full_name":"Massmann, Melina"},{"id":"16190","full_name":"Dumitrescu, Roman","first_name":"Roman","last_name":"Dumitrescu"}],"title":"Research and Consulting in Data-Driven Strategic Product Planning","year":"2020","status":"public"},{"external_id":{"arxiv":["2010.02043 "]},"citation":{"short":"J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes , N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, Springer, 2020, pp. 65–80.","chicago":"Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up.” In <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i>, edited by Stéphane  Devismes  and Neeraj  Mittal, 12514:65–80. Lecture Notes in Computer Science (LNCS). Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">https://doi.org/10.1007/978-3-030-64348-5_6</a>.","apa":"Castenow, J., Kling, P., Knollmann, T., &#38; Meyer auf der Heide, F. (2020). A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up. In S. Devismes  &#38; N. Mittal (Eds.), <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i> (Vol. 12514, pp. 65–80). Springer. <a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">https://doi.org/10.1007/978-3-030-64348-5_6</a>","ieee":"J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up,” in <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i>, 2020, vol. 12514, pp. 65–80.","ama":"Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up. In: Devismes  S, Mittal N, eds. <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i>. Vol 12514. Lecture Notes in Computer Science (LNCS). Springer; 2020:65-80. doi:<a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">10.1007/978-3-030-64348-5_6</a>","bibtex":"@inproceedings{Castenow_Kling_Knollmann_Meyer auf der Heide_2020, series={Lecture Notes in Computer Science (LNCS)}, title={A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up}, volume={12514}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">10.1007/978-3-030-64348-5_6</a>}, booktitle={Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings}, publisher={Springer}, author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Devismes , Stéphane  and Mittal, Neeraj Editors}, year={2020}, pages={65–80}, collection={Lecture Notes in Computer Science (LNCS)} }","mla":"Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up.” <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i>, edited by Stéphane  Devismes  and Neeraj  Mittal, vol. 12514, Springer, 2020, pp. 65–80, doi:<a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">10.1007/978-3-030-64348-5_6</a>."},"volume":12514,"editor":[{"full_name":"Devismes , Stéphane ","last_name":"Devismes ","first_name":"Stéphane "},{"full_name":"Mittal, Neeraj ","first_name":"Neeraj ","last_name":"Mittal"}],"user_id":"38705","_id":"19899","publisher":"Springer","page":"65-80","status":"public","department":[{"_id":"63"}],"type":"conference","date_created":"2020-10-06T07:27:10Z","abstract":[{"lang":"eng","text":"Most existing robot formation problems seek a target formation of a certain\r\nminimal and, thus, efficient structure. Examples include the Gathering\r\nand the Chain-Formation problem. In this work, we study formation problems that\r\ntry to reach a maximal structure, supporting for example an efficient\r\ncoverage in exploration scenarios. A recent example is the NASA Shapeshifter\r\nproject, which describes how the robots form a relay chain along which gathered\r\ndata from extraterrestrial cave explorations may be sent to a home base.\r\n  As a first step towards understanding such maximization tasks, we introduce\r\nand study the Max-Chain-Formation problem, where $n$ robots are ordered along a\r\nwinding, potentially self-intersecting chain and must form a connected,\r\nstraight line of maximal length connecting its two endpoints. We propose and\r\nanalyze strategies in a discrete and in a continuous time model. In the\r\ndiscrete case, we give a complete analysis if all robots are initially\r\ncollinear, showing that the worst-case time to reach an\r\n$\\varepsilon$-approximation is upper bounded by $\\mathcal{O}(n^2 \\cdot \\log\r\n(n/\\varepsilon))$ and lower bounded by $\\Omega(n^2 \\cdot~\\log\r\n(1/\\varepsilon))$. If one endpoint of the chain remains stationary, this result\r\ncan be extended to the non-collinear case. If both endpoints move, we identify\r\na family of instances whose runtime is unbounded. For the continuous model, we\r\ngive a strategy with an optimal runtime bound of $\\Theta(n)$. Avoiding an\r\nunbounded runtime similar to the discrete case relies crucially on a\r\ncounter-intuitive aspect of the strategy: slowing down the endpoints while all\r\nother robots move at full speed. Surprisingly, we can show that a similar trick\r\ndoes not work in the discrete model."}],"publication":"Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings","doi":"10.1007/978-3-030-64348-5_6","series_title":"Lecture Notes in Computer Science (LNCS)","language":[{"iso":"eng"}],"intvolume":"     12514","publication_status":"published","date_updated":"2022-01-06T06:54:14Z","publication_identifier":{"isbn":["978-3-030-64347-8"]},"author":[{"full_name":"Castenow, Jannik","last_name":"Castenow","first_name":"Jannik","id":"38705"},{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"id":"39241","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","first_name":"Till","last_name":"Knollmann"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"year":"2020","title":"A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up"},{"_id":"19953","publisher":"PMLR","page":"49-64","volume":129,"editor":[{"first_name":"Sinno","last_name":"Jialin Pan","full_name":"Jialin Pan, Sinno"},{"first_name":"Masashi","last_name":"Sugiyama","full_name":"Sugiyama, Masashi"}],"user_id":"48192","ddc":["006"],"conference":{"end_date":"2020-11-20","start_date":"2020-11-18","name":"Asian Conference on Machine Learning","location":"Bangkok, Thailand"},"status":"public","has_accepted_license":"1","place":"Bangkok, Thailand","external_id":{"arxiv":["2007.00346"]},"oa":"1","citation":{"short":"C. Damke, V. Melnikov, E. Hüllermeier, in: S. Jialin Pan, M. Sugiyama (Eds.), Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020), PMLR, Bangkok, Thailand, 2020, pp. 49–64.","chicago":"Damke, Clemens, Vitaly Melnikov, and Eyke Hüllermeier. “A Novel Higher-Order Weisfeiler-Lehman Graph Convolution.” In <i>Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)</i>, edited by Sinno Jialin Pan and Masashi Sugiyama, 129:49–64. Proceedings of Machine Learning Research. Bangkok, Thailand: PMLR, 2020.","ieee":"C. Damke, V. Melnikov, and E. Hüllermeier, “A Novel Higher-order Weisfeiler-Lehman Graph Convolution,” in <i>Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)</i>, Bangkok, Thailand, 2020, vol. 129, pp. 49–64.","apa":"Damke, C., Melnikov, V., &#38; Hüllermeier, E. (2020). A Novel Higher-order Weisfeiler-Lehman Graph Convolution. In S. Jialin Pan &#38; M. Sugiyama (Eds.), <i>Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)</i> (Vol. 129, pp. 49–64). Bangkok, Thailand: PMLR.","bibtex":"@inproceedings{Damke_Melnikov_Hüllermeier_2020, place={Bangkok, Thailand}, series={Proceedings of Machine Learning Research}, title={A Novel Higher-order Weisfeiler-Lehman Graph Convolution}, volume={129}, booktitle={Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)}, publisher={PMLR}, author={Damke, Clemens and Melnikov, Vitaly and Hüllermeier, Eyke}, editor={Jialin Pan, Sinno and Sugiyama, MasashiEditors}, year={2020}, pages={49–64}, collection={Proceedings of Machine Learning Research} }","ama":"Damke C, Melnikov V, Hüllermeier E. A Novel Higher-order Weisfeiler-Lehman Graph Convolution. In: Jialin Pan S, Sugiyama M, eds. <i>Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)</i>. Vol 129. Proceedings of Machine Learning Research. Bangkok, Thailand: PMLR; 2020:49-64.","mla":"Damke, Clemens, et al. “A Novel Higher-Order Weisfeiler-Lehman Graph Convolution.” <i>Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)</i>, edited by Sinno Jialin Pan and Masashi Sugiyama, vol. 129, PMLR, 2020, pp. 49–64."},"file_date_updated":"2020-10-08T11:24:29Z","quality_controlled":"1","language":[{"iso":"eng"}],"series_title":"Proceedings of Machine Learning Research","author":[{"id":"48192","full_name":"Damke, Clemens","orcid":"0000-0002-0455-0048","first_name":"Clemens","last_name":"Damke"},{"id":"58747","last_name":"Melnikov","first_name":"Vitaly","full_name":"Melnikov, Vitaly"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier","id":"48129"}],"title":"A Novel Higher-order Weisfeiler-Lehman Graph Convolution","year":"2020","intvolume":"       129","publication_status":"published","date_updated":"2022-01-06T06:54:17Z","date_created":"2020-10-08T10:48:38Z","file":[{"date_created":"2020-10-08T10:54:48Z","creator":"cdamke","file_id":"19954","content_type":"application/pdf","file_name":"damke20.pdf","access_level":"open_access","file_size":771137,"relation":"main_file","date_updated":"2020-10-08T11:21:00Z"},{"creator":"cdamke","date_created":"2020-10-08T10:54:59Z","date_updated":"2020-10-08T11:24:29Z","relation":"supplementary_material","access_level":"open_access","file_size":613163,"file_name":"damke20-supp.pdf","content_type":"application/pdf","file_id":"19955"}],"department":[{"_id":"355"}],"type":"conference","keyword":["graph neural networks","Weisfeiler-Lehman test","cycle detection"],"publication":"Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)","abstract":[{"lang":"eng","text":"Current GNN architectures use a vertex neighborhood aggregation scheme, which limits their discriminative power to that of the 1-dimensional Weisfeiler-Lehman (WL) graph isomorphism test. Here, we propose a novel graph convolution operator that is based on the 2-dimensional WL test. We formally show that the resulting 2-WL-GNN architecture is more discriminative than existing GNN approaches. This theoretical result is complemented by experimental studies using synthetic and real data. On multiple common graph classification benchmarks, we demonstrate that the proposed model is competitive with state-of-the-art graph kernels and GNNs."}]},{"supervisor":[{"id":"573","full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"citation":{"mla":"Mayer, Stefan. <i>Optimierung von JMCTest Beim Testen von Inter Method Contracts</i>. Universität Paderborn, 2020.","bibtex":"@book{Mayer_2020, title={Optimierung von JMCTest beim Testen von Inter Method Contracts}, publisher={Universität Paderborn}, author={Mayer, Stefan}, year={2020} }","ama":"Mayer S. <i>Optimierung von JMCTest Beim Testen von Inter Method Contracts</i>. Universität Paderborn; 2020.","ieee":"S. Mayer, <i>Optimierung von JMCTest beim Testen von Inter Method Contracts</i>. Universität Paderborn, 2020.","apa":"Mayer, S. (2020). <i>Optimierung von JMCTest beim Testen von Inter Method Contracts</i>. Universität Paderborn.","short":"S. Mayer, Optimierung von JMCTest Beim Testen von Inter Method Contracts, Universität Paderborn, 2020.","chicago":"Mayer, Stefan. <i>Optimierung von JMCTest Beim Testen von Inter Method Contracts</i>. Universität Paderborn, 2020."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"11","name":"SFB 901 - Subproject B3"}],"date_created":"2020-10-15T05:15:46Z","type":"bachelorsthesis","department":[{"_id":"7"},{"_id":"77"}],"status":"public","title":"Optimierung von JMCTest beim Testen von Inter Method Contracts","year":"2020","author":[{"full_name":"Mayer, Stefan","first_name":"Stefan","last_name":"Mayer"}],"date_updated":"2022-01-06T06:54:18Z","language":[{"iso":"eng"}],"_id":"19999","publisher":"Universität Paderborn","user_id":"477"},{"page":"6264-6276","_id":"20116","language":[{"iso":"eng"}],"user_id":"82920","ddc":["000"],"year":"2020","title":"Mining Crowdsourcing Problems from Discussion Forums of Workers","status":"public","author":[{"full_name":"Nouri, Zahra","first_name":"Zahra","last_name":"Nouri","id":"35802"},{"first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"}],"conference":{"end_date":"2020-12-13","name":"The 28th International Conference on Computational Linguistics","start_date":"2020-12-08","location":"Barcelona, Spain"},"publication_status":"accepted","date_updated":"2022-01-06T06:54:19Z","has_accepted_license":"1","file":[{"creator":"znouri","date_created":"2020-11-10T14:25:56Z","relation":"main_file","date_updated":"2020-11-10T14:25:56Z","file_name":"Mining Crowdsourcing Problems from Discussion Forums of Workers.pdf","access_level":"closed","file_size":610246,"file_id":"20334","content_type":"application/pdf","success":1}],"date_created":"2020-10-18T12:21:34Z","type":"conference","department":[{"_id":"600"}],"file_date_updated":"2020-11-10T14:25:56Z","publication":"Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics","citation":{"short":"Z. Nouri, H. Wachsmuth, G. Engels, in: Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics, n.d., pp. 6264–6276.","chicago":"Nouri, Zahra, Henning Wachsmuth, and Gregor Engels. “Mining Crowdsourcing Problems from Discussion Forums of Workers.” In <i>Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics</i>, 6264–76, n.d.","apa":"Nouri, Z., Wachsmuth, H., &#38; Engels, G. (n.d.). Mining Crowdsourcing Problems from Discussion Forums of Workers. In <i>Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics</i> (pp. 6264–6276). Barcelona, Spain.","ieee":"Z. Nouri, H. Wachsmuth, and G. Engels, “Mining Crowdsourcing Problems from Discussion Forums of Workers,” in <i>Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics</i>, Barcelona, Spain, pp. 6264–6276.","ama":"Nouri Z, Wachsmuth H, Engels G. Mining Crowdsourcing Problems from Discussion Forums of Workers. In: <i>Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics</i>. ; :6264-6276.","bibtex":"@inproceedings{Nouri_Wachsmuth_Engels, title={Mining Crowdsourcing Problems from Discussion Forums of Workers}, booktitle={Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics}, author={Nouri, Zahra and Wachsmuth, Henning and Engels, Gregor}, pages={6264–6276} }","mla":"Nouri, Zahra, et al. “Mining Crowdsourcing Problems from Discussion Forums of Workers.” <i>Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics</i>, pp. 6264–76."}},{"publication":"Third Workshop on Computational Modeling of People's Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)","citation":{"ieee":"R. El Baff, K. Al-Khatib, B. Stein, and H. Wachsmuth, “Persuasiveness of News Editorials depending on Ideology and Personality,” in <i>Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)</i>, 2020, pp. 29–40.","apa":"El Baff, R., Al-Khatib, K., Stein, B., &#38; Wachsmuth, H. (2020). Persuasiveness of News Editorials depending on Ideology and Personality. In <i>Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)</i> (pp. 29–40).","chicago":"El Baff, Roxanne, Khalid Al-Khatib, Benno Stein, and Henning Wachsmuth. “Persuasiveness of News Editorials Depending on Ideology and Personality.” In <i>Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)</i>, 29–40, 2020.","short":"R. El Baff, K. Al-Khatib, B. Stein, H. Wachsmuth, in: Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020), 2020, pp. 29–40.","mla":"El Baff, Roxanne, et al. “Persuasiveness of News Editorials Depending on Ideology and Personality.” <i>Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)</i>, 2020, pp. 29–40.","bibtex":"@inproceedings{El Baff_Al-Khatib_Stein_Wachsmuth_2020, title={Persuasiveness of News Editorials depending on Ideology and Personality}, booktitle={Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)}, author={El Baff, Roxanne and Al-Khatib, Khalid and Stein, Benno and Wachsmuth, Henning}, year={2020}, pages={29–40} }","ama":"El Baff R, Al-Khatib K, Stein B, Wachsmuth H. Persuasiveness of News Editorials depending on Ideology and Personality. In: <i>Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)</i>. ; 2020:29-40."},"date_created":"2020-10-19T08:49:05Z","type":"conference","department":[{"_id":"600"}],"title":"Persuasiveness of News Editorials depending on Ideology and Personality","status":"public","year":"2020","author":[{"last_name":"El Baff","first_name":"Roxanne","full_name":"El Baff, Roxanne"},{"full_name":"Al-Khatib, Khalid","last_name":"Al-Khatib","first_name":"Khalid"},{"last_name":"Stein","first_name":"Benno","full_name":"Stein, Benno"},{"full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth","id":"3900"}],"date_updated":"2022-01-06T06:54:20Z","main_file_link":[{"url":"https://www.aclweb.org/anthology/2020.peoples-1.4.pdf"}],"page":"29-40","_id":"20122","language":[{"iso":"eng"}],"user_id":"82920"},{"date_created":"2020-10-20T13:03:08Z","type":"conference","department":[{"_id":"600"}],"oa":"1","publication":"Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)","citation":{"mla":"Spliethöver, Maximilian, and Henning Wachsmuth. “Argument from Old Man’s View: Assessing Social Bias in Argumentation.” <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>, 2020, pp. 76–87.","ama":"Spliethöver M, Wachsmuth H. Argument from Old Man’s View: Assessing Social Bias in Argumentation. In: <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>. ; 2020:76-87.","bibtex":"@inproceedings{Spliethöver_Wachsmuth_2020, title={Argument from Old Man’s View: Assessing Social Bias in Argumentation}, booktitle={Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)}, author={Spliethöver, Maximilian and Wachsmuth, Henning}, year={2020}, pages={76–87} }","apa":"Spliethöver, M., &#38; Wachsmuth, H. (2020). Argument from Old Man’s View: Assessing Social Bias in Argumentation. In <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i> (pp. 76–87).","ieee":"M. Spliethöver and H. Wachsmuth, “Argument from Old Man’s View: Assessing Social Bias in Argumentation,” in <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>, 2020, pp. 76–87.","chicago":"Spliethöver, Maximilian, and Henning Wachsmuth. “Argument from Old Man’s View: Assessing Social Bias in Argumentation.” In <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>, 76–87, 2020.","short":"M. Spliethöver, H. Wachsmuth, in: Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020), 2020, pp. 76–87."},"main_file_link":[{"url":"https://www.aclweb.org/anthology/2020.argmining-1.9","open_access":"1"}],"page":"76-87","language":[{"iso":"eng"}],"_id":"20139","user_id":"84035","title":"Argument from Old Man's View: Assessing Social Bias in Argumentation","year":"2020","status":"public","author":[{"last_name":"Spliethöver","first_name":"Maximilian","orcid":"0000-0003-4364-1409","full_name":"Spliethöver, Maximilian","id":"84035"},{"full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth","id":"3900"}],"date_updated":"2022-01-06T06:54:20Z"},{"department":[{"_id":"600"}],"type":"conference","date_created":"2020-10-20T13:04:15Z","citation":{"bibtex":"@inproceedings{Dorsch_Wachsmuth_2020, title={Semi-Supervised Cleansing of Web Argument Corpora}, booktitle={Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)}, author={Dorsch, Jonas and Wachsmuth, Henning}, year={2020}, pages={19–29} }","ama":"Dorsch J, Wachsmuth H. Semi-Supervised Cleansing of Web Argument Corpora. In: <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>. ; 2020:19-29.","mla":"Dorsch, Jonas, and Henning Wachsmuth. “Semi-Supervised Cleansing of Web Argument Corpora.” <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>, 2020, pp. 19–29.","chicago":"Dorsch, Jonas, and Henning Wachsmuth. “Semi-Supervised Cleansing of Web Argument Corpora.” In <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>, 19–29, 2020.","short":"J. Dorsch, H. Wachsmuth, in: Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020), 2020, pp. 19–29.","ieee":"J. Dorsch and H. Wachsmuth, “Semi-Supervised Cleansing of Web Argument Corpora,” in <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>, 2020, pp. 19–29.","apa":"Dorsch, J., &#38; Wachsmuth, H. (2020). Semi-Supervised Cleansing of Web Argument Corpora. In <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i> (pp. 19–29)."},"publication":"Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)","user_id":"82920","_id":"20140","language":[{"iso":"eng"}],"page":"19-29","main_file_link":[{"url":"https://www.aclweb.org/anthology/2020.argmining-1.3.pdf"}],"date_updated":"2022-01-06T06:54:20Z","author":[{"last_name":"Dorsch","first_name":"Jonas","full_name":"Dorsch, Jonas"},{"id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"}],"status":"public","title":"Semi-Supervised Cleansing of Web Argument Corpora","year":"2020"},{"place":"Dagstuhl, Germany","citation":{"ieee":"S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures for the Insertion of an Edge,” in <i>28th Annual European Symposium on Algorithms (ESA 2020)</i>, 2020, vol. 173, pp. 12:1-12:14.","apa":"Baswana, S., Gupta, S., &#38; Knollmann, T. (2020). Mincut Sensitivity Data Structures for the Insertion of an Edge. In F. Grandoni, G. Herman, &#38; P. Sanders (Eds.), <i>28th Annual European Symposium on Algorithms (ESA 2020)</i> (Vol. 173, pp. 12:1-12:14). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">https://doi.org/10.4230/LIPIcs.ESA.2020.12</a>","short":"S. Baswana, S. Gupta, T. Knollmann, in: F. Grandoni, G. Herman, P. Sanders (Eds.), 28th Annual European Symposium on Algorithms (ESA 2020), Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, pp. 12:1-12:14.","chicago":"Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” In <i>28th Annual European Symposium on Algorithms (ESA 2020)</i>, edited by Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders, 173:12:1-12:14. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">https://doi.org/10.4230/LIPIcs.ESA.2020.12</a>.","mla":"Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” <i>28th Annual European Symposium on Algorithms (ESA 2020)</i>, edited by Fabrizio Grandoni et al., vol. 173, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2020, pp. 12:1-12:14, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">10.4230/LIPIcs.ESA.2020.12</a>.","bibtex":"@inproceedings{Baswana_Gupta_Knollmann_2020, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Mincut Sensitivity Data Structures for the Insertion of an Edge}, volume={173}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">10.4230/LIPIcs.ESA.2020.12</a>}, booktitle={28th Annual European Symposium on Algorithms (ESA 2020)}, publisher={Schloss Dagstuhl -- Leibniz-Zentrum für Informatik}, author={Baswana, Surender and Gupta, Shiv and Knollmann, Till}, editor={Grandoni, Fabrizio and Herman, Grzegorz and Sanders, PeterEditors}, year={2020}, pages={12:1-12:14}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","ama":"Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the Insertion of an Edge. In: Grandoni F, Herman G, Sanders P, eds. <i>28th Annual European Symposium on Algorithms (ESA 2020)</i>. Vol 173. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik; 2020:12:1-12:14. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">10.4230/LIPIcs.ESA.2020.12</a>"},"page":"12:1-12:14","publisher":"Schloss Dagstuhl -- Leibniz-Zentrum für Informatik","_id":"20159","user_id":"39241","editor":[{"full_name":"Grandoni, Fabrizio","last_name":"Grandoni","first_name":"Fabrizio"},{"full_name":"Herman, Grzegorz","last_name":"Herman","first_name":"Grzegorz"},{"full_name":"Sanders, Peter","first_name":"Peter","last_name":"Sanders"}],"volume":173,"status":"public","date_created":"2020-10-21T12:00:20Z","type":"conference","keyword":["Mincut","Sensitivity","Data Structure"],"department":[{"_id":"63"}],"publication":"28th Annual European Symposium on Algorithms (ESA 2020)","abstract":[{"text":"Let G = (V,E) be an undirected graph on n vertices with non-negative capacities on its edges. The mincut sensitivity problem for the insertion of an edge is defined as follows. Build a compact data structure for G and a given set S ⊆ V of vertices that, on receiving any edge (x,y) ∈ S×S of positive capacity as query input, can efficiently report the set of all pairs from S× S whose mincut value increases upon insertion of the edge (x,y) to G. The only result that exists for this problem is for a single pair of vertices (Picard and Queyranne, Mathematical Programming Study, 13 (1980), 8-16). We present the following results for the single source and the all-pairs versions of this problem. \r\n1) Single source: Given any designated source vertex s, there exists a data structure of size 𝒪(|S|) that can output all those vertices from S whose mincut value to s increases upon insertion of any given edge. The time taken by the data structure to answer any query is 𝒪(|S|). \r\n2) All-pairs: There exists an 𝒪(|S|²) size data structure that can output all those pairs of vertices from S× S whose mincut value gets increased upon insertion of any given edge. The time taken by the data structure to answer any query is 𝒪(k), where k is the number of pairs of vertices whose mincut increases. \r\nFor both these versions, we also address the problem of reporting the values of the mincuts upon insertion of any given edge. To derive our results, we use interesting insights into the nearest and the farthest mincuts for a pair of vertices. In addition, a crucial result, that we establish and use in our data structures, is that there exists a directed acyclic graph of 𝒪(n) size that compactly stores the farthest mincuts from all vertices of V to a designated vertex s in the graph. We believe that this result is of independent interest, especially, because it also complements a previously existing result by Hariharan et al. (STOC 2007) that the nearest mincuts from all vertices of V to s is a laminar family, and hence, can be stored compactly in a tree of 𝒪(n) size.","lang":"eng"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.ESA.2020.12","title":"Mincut Sensitivity Data Structures for the Insertion of an Edge","year":"2020","publication_identifier":{"isbn":["978-3-95977-162-7"],"issn":["1868-8969"]},"author":[{"full_name":"Baswana, Surender","first_name":"Surender","last_name":"Baswana"},{"full_name":"Gupta, Shiv","first_name":"Shiv","last_name":"Gupta"},{"id":"39241","full_name":"Knollmann, Till","first_name":"Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann"}],"date_updated":"2022-01-06T06:54:20Z","intvolume":"       173"},{"citation":{"mla":"Bondarenko, Alexander, et al. “Overview of Touché 2020: Argument Retrieval.” <i>CEUR Workshop Proceedings</i>, vol. 2696, 2020, pp. 384–95.","bibtex":"@inproceedings{Bondarenko_Fröbe_Beloucif_Gienapp_Ajjour_Panchenko_Biemann_Stein_Wachsmuth_Potthast_et al._2020, title={Overview of Touché 2020: Argument Retrieval}, volume={2696}, booktitle={CEUR Workshop Proceedings}, author={Bondarenko, Alexander and Fröbe, Maik and Beloucif, Meriem and Gienapp, Lukas and Ajjour, Yamen and Panchenko, Alexander and Biemann, Chris and Stein, Benno and Wachsmuth, Henning and Potthast, Martin and et al.}, year={2020}, pages={384–395} }","ama":"Bondarenko A, Fröbe M, Beloucif M, et al. Overview of Touché 2020: Argument Retrieval. In: <i>CEUR Workshop Proceedings</i>. Vol 2696. ; 2020:384-395.","ieee":"A. Bondarenko <i>et al.</i>, “Overview of Touché 2020: Argument Retrieval,” in <i>CEUR Workshop Proceedings</i>, 2020, vol. 2696, pp. 384–395.","apa":"Bondarenko, A., Fröbe, M., Beloucif, M., Gienapp, L., Ajjour, Y., Panchenko, A., … Hagen, M. (2020). Overview of Touché 2020: Argument Retrieval. In <i>CEUR Workshop Proceedings</i> (Vol. 2696, pp. 384–395).","chicago":"Bondarenko, Alexander, Maik Fröbe, Meriem Beloucif, Lukas Gienapp, Yamen Ajjour, Alexander Panchenko, Chris Biemann, et al. “Overview of Touché 2020: Argument Retrieval.” In <i>CEUR Workshop Proceedings</i>, 2696:384–95, 2020.","short":"A. Bondarenko, M. Fröbe, M. Beloucif, L. Gienapp, Y. Ajjour, A. Panchenko, C. Biemann, B. Stein, H. Wachsmuth, M. Potthast, M. Hagen, in: CEUR Workshop Proceedings, 2020, pp. 384–395."},"publication":"CEUR Workshop Proceedings","date_created":"2020-10-22T07:22:52Z","department":[{"_id":"600"}],"type":"conference","author":[{"last_name":"Bondarenko","first_name":"Alexander","full_name":"Bondarenko, Alexander"},{"full_name":"Fröbe, Maik","last_name":"Fröbe","first_name":"Maik"},{"full_name":"Beloucif, Meriem","last_name":"Beloucif","first_name":"Meriem"},{"full_name":"Gienapp, Lukas","first_name":"Lukas","last_name":"Gienapp"},{"full_name":"Ajjour, Yamen","last_name":"Ajjour","first_name":"Yamen"},{"full_name":"Panchenko, Alexander","last_name":"Panchenko","first_name":"Alexander"},{"full_name":"Biemann, Chris","last_name":"Biemann","first_name":"Chris"},{"last_name":"Stein","first_name":"Benno","full_name":"Stein, Benno"},{"last_name":"Wachsmuth","first_name":"Henning","full_name":"Wachsmuth, Henning","id":"3900"},{"full_name":"Potthast, Martin","first_name":"Martin","last_name":"Potthast"},{"full_name":"Hagen, Matthias","first_name":"Matthias","last_name":"Hagen"}],"title":"Overview of Touché 2020: Argument Retrieval","status":"public","year":"2020","intvolume":"      2696","date_updated":"2022-01-06T06:54:20Z","language":[{"iso":"eng"}],"_id":"20166","main_file_link":[{"url":"http://ceur-ws.org/Vol-2696/paper_261.pdf"}],"page":"384-395","volume":2696,"user_id":"82920"},{"citation":{"short":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes, N.  Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , Springer, 2020, pp. 60–64.","chicago":"Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility .” In <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i>, edited by Stéphane  Devismes and Neeraj  Mittal, 12514:60–64. Lecture Notes in Computer Science (LNCS). Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">https://doi.org/10.1007/978-3-030-64348-5_5</a>.","ieee":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility ,” in <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i>, 2020, vol. 12514, pp. 60–64.","apa":"Castenow, J., Harbig, J., Jung, D., Knollmann, T., &#38; Meyer auf der Heide, F. (2020). Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility . In S. Devismes &#38; N.  Mittal (Eds.), <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i> (Vol. 12514, pp. 60–64). Springer. <a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">https://doi.org/10.1007/978-3-030-64348-5_5</a>","bibtex":"@inproceedings{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2020, series={Lecture Notes in Computer Science (LNCS)}, title={Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility }, volume={12514}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">10.1007/978-3-030-64348-5_5</a>}, booktitle={Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings }, publisher={Springer}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Devismes, Stéphane  and  Mittal, NeerajEditors}, year={2020}, pages={60–64}, collection={Lecture Notes in Computer Science (LNCS)} }","ama":"Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility . In: Devismes S,  Mittal N, eds. <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i>. Vol 12514. Lecture Notes in Computer Science (LNCS). Springer; 2020:60-64. doi:<a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">10.1007/978-3-030-64348-5_5</a>","mla":"Castenow, Jannik, et al. “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility .” <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i>, edited by Stéphane  Devismes and Neeraj  Mittal, vol. 12514, Springer, 2020, pp. 60–64, doi:<a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">10.1007/978-3-030-64348-5_5</a>."},"external_id":{"arxiv":["2010.04424 "]},"status":"public","editor":[{"full_name":"Devismes, Stéphane ","first_name":"Stéphane ","last_name":"Devismes"},{"first_name":"Neeraj","last_name":" Mittal","full_name":" Mittal, Neeraj"}],"volume":12514,"user_id":"38705","publisher":"Springer","_id":"20185","page":"60-64","publication":"Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings ","department":[{"_id":"63"}],"type":"conference","date_created":"2020-10-23T08:50:28Z","intvolume":"     12514","date_updated":"2022-01-06T06:54:21Z","publication_status":"published","publication_identifier":{"isbn":["978-3-030-64347-8"]},"author":[{"full_name":"Castenow, Jannik","last_name":"Castenow","first_name":"Jannik","id":"38705"},{"full_name":"Harbig, Jonas","last_name":"Harbig","first_name":"Jonas","id":"47213"},{"id":"37827","first_name":"Daniel","last_name":"Jung","full_name":"Jung, Daniel"},{"full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","first_name":"Till","last_name":"Knollmann","id":"39241"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"title":"Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility ","year":"2020","doi":"10.1007/978-3-030-64348-5_5","series_title":"Lecture Notes in Computer Science (LNCS)","language":[{"iso":"eng"}]},{"citation":{"bibtex":"@book{Yeole_2020, title={Plurality Consensus in Hybrid Networks}, author={Yeole, Paresh Kishor}, year={2020} }","ama":"Yeole PK. <i>Plurality Consensus in Hybrid Networks</i>.; 2020.","mla":"Yeole, Paresh Kishor. <i>Plurality Consensus in Hybrid Networks</i>. 2020.","chicago":"Yeole, Paresh Kishor. <i>Plurality Consensus in Hybrid Networks</i>, 2020.","short":"P.K. Yeole, Plurality Consensus in Hybrid Networks, 2020.","ieee":"P. K. Yeole, <i>Plurality Consensus in Hybrid Networks</i>. 2020.","apa":"Yeole, P. K. (2020). <i>Plurality Consensus in Hybrid Networks</i>."},"supervisor":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_created":"2020-10-29T07:45:57Z","type":"mastersthesis","department":[{"_id":"79"}],"year":"2020","title":"Plurality Consensus in Hybrid Networks","status":"public","author":[{"full_name":"Yeole, Paresh Kishor","first_name":"Paresh Kishor","last_name":"Yeole"}],"date_updated":"2022-01-06T06:54:23Z","language":[{"iso":"eng"}],"_id":"20221","user_id":"15504"},{"volume":12136,"editor":[{"full_name":"Gotsman, Alexey","last_name":"Gotsman","first_name":"Alexey"},{"full_name":"Sokolova, Ana","last_name":"Sokolova","first_name":"Ana"}],"user_id":"29719","_id":"20274","publisher":"Springer","page":"39-58","status":"public","project":[{"_id":"78","name":"Validation of Software Transactional Memory"}],"citation":{"chicago":"Bila, Eleni, Simon Doherty, Brijesh Dongol, John Derrick, Gerhard Schellhorn, and Heike Wehrheim. “Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory.” In <i>Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings</i>, edited by Alexey Gotsman and Ana Sokolova, 12136:39–58. Lecture Notes in Computer Science. Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-50086-3\\_3\">https://doi.org/10.1007/978-3-030-50086-3\\_3</a>.","short":"E. Bila, S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, H. Wehrheim, in: A. Gotsman, A. Sokolova (Eds.), Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings, Springer, 2020, pp. 39–58.","ieee":"E. Bila, S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, and H. Wehrheim, “Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory,” in <i>Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings</i>, 2020, vol. 12136, pp. 39–58.","apa":"Bila, E., Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., &#38; Wehrheim, H. (2020). Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory. In A. Gotsman &#38; A. Sokolova (Eds.), <i>Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings</i> (Vol. 12136, pp. 39–58). Springer. <a href=\"https://doi.org/10.1007/978-3-030-50086-3\\_3\">https://doi.org/10.1007/978-3-030-50086-3\\_3</a>","bibtex":"@inproceedings{Bila_Doherty_Dongol_Derrick_Schellhorn_Wehrheim_2020, series={Lecture Notes in Computer Science}, title={Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory}, volume={12136}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-50086-3\\_3\">10.1007/978-3-030-50086-3\\_3</a>}, booktitle={Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings}, publisher={Springer}, author={Bila, Eleni and Doherty, Simon and Dongol, Brijesh and Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}, editor={Gotsman, Alexey and Sokolova, AnaEditors}, year={2020}, pages={39–58}, collection={Lecture Notes in Computer Science} }","ama":"Bila E, Doherty S, Dongol B, Derrick J, Schellhorn G, Wehrheim H. Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory. In: Gotsman A, Sokolova A, eds. <i>Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings</i>. Vol 12136. Lecture Notes in Computer Science. Springer; 2020:39-58. doi:<a href=\"https://doi.org/10.1007/978-3-030-50086-3\\_3\">10.1007/978-3-030-50086-3\\_3</a>","mla":"Bila, Eleni, et al. “Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory.” <i>Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings</i>, edited by Alexey Gotsman and Ana Sokolova, vol. 12136, Springer, 2020, pp. 39–58, doi:<a href=\"https://doi.org/10.1007/978-3-030-50086-3\\_3\">10.1007/978-3-030-50086-3\\_3</a>."},"doi":"10.1007/978-3-030-50086-3\\_3","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","intvolume":"     12136","date_updated":"2022-01-06T06:54:25Z","author":[{"last_name":"Bila","first_name":"Eleni","full_name":"Bila, Eleni"},{"full_name":"Doherty, Simon","last_name":"Doherty","first_name":"Simon"},{"full_name":"Dongol, Brijesh","last_name":"Dongol","first_name":"Brijesh"},{"full_name":"Derrick, John","last_name":"Derrick","first_name":"John"},{"first_name":"Gerhard","last_name":"Schellhorn","full_name":"Schellhorn, Gerhard"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"year":"2020","title":"Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory","department":[{"_id":"77"}],"type":"conference","date_created":"2020-11-04T08:27:09Z","publication":"Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings"},{"_id":"20275","language":[{"iso":"eng"}],"publisher":"ScitePress","page":"15-26","editor":[{"last_name":"van Sinderen","first_name":"Marten","full_name":"van Sinderen, Marten"},{"full_name":"Fill, Hans{-}Georg","last_name":"Fill","first_name":"Hans{-}Georg"},{"first_name":"Leszek","last_name":"A. Maciaszek","full_name":"A. Maciaszek, Leszek"}],"doi":"10.5220/0009766600150026","user_id":"29719","author":[{"full_name":"Beringer, Steffen","first_name":"Steffen","last_name":"Beringer"},{"id":"573","full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"year":"2020","status":"public","title":"Consistency Analysis of AUTOSAR Timing Requirements","date_updated":"2022-01-06T06:54:25Z","date_created":"2020-11-04T08:31:37Z","department":[{"_id":"77"}],"type":"conference","citation":{"bibtex":"@inproceedings{Beringer_Wehrheim_2020, title={Consistency Analysis of AUTOSAR Timing Requirements}, DOI={<a href=\"https://doi.org/10.5220/0009766600150026\">10.5220/0009766600150026</a>}, booktitle={Proceedings of the 15th International Conference on Software Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020}, publisher={ScitePress}, author={Beringer, Steffen and Wehrheim, Heike}, editor={van Sinderen, Marten and Fill, Hans{-}Georg and A. Maciaszek, LeszekEditors}, year={2020}, pages={15–26} }","ama":"Beringer S, Wehrheim H. Consistency Analysis of AUTOSAR Timing Requirements. In: van Sinderen M, Fill H-}Georg, A. Maciaszek L, eds. <i>Proceedings of the 15th International Conference on Software Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020</i>. ScitePress; 2020:15-26. doi:<a href=\"https://doi.org/10.5220/0009766600150026\">10.5220/0009766600150026</a>","mla":"Beringer, Steffen, and Heike Wehrheim. “Consistency Analysis of AUTOSAR Timing Requirements.” <i>Proceedings of the 15th International Conference on Software Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020</i>, edited by Marten van Sinderen et al., ScitePress, 2020, pp. 15–26, doi:<a href=\"https://doi.org/10.5220/0009766600150026\">10.5220/0009766600150026</a>.","short":"S. Beringer, H. Wehrheim, in: M. van Sinderen, H.-}Georg Fill, L. A. Maciaszek (Eds.), Proceedings of the 15th International Conference on Software Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020, ScitePress, 2020, pp. 15–26.","chicago":"Beringer, Steffen, and Heike Wehrheim. “Consistency Analysis of AUTOSAR Timing Requirements.” In <i>Proceedings of the 15th International Conference on Software Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020</i>, edited by Marten van Sinderen, Hans{-}Georg Fill, and Leszek A. Maciaszek, 15–26. ScitePress, 2020. <a href=\"https://doi.org/10.5220/0009766600150026\">https://doi.org/10.5220/0009766600150026</a>.","ieee":"S. Beringer and H. Wehrheim, “Consistency Analysis of AUTOSAR Timing Requirements,” in <i>Proceedings of the 15th International Conference on Software Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020</i>, 2020, pp. 15–26.","apa":"Beringer, S., &#38; Wehrheim, H. (2020). Consistency Analysis of AUTOSAR Timing Requirements. In M. van Sinderen, H.-}Georg Fill, &#38; L. A. Maciaszek (Eds.), <i>Proceedings of the 15th International Conference on Software Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020</i> (pp. 15–26). ScitePress. <a href=\"https://doi.org/10.5220/0009766600150026\">https://doi.org/10.5220/0009766600150026</a>"},"publication":"Proceedings of the 15th International Conference on Software Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020"},{"citation":{"apa":"Beyer, D., &#38; Wehrheim, H. (2020). Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework. In T. Margaria &#38; B. Steffen (Eds.), <i>Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}</i> (Vol. 12476, pp. 143–167). Springer. <a href=\"https://doi.org/10.1007/978-3-030-61362-4\\_8\">https://doi.org/10.1007/978-3-030-61362-4\\_8</a>","ieee":"D. Beyer and H. Wehrheim, “Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework,” in <i>Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}</i>, 2020, vol. 12476, pp. 143–167.","short":"D. Beyer, H. Wehrheim, in: T. Margaria, B. Steffen (Eds.), Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}, Springer, 2020, pp. 143–167.","chicago":"Beyer, Dirk, and Heike Wehrheim. “Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework.” In <i>Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}</i>, edited by Tiziana Margaria and Bernhard Steffen, 12476:143–67. Lecture Notes in Computer Science. Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-61362-4\\_8\">https://doi.org/10.1007/978-3-030-61362-4\\_8</a>.","mla":"Beyer, Dirk, and Heike Wehrheim. “Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework.” <i>Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}</i>, edited by Tiziana Margaria and Bernhard Steffen, vol. 12476, Springer, 2020, pp. 143–67, doi:<a href=\"https://doi.org/10.1007/978-3-030-61362-4\\_8\">10.1007/978-3-030-61362-4\\_8</a>.","ama":"Beyer D, Wehrheim H. Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework. In: Margaria T, Steffen B, eds. <i>Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}</i>. Vol 12476. Lecture Notes in Computer Science. Springer; 2020:143-167. doi:<a href=\"https://doi.org/10.1007/978-3-030-61362-4\\_8\">10.1007/978-3-030-61362-4\\_8</a>","bibtex":"@inproceedings{Beyer_Wehrheim_2020, series={Lecture Notes in Computer Science}, title={Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework}, volume={12476}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-61362-4\\_8\">10.1007/978-3-030-61362-4\\_8</a>}, booktitle={Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}}, publisher={Springer}, author={Beyer, Dirk and Wehrheim, Heike}, editor={Margaria, Tiziana and Steffen, BernhardEditors}, year={2020}, pages={143–167}, collection={Lecture Notes in Computer Science} }"},"project":[{"name":"Kooperative Softwareverifikation","_id":"85"}],"status":"public","_id":"20276","publisher":"Springer","page":"143-167","volume":12476,"editor":[{"full_name":"Margaria, Tiziana","first_name":"Tiziana","last_name":"Margaria"},{"full_name":"Steffen, Bernhard","last_name":"Steffen","first_name":"Bernhard"}],"user_id":"29719","publication":"Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}","date_created":"2020-11-04T08:36:22Z","department":[{"_id":"77"}],"type":"conference","author":[{"full_name":"Beyer, Dirk","first_name":"Dirk","last_name":"Beyer"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"title":"Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework","year":"2020","intvolume":"     12476","date_updated":"2022-01-06T06:54:25Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-030-61362-4\\_8"},{"citation":{"bibtex":"@book{Wehrheim_Cabot_2020, series={Lecture Notes in Computer Science}, title={Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings}, volume={12076}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-45234-6\">10.1007/978-3-030-45234-6</a>}, publisher={Springer}, year={2020}, collection={Lecture Notes in Computer Science} }","ama":"Wehrheim H, Cabot J, eds. <i>Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings</i>. Vol 12076. Springer; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-45234-6\">10.1007/978-3-030-45234-6</a>","mla":"Wehrheim, Heike, and Jordi Cabot, editors. <i>Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings</i>. Vol. 12076, Springer, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-45234-6\">10.1007/978-3-030-45234-6</a>.","chicago":"Wehrheim, Heike, and Jordi Cabot, eds. <i>Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings</i>. Vol. 12076. Lecture Notes in Computer Science. Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-45234-6\">https://doi.org/10.1007/978-3-030-45234-6</a>.","short":"H. Wehrheim, J. Cabot, eds., Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, Springer, 2020.","ieee":"H. Wehrheim and J. Cabot, Eds., <i>Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings</i>, vol. 12076. Springer, 2020.","apa":"Wehrheim, H., &#38; Cabot, J. (Eds.). (2020). <i>Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings</i> (Vol. 12076). Springer. <a href=\"https://doi.org/10.1007/978-3-030-45234-6\">https://doi.org/10.1007/978-3-030-45234-6</a>"},"type":"conference_editor","department":[{"_id":"77"}],"date_created":"2020-11-04T08:42:19Z","date_updated":"2022-01-06T06:54:25Z","intvolume":"     12076","title":"Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings","status":"public","year":"2020","publication_identifier":{"isbn":["978-3-030-45233-9"]},"doi":"10.1007/978-3-030-45234-6","user_id":"29719","editor":[{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"},{"full_name":"Cabot, Jordi","first_name":"Jordi","last_name":"Cabot"}],"volume":12076,"language":[{"iso":"eng"}],"_id":"20277","publisher":"Springer","series_title":"Lecture Notes in Computer Science"},{"citation":{"ieee":"W. Ahrendt and H. Wehrheim, Eds., <i>Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [postponed]</i>, vol. 12165. Springer, 2020.","mla":"Ahrendt, Wolfgang, and Heike Wehrheim, editors. <i>Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [Postponed]</i>. Vol. 12165, Springer, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-50995-8\">10.1007/978-3-030-50995-8</a>.","apa":"Ahrendt, W., &#38; Wehrheim, H. (Eds.). (2020). <i>Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [postponed]</i> (Vol. 12165). Springer. <a href=\"https://doi.org/10.1007/978-3-030-50995-8\">https://doi.org/10.1007/978-3-030-50995-8</a>","bibtex":"@book{Ahrendt_Wehrheim_2020, series={Lecture Notes in Computer Science}, title={Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [postponed]}, volume={12165}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-50995-8\">10.1007/978-3-030-50995-8</a>}, publisher={Springer}, year={2020}, collection={Lecture Notes in Computer Science} }","chicago":"Ahrendt, Wolfgang, and Heike Wehrheim, eds. <i>Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [Postponed]</i>. Vol. 12165. Lecture Notes in Computer Science. Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-50995-8\">https://doi.org/10.1007/978-3-030-50995-8</a>.","short":"W. Ahrendt, H. Wehrheim, eds., Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [Postponed], Springer, 2020.","ama":"Ahrendt W, Wehrheim H, eds. <i>Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [Postponed]</i>. Vol 12165. Springer; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-50995-8\">10.1007/978-3-030-50995-8</a>"},"type":"conference_editor","department":[{"_id":"77"}],"date_created":"2020-11-04T08:44:33Z","date_updated":"2022-01-06T06:54:25Z","intvolume":"     12165","year":"2020","status":"public","title":"Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [postponed]","publication_identifier":{"isbn":["978-3-030-50994-1"]},"doi":"10.1007/978-3-030-50995-8","user_id":"29719","editor":[{"full_name":"Ahrendt, Wolfgang","first_name":"Wolfgang","last_name":"Ahrendt"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"volume":12165,"_id":"20278","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"publisher":"Springer"},{"citation":{"bibtex":"@article{Sharma_Wehrheim_2020, title={Testing Monotonicity of Machine Learning Models}, volume={abs/2002.12278}, journal={CoRR}, author={Sharma, Arnab and Wehrheim, Heike}, year={2020} }","ama":"Sharma A, Wehrheim H. Testing Monotonicity of Machine Learning Models. <i>CoRR</i>. 2020;abs/2002.12278.","mla":"Sharma, Arnab, and Heike Wehrheim. “Testing Monotonicity of Machine Learning Models.” <i>CoRR</i>, vol. abs/2002.12278, 2020.","chicago":"Sharma, Arnab, and Heike Wehrheim. “Testing Monotonicity of Machine Learning Models.” <i>CoRR</i> abs/2002.12278 (2020).","short":"A. Sharma, H. Wehrheim, CoRR abs/2002.12278 (2020).","ieee":"A. Sharma and H. Wehrheim, “Testing Monotonicity of Machine Learning Models,” <i>CoRR</i>, vol. abs/2002.12278, 2020.","apa":"Sharma, A., &#38; Wehrheim, H. (2020). Testing Monotonicity of Machine Learning Models. <i>CoRR</i>, <i>abs/2002.12278</i>."},"publication":"CoRR","date_created":"2020-11-04T08:48:04Z","department":[{"_id":"77"}],"type":"journal_article","author":[{"full_name":"Sharma, Arnab","last_name":"Sharma","first_name":"Arnab","id":"67200"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"title":"Testing Monotonicity of Machine Learning Models","status":"public","year":"2020","date_updated":"2022-01-06T06:54:25Z","language":[{"iso":"eng"}],"_id":"20279","volume":"abs/2002.12278","user_id":"29719"}]