--- _id: '11793' abstract: - lang: eng text: "We study the problem of maintaining a breadth-first spanning tree (BFS tree) in partially dynamic distributed networks modeling a sequence of either failures or additions of communication links (but not both). We show (1 + ε)-approximation algorithms whose amortized time (over some number of link changes) is sublinear in D, the maximum diameter of the network. This breaks the Θ(D) time bound of recomputing “from scratch”.\r\n\r\nOur technique also leads to a (1 + ε)-approximate incremental algorithm for single-source shortest paths (SSSP) in the sequential (usual RAM) model. Prior to our work, the state of the art was the classic exact algorithm of [9] that is optimal under some assumptions [27]. Our result is the first to show that, in the incremental setting, this bound can be beaten in certain cases if a small approximation is allowed." alternative_title: - LNCS article_processing_charge: No author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Sebastian full_name: Krinninger, Sebastian last_name: Krinninger - first_name: Danupon full_name: Nanongkai, Danupon last_name: Nanongkai citation: ama: 'Henzinger MH, Krinninger S, Nanongkai D. Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks. In: 40th International Colloquium on Automata, Languages, and Programming. Vol 7966. Springer Nature; 2013:607–619. doi:10.1007/978-3-642-39212-2_53' apa: 'Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2013). Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks. In 40th International Colloquium on Automata, Languages, and Programming (Vol. 7966, pp. 607–619). Riga, Latvia: Springer Nature. https://doi.org/10.1007/978-3-642-39212-2_53' chicago: Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks.” In 40th International Colloquium on Automata, Languages, and Programming, 7966:607–619. Springer Nature, 2013. https://doi.org/10.1007/978-3-642-39212-2_53. ieee: M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks,” in 40th International Colloquium on Automata, Languages, and Programming, Riga, Latvia, 2013, vol. 7966, pp. 607–619. ista: 'Henzinger MH, Krinninger S, Nanongkai D. 2013. Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks. 40th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 7966, 607–619.' mla: Henzinger, Monika H., et al. “Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks.” 40th International Colloquium on Automata, Languages, and Programming, vol. 7966, Springer Nature, 2013, pp. 607–619, doi:10.1007/978-3-642-39212-2_53. short: M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 40th International Colloquium on Automata, Languages, and Programming, Springer Nature, 2013, pp. 607–619. conference: end_date: 2013-07-12 location: Riga, Latvia name: 'ICALP: International Colloquium on Automata, Languages, and Programming' start_date: 2013-07-08 date_created: 2022-08-11T11:25:13Z date_published: 2013-07-01T00:00:00Z date_updated: 2023-02-21T16:28:26Z day: '01' doi: 10.1007/978-3-642-39212-2_53 extern: '1' external_id: arxiv: - '1512.08147' intvolume: ' 7966' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1512.08147 month: '07' oa: 1 oa_version: Preprint page: 607–619 publication: 40th International Colloquium on Automata, Languages, and Programming publication_identifier: isbn: - '9783642392115' issn: - 1611-3349 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '11793' relation: later_version status: public scopus_import: '1' status: public title: Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7966 year: '2013' ... --- _id: '11791' abstract: - lang: eng text: The focus of classic mechanism design has been on truthful direct-revelation mechanisms. In the context of combinatorial auctions the truthful direct-revelation mechanism that maximizes social welfare is the VCG mechanism. For many valuation spaces computing the allocation and payments of the VCG mechanism, however, is a computationally hard problem. We thus study the performance of the VCG mechanism when bidders are forced to choose bids from a subspace of the valuation space for which the VCG outcome can be computed efficiently. We prove improved upper bounds on the welfare loss for restrictions to additive bids and upper and lower bounds for restrictions to non-additive bids. These bounds show that the welfare loss increases in expressiveness. All our bounds apply to equilibrium concepts that can be computed in polynomial time as well as to learning outcomes. alternative_title: - LNCS article_processing_charge: No author: - first_name: Paul full_name: Dütting, Paul last_name: Dütting - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Martin full_name: Starnberger, Martin last_name: Starnberger citation: ama: 'Dütting P, Henzinger MH, Starnberger M. Valuation compressions in VCG-based combinatorial auctions. In: 9th International Conference on Web and Internet Economics. Vol 8289. Springer Nature; 2013:146–159. doi:10.1007/978-3-642-45046-4_13' apa: 'Dütting, P., Henzinger, M. H., & Starnberger, M. (2013). Valuation compressions in VCG-based combinatorial auctions. In 9th International Conference on Web and Internet Economics (Vol. 8289, pp. 146–159). Cambridge, MA, USA: Springer Nature. https://doi.org/10.1007/978-3-642-45046-4_13' chicago: Dütting, Paul, Monika H Henzinger, and Martin Starnberger. “Valuation Compressions in VCG-Based Combinatorial Auctions.” In 9th International Conference on Web and Internet Economics, 8289:146–159. Springer Nature, 2013. https://doi.org/10.1007/978-3-642-45046-4_13. ieee: P. Dütting, M. H. Henzinger, and M. Starnberger, “Valuation compressions in VCG-based combinatorial auctions,” in 9th International Conference on Web and Internet Economics, Cambridge, MA, USA, 2013, vol. 8289, pp. 146–159. ista: 'Dütting P, Henzinger MH, Starnberger M. 2013. Valuation compressions in VCG-based combinatorial auctions. 9th International Conference on Web and Internet Economics. WINE: International Conference on Web and Internet Economics, LNCS, vol. 8289, 146–159.' mla: Dütting, Paul, et al. “Valuation Compressions in VCG-Based Combinatorial Auctions.” 9th International Conference on Web and Internet Economics, vol. 8289, Springer Nature, 2013, pp. 146–159, doi:10.1007/978-3-642-45046-4_13. short: P. Dütting, M.H. Henzinger, M. Starnberger, in:, 9th International Conference on Web and Internet Economics, Springer Nature, 2013, pp. 146–159. conference: end_date: 2013-12-14 location: Cambridge, MA, USA name: 'WINE: International Conference on Web and Internet Economics' start_date: 2013-12-01 date_created: 2022-08-11T11:05:14Z date_published: 2013-12-01T00:00:00Z date_updated: 2023-02-13T11:20:42Z day: '01' doi: 10.1007/978-3-642-45046-4_13 extern: '1' external_id: arxiv: - '1310.3153' intvolume: ' 8289' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1310.3153 month: '12' oa: 1 oa_version: Preprint page: 146–159 publication: 9th International Conference on Web and Internet Economics publication_identifier: isbn: - '9783642450457' issn: - 1611-3349 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Valuation compressions in VCG-based combinatorial auctions type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8289 year: '2013' ... --- _id: '11792' abstract: - lang: eng text: "We study the problem of maximizing a monotone submodular function with viability constraints. This problem originates from computational biology, where we are given a phylogenetic tree over a set of species and a directed graph, the so-called food web, encoding viability constraints between these species. These food webs usually have constant depth. The goal is to select a subset of k species that satisfies the viability constraints and has maximal phylogenetic diversity. As this problem is known to be NP-hard, we investigate approximation algorithm. We present the first constant factor approximation algorithm if the depth is constant. Its approximation ratio is (1−1\U0001D452√). This algorithm not only applies to phylogenetic trees with viability constraints but for arbitrary monotone submodular set functions with viability constraints. Second, we show that there is no (1 − 1/e + ε)-approximation algorithm for our problem setting (even for additive functions) and that there is no approximation algorithm for a slight extension of this setting." alternative_title: - LNCS article_processing_charge: No author: - first_name: Wolfgang full_name: Dvořák, Wolfgang last_name: Dvořák - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: David P. full_name: Williamson, David P. last_name: Williamson citation: ama: 'Dvořák W, Henzinger MH, Williamson DP. Maximizing a submodular function with viability constraints. In: 21st Annual European Symposium on Algorithms. Vol 8125. Springer Nature; 2013:409-420. doi:10.1007/978-3-642-40450-4_35' apa: 'Dvořák, W., Henzinger, M. H., & Williamson, D. P. (2013). Maximizing a submodular function with viability constraints. In 21st Annual European Symposium on Algorithms (Vol. 8125, pp. 409–420). Sophia Antipolis, France: Springer Nature. https://doi.org/10.1007/978-3-642-40450-4_35' chicago: Dvořák, Wolfgang, Monika H Henzinger, and David P. Williamson. “Maximizing a Submodular Function with Viability Constraints.” In 21st Annual European Symposium on Algorithms, 8125:409–20. Springer Nature, 2013. https://doi.org/10.1007/978-3-642-40450-4_35. ieee: W. Dvořák, M. H. Henzinger, and D. P. Williamson, “Maximizing a submodular function with viability constraints,” in 21st Annual European Symposium on Algorithms, Sophia Antipolis, France, 2013, vol. 8125, pp. 409–420. ista: 'Dvořák W, Henzinger MH, Williamson DP. 2013. Maximizing a submodular function with viability constraints. 21st Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LNCS, vol. 8125, 409–420.' mla: Dvořák, Wolfgang, et al. “Maximizing a Submodular Function with Viability Constraints.” 21st Annual European Symposium on Algorithms, vol. 8125, Springer Nature, 2013, pp. 409–20, doi:10.1007/978-3-642-40450-4_35. short: W. Dvořák, M.H. Henzinger, D.P. Williamson, in:, 21st Annual European Symposium on Algorithms, Springer Nature, 2013, pp. 409–420. conference: end_date: 2013-09-04 location: Sophia Antipolis, France name: 'ESA: European Symposium on Algorithms' start_date: 2013-09-02 date_created: 2022-08-11T11:18:19Z date_published: 2013-09-01T00:00:00Z date_updated: 2023-02-21T16:28:24Z day: '01' doi: 10.1007/978-3-642-40450-4_35 extern: '1' external_id: arxiv: - '1611.05753' intvolume: ' 8125' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1611.05753 month: '09' oa: 1 oa_version: Preprint page: 409 - 420 publication: 21st Annual European Symposium on Algorithms publication_identifier: isbn: - '9783642404498' issn: - 1611-3349 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '11792' relation: later_version status: public scopus_import: '1' status: public title: Maximizing a submodular function with viability constraints type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8125 year: '2013' ... --- _id: '11856' abstract: - lang: eng text: 'We study dynamic (1 + ϵ)-approximation algorithms for the all-pairs shortest paths problem in unweighted undirected n-node m-edge graphs under edge deletions. The fastest algorithm for this problem is a randomized algorithm with a total update time of Ȏ(mn) and constant query time by Roditty and Zwick (FOCS 2004). The fastest deterministic algorithm is from a 1981 paper by Even and Shiloach (JACM 1981); it has a total update time of O(mn 2 ) and constant query time. We improve these results as follows: (1) We present an algorithm with a total update time of Ȏ(n 5/2 ) and constant query time that has an additive error of two in addition to the 1 + ϵ multiplicative error. This beats the previous Ȏ(mn) time when m = Ω(n 3/2 ). Note that the additive error is unavoidable since, even in the static case, an O(n 3-δ )-time (a so-called truly sub cubic) combinatorial algorithm with 1 + ϵ multiplicative error cannot have an additive error less than 2 - ϵ, unless we make a major breakthrough for Boolean matrix multiplication (Dor, Halperin and Zwick FOCS 1996) and many other long-standing problems (Vassilevska Williams and Williams FOCS 2010). The algorithm can also be turned into a (2 + ϵ)-approximation algorithm (without an additive error) with the same time guarantees, improving the recent (3 + ϵ)-approximation algorithm with Ȏ(n 5/2+O(1√(log n)) ) running time of Bernstein and Roditty (SODA 2011) in terms of both approximation and time guarantees. (2) We present a deterministic algorithm with a total update time of Ȏ(mn) and a query time of O(log log n). The algorithm has a multiplicative error of 1 + ϵ and gives the first improved deterministic algorithm since 1981. It also answers an open question raised by Bernstein in his STOC 2013 paper. In order to achieve our results, we introduce two new techniques: (1) A lazy Even-Shiloach tree algorithm which maintains a bounded-distance shortest-paths tree on a certain type of emulator called locally persevering emulator. (2) A derandomization technique based on moving Even-Shiloach trees as a way to derandomize the standard random set argument. These techniques might be of independent interest.' article_processing_charge: No author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Sebastian full_name: Krinninger, Sebastian last_name: Krinninger - first_name: Danupon full_name: Nanongkai, Danupon last_name: Nanongkai citation: ama: 'Henzinger MH, Krinninger S, Nanongkai D. Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. In: 54th Annual Symposium on Foundations of Computer Science. Institute of Electrical and Electronics Engineers; 2013:538-547. doi:10.1109/focs.2013.64' apa: 'Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2013). Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. In 54th Annual Symposium on Foundations of Computer Science (pp. 538–547). Berkeley, CA, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/focs.2013.64' chicago: 'Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.” In 54th Annual Symposium on Foundations of Computer Science, 538–47. Institute of Electrical and Electronics Engineers, 2013. https://doi.org/10.1109/focs.2013.64.' ieee: 'M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization,” in 54th Annual Symposium on Foundations of Computer Science, Berkeley, CA, United States, 2013, pp. 538–547.' ista: 'Henzinger MH, Krinninger S, Nanongkai D. 2013. Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. 54th Annual Symposium on Foundations of Computer Science. FOCS: Symposium on Foundations of Computer Science, 538–547.' mla: 'Henzinger, Monika H., et al. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.” 54th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2013, pp. 538–47, doi:10.1109/focs.2013.64.' short: M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 54th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2013, pp. 538–547. conference: end_date: 2013-10-29 location: Berkeley, CA, United States name: 'FOCS: Symposium on Foundations of Computer Science' start_date: 2013-10-26 date_created: 2022-08-16T08:22:37Z date_published: 2013-10-01T00:00:00Z date_updated: 2023-02-17T09:56:04Z day: '01' doi: 10.1109/focs.2013.64 extern: '1' external_id: arxiv: - '1308.0776' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1308.0776 month: '10' oa: 1 oa_version: Preprint page: 538-547 publication: 54th Annual Symposium on Foundations of Computer Science publication_identifier: eisbn: - 978-0-7695-5135-7 issn: - 0272-5428 publication_status: published publisher: Institute of Electrical and Electronics Engineers quality_controlled: '1' scopus_import: '1' status: public title: 'Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '11902' abstract: - lang: eng text: "We study the problem of matching bidders to items where each bidder i has general, strictly monotonic utility functions ui,j(pj) expressing his utility of being matched to item j at price pj. For this setting we prove that a bidder optimal outcome always exists, even when the utility functions are non-linear and non-continuous. We give sufficient conditions under\r\nwhich every mechanism that finds a bidder optimal outcome is incentive compatible. We also give a mechanism that finds a bidder optimal outcome if the conditions for incentive compatibility are satisfied. The running time of this mechanism is exponential in the number of items, but polynomial in the number of bidders." article_processing_charge: No article_type: original author: - first_name: Paul full_name: Dütting, Paul last_name: Dütting - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Ingmar full_name: Weber, Ingmar last_name: Weber citation: ama: Dütting P, Henzinger MH, Weber I. Bidder optimal assignments for general utilities. Theoretical Computer Science. 2013;478(3):22-32. doi:10.1016/j.tcs.2013.01.030 apa: Dütting, P., Henzinger, M. H., & Weber, I. (2013). Bidder optimal assignments for general utilities. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2013.01.030 chicago: Dütting, Paul, Monika H Henzinger, and Ingmar Weber. “Bidder Optimal Assignments for General Utilities.” Theoretical Computer Science. Elsevier, 2013. https://doi.org/10.1016/j.tcs.2013.01.030. ieee: P. Dütting, M. H. Henzinger, and I. Weber, “Bidder optimal assignments for general utilities,” Theoretical Computer Science, vol. 478, no. 3. Elsevier, pp. 22–32, 2013. ista: Dütting P, Henzinger MH, Weber I. 2013. Bidder optimal assignments for general utilities. Theoretical Computer Science. 478(3), 22–32. mla: Dütting, Paul, et al. “Bidder Optimal Assignments for General Utilities.” Theoretical Computer Science, vol. 478, no. 3, Elsevier, 2013, pp. 22–32, doi:10.1016/j.tcs.2013.01.030. short: P. Dütting, M.H. Henzinger, I. Weber, Theoretical Computer Science 478 (2013) 22–32. date_created: 2022-08-17T11:11:04Z date_published: 2013-03-25T00:00:00Z date_updated: 2023-02-21T16:28:41Z day: '25' doi: 10.1016/j.tcs.2013.01.030 extern: '1' intvolume: ' 478' issue: '3' language: - iso: eng month: '03' oa_version: None page: 22-32 publication: Theoretical Computer Science publication_identifier: issn: - 0304-3975 publication_status: published publisher: Elsevier quality_controlled: '1' related_material: record: - id: '11799' relation: earlier_version status: public scopus_import: '1' status: public title: Bidder optimal assignments for general utilities type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 478 year: '2013' ... --- _id: '11959' abstract: - lang: eng text: No catalyst required! A highly efficient, catalyst-free process to generate diimide in situ from hydrazine monohydrate and molecular oxygen for the selective reduction of alkenes has been developed. The use of a gas–liquid segmented flow system allowed safe operating conditions and dramatically enhanced this atom-economical reaction, resulting in short processing times. article_processing_charge: No article_type: letter_note author: - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X - first_name: Sabrina Teixeira full_name: Martinez, Sabrina Teixeira last_name: Martinez - first_name: David full_name: Cantillo, David last_name: Cantillo - first_name: C. Oliver full_name: Kappe, C. Oliver last_name: Kappe citation: ama: 'Pieber B, Martinez ST, Cantillo D, Kappe CO. In situ generation of diimide from hydrazine and oxygen: Continuous-flow transfer hydrogenation of olefins. Angewandte Chemie International Edition. 2013;52(39):10241-10244. doi:10.1002/anie.201303528' apa: 'Pieber, B., Martinez, S. T., Cantillo, D., & Kappe, C. O. (2013). In situ generation of diimide from hydrazine and oxygen: Continuous-flow transfer hydrogenation of olefins. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201303528' chicago: 'Pieber, Bartholomäus, Sabrina Teixeira Martinez, David Cantillo, and C. Oliver Kappe. “In Situ Generation of Diimide from Hydrazine and Oxygen: Continuous-Flow Transfer Hydrogenation of Olefins.” Angewandte Chemie International Edition. Wiley, 2013. https://doi.org/10.1002/anie.201303528.' ieee: 'B. Pieber, S. T. Martinez, D. Cantillo, and C. O. Kappe, “In situ generation of diimide from hydrazine and oxygen: Continuous-flow transfer hydrogenation of olefins,” Angewandte Chemie International Edition, vol. 52, no. 39. Wiley, pp. 10241–10244, 2013.' ista: 'Pieber B, Martinez ST, Cantillo D, Kappe CO. 2013. In situ generation of diimide from hydrazine and oxygen: Continuous-flow transfer hydrogenation of olefins. Angewandte Chemie International Edition. 52(39), 10241–10244.' mla: 'Pieber, Bartholomäus, et al. “In Situ Generation of Diimide from Hydrazine and Oxygen: Continuous-Flow Transfer Hydrogenation of Olefins.” Angewandte Chemie International Edition, vol. 52, no. 39, Wiley, 2013, pp. 10241–44, doi:10.1002/anie.201303528.' short: B. Pieber, S.T. Martinez, D. Cantillo, C.O. Kappe, Angewandte Chemie International Edition 52 (2013) 10241–10244. date_created: 2022-08-24T11:01:47Z date_published: 2013-09-23T00:00:00Z date_updated: 2023-02-21T10:09:21Z day: '23' doi: 10.1002/anie.201303528 extern: '1' intvolume: ' 52' issue: '39' language: - iso: eng month: '09' oa_version: None page: 10241-10244 publication: Angewandte Chemie International Edition publication_identifier: eissn: - 1521-3773 issn: - 1433-7851 publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: 'In situ generation of diimide from hydrazine and oxygen: Continuous-flow transfer hydrogenation of olefins' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 52 year: '2013' ... --- _id: '11960' abstract: - lang: eng text: It's not magic! The effects observed in microwave-irradiated chemical transformations can in most cases be rationalized by purely bulk thermal phenomena associated with rapid heating to elevated temperatures. As discussed in this Essay, the existence of so-called nonthermal or specific microwave effects is highly doubtful. article_processing_charge: No article_type: letter_note author: - first_name: C. Oliver full_name: Kappe, C. Oliver last_name: Kappe - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X - first_name: Doris full_name: Dallinger, Doris last_name: Dallinger citation: ama: 'Kappe CO, Pieber B, Dallinger D. Microwave effects in organic synthesis: Myth or reality? Angewandte Chemie International Edition. 2013;52(4):1088-1094. doi:10.1002/anie.201204103' apa: 'Kappe, C. O., Pieber, B., & Dallinger, D. (2013). Microwave effects in organic synthesis: Myth or reality? Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201204103' chicago: 'Kappe, C. Oliver, Bartholomäus Pieber, and Doris Dallinger. “Microwave Effects in Organic Synthesis: Myth or Reality?” Angewandte Chemie International Edition. Wiley, 2013. https://doi.org/10.1002/anie.201204103.' ieee: 'C. O. Kappe, B. Pieber, and D. Dallinger, “Microwave effects in organic synthesis: Myth or reality?,” Angewandte Chemie International Edition, vol. 52, no. 4. Wiley, pp. 1088–1094, 2013.' ista: 'Kappe CO, Pieber B, Dallinger D. 2013. Microwave effects in organic synthesis: Myth or reality? Angewandte Chemie International Edition. 52(4), 1088–1094.' mla: 'Kappe, C. Oliver, et al. “Microwave Effects in Organic Synthesis: Myth or Reality?” Angewandte Chemie International Edition, vol. 52, no. 4, Wiley, 2013, pp. 1088–94, doi:10.1002/anie.201204103.' short: C.O. Kappe, B. Pieber, D. Dallinger, Angewandte Chemie International Edition 52 (2013) 1088–1094. date_created: 2022-08-24T11:05:04Z date_published: 2013-01-21T00:00:00Z date_updated: 2023-02-21T10:09:26Z day: '21' doi: 10.1002/anie.201204103 extern: '1' intvolume: ' 52' issue: '4' language: - iso: eng month: '01' oa_version: None page: 1088-1094 publication: Angewandte Chemie International Edition publication_identifier: eissn: - 1521-3773 issn: - 1433-7851 publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: 'Microwave effects in organic synthesis: Myth or reality?' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 52 year: '2013' ... --- _id: '11973' abstract: - lang: eng text: The use of high-temperature/pressure gas–liquid continuous flow conditions dramatically enhances the iron-catalyzed aerobic oxidation of 2-benzylpyridines to their corresponding ketones. Pressurized air serves as a readily available oxygen source and propylene carbonate as a green solvent in this radically intensified preparation of synthetically valuable 2-aroylpyridines. article_processing_charge: No article_type: letter_note author: - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X - first_name: C. Oliver full_name: Kappe, C. Oliver last_name: Kappe citation: ama: Pieber B, Kappe CO. Direct aerobic oxidation of 2-benzylpyridines in a gas-liquid continuous-flow regime using propylene carbonate as a solvent. Green Chemistry. 2013;15(2):320-324. doi:10.1039/c2gc36896j apa: Pieber, B., & Kappe, C. O. (2013). Direct aerobic oxidation of 2-benzylpyridines in a gas-liquid continuous-flow regime using propylene carbonate as a solvent. Green Chemistry. Royal Society of Chemistry. https://doi.org/10.1039/c2gc36896j chicago: Pieber, Bartholomäus, and C. Oliver Kappe. “Direct Aerobic Oxidation of 2-Benzylpyridines in a Gas-Liquid Continuous-Flow Regime Using Propylene Carbonate as a Solvent.” Green Chemistry. Royal Society of Chemistry, 2013. https://doi.org/10.1039/c2gc36896j. ieee: B. Pieber and C. O. Kappe, “Direct aerobic oxidation of 2-benzylpyridines in a gas-liquid continuous-flow regime using propylene carbonate as a solvent,” Green Chemistry, vol. 15, no. 2. Royal Society of Chemistry, pp. 320–324, 2013. ista: Pieber B, Kappe CO. 2013. Direct aerobic oxidation of 2-benzylpyridines in a gas-liquid continuous-flow regime using propylene carbonate as a solvent. Green Chemistry. 15(2), 320–324. mla: Pieber, Bartholomäus, and C. Oliver Kappe. “Direct Aerobic Oxidation of 2-Benzylpyridines in a Gas-Liquid Continuous-Flow Regime Using Propylene Carbonate as a Solvent.” Green Chemistry, vol. 15, no. 2, Royal Society of Chemistry, 2013, pp. 320–24, doi:10.1039/c2gc36896j. short: B. Pieber, C.O. Kappe, Green Chemistry 15 (2013) 320–324. date_created: 2022-08-25T10:29:21Z date_published: 2013-02-01T00:00:00Z date_updated: 2023-02-21T10:09:54Z day: '01' doi: 10.1039/c2gc36896j extern: '1' intvolume: ' 15' issue: '2' language: - iso: eng month: '02' oa_version: None page: 320-324 publication: Green Chemistry publication_identifier: eissn: - 1463-9270 issn: - 1463-9262 publication_status: published publisher: Royal Society of Chemistry quality_controlled: '1' scopus_import: '1' status: public title: Direct aerobic oxidation of 2-benzylpyridines in a gas-liquid continuous-flow regime using propylene carbonate as a solvent type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2013' ... --- _id: '12642' abstract: - lang: eng text: Near-surface air temperature, typically measured at a height of 2 m, is the most important control on the energy exchange and the melt rate at a snow or ice surface. It is distributed in a simplistic manner in most glacier melt models by using constant linear lapse rates, which poorly represent the actual spatial and temporal variability of air temperature. In this paper, we test a simple thermodynamic model proposed by Greuell and Böhm in 1998 as an alternative, using a new dataset of air temperature measurements from along the flowline of Haut Glacier d’Arolla, Switzerland. The unmodified model performs little better than assuming a constant linear lapse rate. When modified to allow the ratio of the boundary layer height to the bulk heat transfer coefficient to vary along the flowline, the model matches measured air temperatures better, and a further reduction of the root-mean-square error is obtained, although there is still considerable scope for improvement. The modified model is shown to perform best under conditions favourable to the development of katabatic winds – few clouds, positive ambient air temperature, limited influence of synoptic or valley winds and a long fetch – but its performance is poor under cloudy conditions. article_processing_charge: No article_type: original author: - first_name: Lene full_name: Petersen, Lene last_name: Petersen - first_name: Francesca full_name: Pellicciotti, Francesca id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70 last_name: Pellicciotti - first_name: Inge full_name: Juszak, Inge last_name: Juszak - first_name: Marco full_name: Carenzo, Marco last_name: Carenzo - first_name: Ben full_name: Brock, Ben last_name: Brock citation: ama: 'Petersen L, Pellicciotti F, Juszak I, Carenzo M, Brock B. Suitability of a constant air temperature lapse rate over an Alpine glacier: Testing the Greuell and Böhm model as an alternative. Annals of Glaciology. 2013;54(63):120-130. doi:10.3189/2013aog63a477' apa: 'Petersen, L., Pellicciotti, F., Juszak, I., Carenzo, M., & Brock, B. (2013). Suitability of a constant air temperature lapse rate over an Alpine glacier: Testing the Greuell and Böhm model as an alternative. Annals of Glaciology. International Glaciological Society. https://doi.org/10.3189/2013aog63a477' chicago: 'Petersen, Lene, Francesca Pellicciotti, Inge Juszak, Marco Carenzo, and Ben Brock. “Suitability of a Constant Air Temperature Lapse Rate over an Alpine Glacier: Testing the Greuell and Böhm Model as an Alternative.” Annals of Glaciology. International Glaciological Society, 2013. https://doi.org/10.3189/2013aog63a477.' ieee: 'L. Petersen, F. Pellicciotti, I. Juszak, M. Carenzo, and B. Brock, “Suitability of a constant air temperature lapse rate over an Alpine glacier: Testing the Greuell and Böhm model as an alternative,” Annals of Glaciology, vol. 54, no. 63. International Glaciological Society, pp. 120–130, 2013.' ista: 'Petersen L, Pellicciotti F, Juszak I, Carenzo M, Brock B. 2013. Suitability of a constant air temperature lapse rate over an Alpine glacier: Testing the Greuell and Böhm model as an alternative. Annals of Glaciology. 54(63), 120–130.' mla: 'Petersen, Lene, et al. “Suitability of a Constant Air Temperature Lapse Rate over an Alpine Glacier: Testing the Greuell and Böhm Model as an Alternative.” Annals of Glaciology, vol. 54, no. 63, International Glaciological Society, 2013, pp. 120–30, doi:10.3189/2013aog63a477.' short: L. Petersen, F. Pellicciotti, I. Juszak, M. Carenzo, B. Brock, Annals of Glaciology 54 (2013) 120–130. date_created: 2023-02-20T08:17:29Z date_published: 2013-08-01T00:00:00Z date_updated: 2023-02-21T10:18:24Z day: '01' doi: 10.3189/2013aog63a477 extern: '1' intvolume: ' 54' issue: '63' keyword: - Earth-Surface Processes language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.3189/2013aog63a477 month: '08' oa: 1 oa_version: Published Version page: 120-130 publication: Annals of Glaciology publication_identifier: eissn: - 1727-5644 issn: - 0260-3055 publication_status: published publisher: International Glaciological Society quality_controlled: '1' scopus_import: '1' status: public title: 'Suitability of a constant air temperature lapse rate over an Alpine glacier: Testing the Greuell and Böhm model as an alternative' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 54 year: '2013' ... --- _id: '12643' abstract: - lang: eng text: Parameterizations of incoming longwave radiation are increasingly receiving attention for both low and high elevation glacierized sites. In this paper, we test 13 clear-sky parameterizations combined with seven cloud corrections for all-sky atmospheric emissivity at one location on Haut Glacier d'Arolla. We also analyze the four seasons separately and conduct a cross-validation to test the parameters’ robustness. The best parameterization is the one by Dilley and O'Brien, B for clear-sky conditions combined with Unsworth and Monteith cloud correction. This model is also the most robust when tested in cross-validation. When validated at different sites in the southern Alps of Switzerland and north-western Italian Alps, all parameterizations show a substantial decrease in performance, except for one site, thus suggesting that it is important to recalibrate parameterizations of incoming longwave radiation for different locations. We argue that this is due to differences in the structure of the atmosphere at the sites. We also quantify the effect that the incoming longwave radiation parameterizations have on energy-balance melt modeling, and show that recalibration of model parameters is needed. Using parameters from other sites leads to a significant underestimation of melt and to an error that is larger than that associated with using different parameterizations. Once recalibrated, however, the parameters of most models seem to be stable over seasons and years at the location on Haut Glacier d'Arolla. article_processing_charge: No article_type: original author: - first_name: I. full_name: Juszak, I. last_name: Juszak - first_name: Francesca full_name: Pellicciotti, Francesca id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70 last_name: Pellicciotti citation: ama: 'Juszak I, Pellicciotti F. A comparison of parameterizations of incoming longwave radiation over melting glaciers: Model robustness and seasonal variability. Journal of Geophysical Research: Atmospheres. 2013;118(8):3066-3084. doi:10.1002/jgrd.50277' apa: 'Juszak, I., & Pellicciotti, F. (2013). A comparison of parameterizations of incoming longwave radiation over melting glaciers: Model robustness and seasonal variability. Journal of Geophysical Research: Atmospheres. American Geophysical Union. https://doi.org/10.1002/jgrd.50277' chicago: 'Juszak, I., and Francesca Pellicciotti. “A Comparison of Parameterizations of Incoming Longwave Radiation over Melting Glaciers: Model Robustness and Seasonal Variability.” Journal of Geophysical Research: Atmospheres. American Geophysical Union, 2013. https://doi.org/10.1002/jgrd.50277.' ieee: 'I. Juszak and F. Pellicciotti, “A comparison of parameterizations of incoming longwave radiation over melting glaciers: Model robustness and seasonal variability,” Journal of Geophysical Research: Atmospheres, vol. 118, no. 8. American Geophysical Union, pp. 3066–3084, 2013.' ista: 'Juszak I, Pellicciotti F. 2013. A comparison of parameterizations of incoming longwave radiation over melting glaciers: Model robustness and seasonal variability. Journal of Geophysical Research: Atmospheres. 118(8), 3066–3084.' mla: 'Juszak, I., and Francesca Pellicciotti. “A Comparison of Parameterizations of Incoming Longwave Radiation over Melting Glaciers: Model Robustness and Seasonal Variability.” Journal of Geophysical Research: Atmospheres, vol. 118, no. 8, American Geophysical Union, 2013, pp. 3066–84, doi:10.1002/jgrd.50277.' short: 'I. Juszak, F. Pellicciotti, Journal of Geophysical Research: Atmospheres 118 (2013) 3066–3084.' date_created: 2023-02-20T08:17:34Z date_published: 2013-04-27T00:00:00Z date_updated: 2023-02-21T10:10:46Z day: '27' doi: 10.1002/jgrd.50277 extern: '1' intvolume: ' 118' issue: '8' keyword: - Space and Planetary Science - Earth and Planetary Sciences (miscellaneous) - Atmospheric Science - Geophysics language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1002/jgrd.50277 month: '04' oa: 1 oa_version: Published Version page: 3066-3084 publication: 'Journal of Geophysical Research: Atmospheres' publication_identifier: issn: - 2169-897X publication_status: published publisher: American Geophysical Union quality_controlled: '1' scopus_import: '1' status: public title: 'A comparison of parameterizations of incoming longwave radiation over melting glaciers: Model robustness and seasonal variability' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 118 year: '2013' ... --- _id: '12640' abstract: - lang: eng text: Greater Himalayan glaciers are retreating and losing mass at rates comparable to glaciers in other regions of the world1,2,3,4,5. Assessments of future changes and their associated hydrological impacts are scarce, oversimplify glacier dynamics or include a limited number of climate models6,7,8,9. Here, we use results from the latest ensemble of climate models in combination with a high-resolution glacio-hydrological model to assess the hydrological impact of climate change on two climatically contrasting watersheds in the Greater Himalaya, the Baltoro and Langtang watersheds that drain into the Indus and Ganges rivers, respectively. We show that the largest uncertainty in future runoff is a result of variations in projected precipitation between climate models. In both watersheds, strong, but highly variable, increases in future runoff are projected and, despite the different characteristics of the watersheds, their responses are surprisingly similar. In both cases, glaciers will recede but net glacier melt runoff is on a rising limb at least until 2050. In combination with a positive change in precipitation, water availability during this century is not likely to decline. We conclude that river basins that depend on monsoon rains and glacier melt will continue to sustain the increasing water demands expected in these areas10. article_processing_charge: No article_type: letter_note author: - first_name: W. W. full_name: Immerzeel, W. W. last_name: Immerzeel - first_name: Francesca full_name: Pellicciotti, Francesca id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70 last_name: Pellicciotti - first_name: M. F. P. full_name: Bierkens, M. F. P. last_name: Bierkens citation: ama: Immerzeel WW, Pellicciotti F, Bierkens MFP. Rising river flows throughout the twenty-first century in two Himalayan glacierized watersheds. Nature Geoscience. 2013;6(9):742-745. doi:10.1038/ngeo1896 apa: Immerzeel, W. W., Pellicciotti, F., & Bierkens, M. F. P. (2013). Rising river flows throughout the twenty-first century in two Himalayan glacierized watersheds. Nature Geoscience. Springer Nature. https://doi.org/10.1038/ngeo1896 chicago: Immerzeel, W. W., Francesca Pellicciotti, and M. F. P. Bierkens. “Rising River Flows throughout the Twenty-First Century in Two Himalayan Glacierized Watersheds.” Nature Geoscience. Springer Nature, 2013. https://doi.org/10.1038/ngeo1896. ieee: W. W. Immerzeel, F. Pellicciotti, and M. F. P. Bierkens, “Rising river flows throughout the twenty-first century in two Himalayan glacierized watersheds,” Nature Geoscience, vol. 6, no. 9. Springer Nature, pp. 742–745, 2013. ista: Immerzeel WW, Pellicciotti F, Bierkens MFP. 2013. Rising river flows throughout the twenty-first century in two Himalayan glacierized watersheds. Nature Geoscience. 6(9), 742–745. mla: Immerzeel, W. W., et al. “Rising River Flows throughout the Twenty-First Century in Two Himalayan Glacierized Watersheds.” Nature Geoscience, vol. 6, no. 9, Springer Nature, 2013, pp. 742–45, doi:10.1038/ngeo1896. short: W.W. Immerzeel, F. Pellicciotti, M.F.P. Bierkens, Nature Geoscience 6 (2013) 742–745. date_created: 2023-02-20T08:17:17Z date_published: 2013-09-13T00:00:00Z date_updated: 2023-02-21T10:46:37Z day: '13' doi: 10.1038/ngeo1896 extern: '1' intvolume: ' 6' issue: '9' keyword: - General Earth and Planetary Sciences language: - iso: eng month: '09' oa_version: None page: 742-745 publication: Nature Geoscience publication_identifier: eissn: - 1752-0908 issn: - 1752-0894 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Rising river flows throughout the twenty-first century in two Himalayan glacierized watersheds type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6 year: '2013' ... --- _id: '12641' abstract: - lang: eng text: We investigate the sensitivity of a distributed enhanced temperature-index (ETI) melt model, in order to understand which parameters have the largest influence on model outputs and thus need to be accurately known. We use melt and meteorological data from two Alpine glaciers and one glacier in the Andes of Chile. Sensitivity analysis is conducted in a systematic way in terms of parameters and the different conditions (day, night, clear-sky, overcast), melt seasons and glaciers examined. The sensitivity of total melt to changes in individual parameters is calculated using a local method around the optimal value of the parameters. We verify that the parameters are optimal at the distributed scale and assess the model uncertainty induced by uncertainty in the parameters using a Monte Carlo technique. Model sensitivity to parameters is consistent across melt seasons, glaciers, different conditions and the daily statistics examined. The parameters to which the model is most sensitive are the shortwave-radiation factor, the temperature lapse rate for extrapolation of air temperature, the albedo parameters, the temperature threshold and the cloud transmittance factor parameters. A parameter uncertainty of 5% results in a model uncertainty of 5.6% of mean melt on Haut Glacier d’Arolla, Switzerland. article_processing_charge: No article_type: original author: - first_name: Martin full_name: Heynen, Martin last_name: Heynen - first_name: Francesca full_name: Pellicciotti, Francesca id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70 last_name: Pellicciotti - first_name: Marco full_name: Carenzo, Marco last_name: Carenzo citation: ama: Heynen M, Pellicciotti F, Carenzo M. Parameter sensitivity of a distributed enhanced temperature-index melt model. Annals of Glaciology. 2013;54(63):311-321. doi:10.3189/2013aog63a537 apa: Heynen, M., Pellicciotti, F., & Carenzo, M. (2013). Parameter sensitivity of a distributed enhanced temperature-index melt model. Annals of Glaciology. International Glaciological Society. https://doi.org/10.3189/2013aog63a537 chicago: Heynen, Martin, Francesca Pellicciotti, and Marco Carenzo. “Parameter Sensitivity of a Distributed Enhanced Temperature-Index Melt Model.” Annals of Glaciology. International Glaciological Society, 2013. https://doi.org/10.3189/2013aog63a537. ieee: M. Heynen, F. Pellicciotti, and M. Carenzo, “Parameter sensitivity of a distributed enhanced temperature-index melt model,” Annals of Glaciology, vol. 54, no. 63. International Glaciological Society, pp. 311–321, 2013. ista: Heynen M, Pellicciotti F, Carenzo M. 2013. Parameter sensitivity of a distributed enhanced temperature-index melt model. Annals of Glaciology. 54(63), 311–321. mla: Heynen, Martin, et al. “Parameter Sensitivity of a Distributed Enhanced Temperature-Index Melt Model.” Annals of Glaciology, vol. 54, no. 63, International Glaciological Society, 2013, pp. 311–21, doi:10.3189/2013aog63a537. short: M. Heynen, F. Pellicciotti, M. Carenzo, Annals of Glaciology 54 (2013) 311–321. date_created: 2023-02-20T08:17:21Z date_published: 2013-08-01T00:00:00Z date_updated: 2023-02-21T10:43:42Z day: '01' doi: 10.3189/2013aog63a537 extern: '1' intvolume: ' 54' issue: '63' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.3189/2013aog63a537 month: '08' oa: 1 oa_version: Published Version page: 311-321 publication: Annals of Glaciology publication_identifier: eissn: - 1727-5644 issn: - 0260-3055 publication_status: published publisher: International Glaciological Society quality_controlled: '1' scopus_import: '1' status: public title: Parameter sensitivity of a distributed enhanced temperature-index melt model type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 54 year: '2013' ... --- _id: '1304' abstract: - lang: eng text: When confronted with a large-field stimulus rotating around the vertical body axis, flies display a following behavior called "optomotor response." As neural control elements, the large tangential horizontal system (HS) cells of the lobula plate have been prime candidates for long. Here, we applied optogenetic stimulation of HS cells to evaluate their behavioral role in Drosophila. To minimize interference of the optical activation of channelrhodopsin-2 with the visual perception of the flies, we used a bistable variant called ChR2-C128S. By applying pulses of blue and yellow light, we first demonstrate electrophysiologically that lobula plate tangential cells can be activated and deactivated repeatedly with no evident change in depolarization strength over trials. We next show that selective optogenetic activation of HS cells elicits robust yaw head movements and yaw turning responses in fixed and tethered flying flies, respectively. acknowledgement: 'This work was supported by the Max Planck Society. ' author: - first_name: Väinö full_name: Haikala, Väinö last_name: Haikala - first_name: Maximilian A full_name: Maximilian Jösch id: 2BD278E6-F248-11E8-B48F-1D18A9856A87 last_name: Jösch orcid: 0000-0002-3937-1330 - first_name: Alexander full_name: Borst, Alexander last_name: Borst - first_name: Alex full_name: Mauss, Alex S last_name: Mauss citation: ama: Haikala V, Jösch MA, Borst A, Mauss A. Optogenetic control of fly optomotor responses. Journal of Neuroscience. 2013;33(34):13927-13934. doi:10.1523/JNEUROSCI.0340-13.2013 apa: Haikala, V., Jösch, M. A., Borst, A., & Mauss, A. (2013). Optogenetic control of fly optomotor responses. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.0340-13.2013 chicago: Haikala, Väinö, Maximilian A Jösch, Alexander Borst, and Alex Mauss. “Optogenetic Control of Fly Optomotor Responses.” Journal of Neuroscience. Society for Neuroscience, 2013. https://doi.org/10.1523/JNEUROSCI.0340-13.2013. ieee: V. Haikala, M. A. Jösch, A. Borst, and A. Mauss, “Optogenetic control of fly optomotor responses,” Journal of Neuroscience, vol. 33, no. 34. Society for Neuroscience, pp. 13927–13934, 2013. ista: Haikala V, Jösch MA, Borst A, Mauss A. 2013. Optogenetic control of fly optomotor responses. Journal of Neuroscience. 33(34), 13927–13934. mla: Haikala, Väinö, et al. “Optogenetic Control of Fly Optomotor Responses.” Journal of Neuroscience, vol. 33, no. 34, Society for Neuroscience, 2013, pp. 13927–34, doi:10.1523/JNEUROSCI.0340-13.2013. short: V. Haikala, M.A. Jösch, A. Borst, A. Mauss, Journal of Neuroscience 33 (2013) 13927–13934. date_created: 2018-12-11T11:51:16Z date_published: 2013-01-01T00:00:00Z date_updated: 2021-01-12T06:49:45Z day: '01' doi: 10.1523/JNEUROSCI.0340-13.2013 extern: 1 intvolume: ' 33' issue: '34' month: '01' page: 13927 - 13934 publication: Journal of Neuroscience publication_status: published publisher: Society for Neuroscience publist_id: '5967' quality_controlled: 0 status: public title: Optogenetic control of fly optomotor responses type: journal_article volume: 33 year: '2013' ... --- _id: '1305' abstract: - lang: eng text: In the fly Drosophila melanogaster, photoreceptor input to motion vision is split into two parallel pathways as represented by first-order interneurons L1 and L2 (Rister et al., 2007; Joesch et al., 2010). However, how these pathways are functionally specialized remains controversial. One study (Eichner et al., 2011) proposed that the L1-pathway evaluates only sequences of brightness increments (ON-ON), while the L2-pathway processes exclusively brightness decrements (OFF-OFF). Another study (Clark et al., 2011) proposed that each of the two pathways evaluates both ON-ON and OFF-OFF sequences. To decide between these alternatives, we recorded from motionsensitive neurons in flies in which the output from either L1 or L2 was genetically blocked. We found that blocking L1 abolishes ON-ON responses but leaves OFF-OFF responses intact. The opposite was true, when the output from L2 was blocked. We conclude that the L1 and L2 pathways are functionally specialized to detect ON-ON and OFF-OFF sequences, respectively. acknowledgement: This work was supported by the Max-Planck-Society and the SFB 870 of the Deutsche Forschungsgemeinschaft. author: - first_name: Maximilian A full_name: Maximilian Jösch id: 2BD278E6-F248-11E8-B48F-1D18A9856A87 last_name: Jösch orcid: 0000-0002-3937-1330 - first_name: Franz full_name: Weber, Franz last_name: Weber - first_name: Hubert full_name: Eichner, Hubert last_name: Eichner - first_name: Alexander full_name: Borst, Alexander last_name: Borst citation: ama: Jösch MA, Weber F, Eichner H, Borst A. Functional specialization of parallel motion detection circuits in the fly. Journal of Neuroscience. 2013;33(3):902-905. doi:10.1523/JNEUROSCI.3374-12.2013 apa: Jösch, M. A., Weber, F., Eichner, H., & Borst, A. (2013). Functional specialization of parallel motion detection circuits in the fly. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.3374-12.2013 chicago: Jösch, Maximilian A, Franz Weber, Hubert Eichner, and Alexander Borst. “Functional Specialization of Parallel Motion Detection Circuits in the Fly.” Journal of Neuroscience. Society for Neuroscience, 2013. https://doi.org/10.1523/JNEUROSCI.3374-12.2013. ieee: M. A. Jösch, F. Weber, H. Eichner, and A. Borst, “Functional specialization of parallel motion detection circuits in the fly,” Journal of Neuroscience, vol. 33, no. 3. Society for Neuroscience, pp. 902–905, 2013. ista: Jösch MA, Weber F, Eichner H, Borst A. 2013. Functional specialization of parallel motion detection circuits in the fly. Journal of Neuroscience. 33(3), 902–905. mla: Jösch, Maximilian A., et al. “Functional Specialization of Parallel Motion Detection Circuits in the Fly.” Journal of Neuroscience, vol. 33, no. 3, Society for Neuroscience, 2013, pp. 902–05, doi:10.1523/JNEUROSCI.3374-12.2013. short: M.A. Jösch, F. Weber, H. Eichner, A. Borst, Journal of Neuroscience 33 (2013) 902–905. date_created: 2018-12-11T11:51:16Z date_published: 2013-01-16T00:00:00Z date_updated: 2021-01-12T06:49:45Z day: '16' doi: 10.1523/JNEUROSCI.3374-12.2013 extern: 1 intvolume: ' 33' issue: '3' month: '01' page: 902 - 905 publication: Journal of Neuroscience publication_status: published publisher: Society for Neuroscience publist_id: '5968' quality_controlled: 0 status: public title: Functional specialization of parallel motion detection circuits in the fly type: journal_article volume: 33 year: '2013' ... --- _id: '1308' abstract: - lang: eng text: We derive sufficient conditions for advection-driven backward motion of the free boundary in a chemotaxis model with degenerate mobility. In this model, a porous-medium-type diffusive term and an advection term are in competition. The former induces forward motion, the latter may induce backward motion of the free boundary depending on the direction of advection. We deduce conditions on the growth of the initial data at the free boundary which ensure that at least initially the advection term is dominant. This implies local backward motion of the free boundary provided the advection is (locally) directed appropriately. Our result is based on a new class of moving test functions and Stampacchia's lemma. As a by-product of our estimates, we obtain quantitative bounds on the spreading of the support of solutions for the chemotaxis model and provide a proof for the finite speed of the support propagation property of solutions. author: - first_name: Julian L full_name: Julian Fischer id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87 last_name: Fischer orcid: 0000-0002-0479-558X citation: ama: Fischer JL. Advection-driven support shrinking in a chemotaxis model with degenerate mobility. SIAM Journal on Mathematical Analysis. 2013;45(3):1585-1615. doi:10.1137/120874291 apa: Fischer, J. L. (2013). Advection-driven support shrinking in a chemotaxis model with degenerate mobility. SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/120874291 chicago: Fischer, Julian L. “Advection-Driven Support Shrinking in a Chemotaxis Model with Degenerate Mobility.” SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics , 2013. https://doi.org/10.1137/120874291. ieee: J. L. Fischer, “Advection-driven support shrinking in a chemotaxis model with degenerate mobility,” SIAM Journal on Mathematical Analysis, vol. 45, no. 3. Society for Industrial and Applied Mathematics , pp. 1585–1615, 2013. ista: Fischer JL. 2013. Advection-driven support shrinking in a chemotaxis model with degenerate mobility. SIAM Journal on Mathematical Analysis. 45(3), 1585–1615. mla: Fischer, Julian L. “Advection-Driven Support Shrinking in a Chemotaxis Model with Degenerate Mobility.” SIAM Journal on Mathematical Analysis, vol. 45, no. 3, Society for Industrial and Applied Mathematics , 2013, pp. 1585–615, doi:10.1137/120874291. short: J.L. Fischer, SIAM Journal on Mathematical Analysis 45 (2013) 1585–1615. date_created: 2018-12-11T11:51:17Z date_published: 2013-01-01T00:00:00Z date_updated: 2021-01-12T06:49:46Z day: '01' doi: 10.1137/120874291 extern: 1 intvolume: ' 45' issue: '3' month: '01' page: 1585 - 1615 publication: SIAM Journal on Mathematical Analysis publication_status: published publisher: 'Society for Industrial and Applied Mathematics ' publist_id: '5963' quality_controlled: 0 status: public title: Advection-driven support shrinking in a chemotaxis model with degenerate mobility type: journal_article volume: 45 year: '2013' ... --- _id: '1307' abstract: - lang: eng text: We prove uniqueness of solutions of the DLSS equation in a class of sufficiently regular functions. The global weak solutions of the DLSS equation constructed by Jüngel and Matthes belong to this class of uniqueness. We also show uniqueness of solutions for the quantum drift-diffusion equation, which contains additional drift and second-order diffusion terms. The results hold in case of periodic or Dirichlet-Neumann boundary conditions. Our proof is based on a monotonicity property of the DLSS operator and sophisticated approximation arguments; we derive a PDE satisfied by the pointwise square root of the solution, which enables us to exploit the monotonicity property of the operator. author: - first_name: Julian L full_name: Julian Fischer id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87 last_name: Fischer orcid: 0000-0002-0479-558X citation: ama: Fischer JL. Uniqueness of solutions of the Derrida-Lebowitz-Speer-Spohn equation and quantum drift diffusion models. Communications in Partial Differential Equations. 2013;38(11):2004-2047. doi:10.1080/03605302.2013.823548 apa: Fischer, J. L. (2013). Uniqueness of solutions of the Derrida-Lebowitz-Speer-Spohn equation and quantum drift diffusion models. Communications in Partial Differential Equations. Taylor & Francis. https://doi.org/10.1080/03605302.2013.823548 chicago: Fischer, Julian L. “Uniqueness of Solutions of the Derrida-Lebowitz-Speer-Spohn Equation and Quantum Drift Diffusion Models.” Communications in Partial Differential Equations. Taylor & Francis, 2013. https://doi.org/10.1080/03605302.2013.823548. ieee: J. L. Fischer, “Uniqueness of solutions of the Derrida-Lebowitz-Speer-Spohn equation and quantum drift diffusion models,” Communications in Partial Differential Equations, vol. 38, no. 11. Taylor & Francis, pp. 2004–2047, 2013. ista: Fischer JL. 2013. Uniqueness of solutions of the Derrida-Lebowitz-Speer-Spohn equation and quantum drift diffusion models. Communications in Partial Differential Equations. 38(11), 2004–2047. mla: Fischer, Julian L. “Uniqueness of Solutions of the Derrida-Lebowitz-Speer-Spohn Equation and Quantum Drift Diffusion Models.” Communications in Partial Differential Equations, vol. 38, no. 11, Taylor & Francis, 2013, pp. 2004–47, doi:10.1080/03605302.2013.823548. short: J.L. Fischer, Communications in Partial Differential Equations 38 (2013) 2004–2047. date_created: 2018-12-11T11:51:17Z date_published: 2013-11-01T00:00:00Z date_updated: 2021-01-12T06:49:46Z day: '01' doi: 10.1080/03605302.2013.823548 extern: 1 intvolume: ' 38' issue: '11' month: '11' page: 2004 - 2047 publication: Communications in Partial Differential Equations publication_status: published publisher: Taylor & Francis publist_id: '5962' quality_controlled: 0 status: public title: Uniqueness of solutions of the Derrida-Lebowitz-Speer-Spohn equation and quantum drift diffusion models type: journal_article volume: 38 year: '2013' ... --- _id: '1310' abstract: - lang: eng text: We derive lower bounds on asymptotic support propagation rates for strong solutions of the Cauchy problem for the thin-film equation. The bounds coincide up to a constant factor with the previously known upper bounds and thus are sharp. Our results hold in case of at most three spatial dimensions and n∈. (1, 2.92). The result is established using weighted backward entropy inequalities with singular weight functions to yield a differential inequality; combined with some entropy production estimates, the optimal rate of propagation is obtained. To the best of our knowledge, these are the first lower bounds on asymptotic support propagation rates for higher-order nonnegativity-preserving parabolic equations. author: - first_name: Julian L full_name: Julian Fischer id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87 last_name: Fischer orcid: 0000-0002-0479-558X citation: ama: Fischer JL. Optimal lower bounds on asymptotic support propagation rates for the thin-film equation. Journal of Differential Equations. 2013;255(10):3127-3149. doi:10.1016/j.jde.2013.07.028 apa: Fischer, J. L. (2013). Optimal lower bounds on asymptotic support propagation rates for the thin-film equation. Journal of Differential Equations. Academic Press. https://doi.org/10.1016/j.jde.2013.07.028 chicago: Fischer, Julian L. “Optimal Lower Bounds on Asymptotic Support Propagation Rates for the Thin-Film Equation.” Journal of Differential Equations. Academic Press, 2013. https://doi.org/10.1016/j.jde.2013.07.028. ieee: J. L. Fischer, “Optimal lower bounds on asymptotic support propagation rates for the thin-film equation,” Journal of Differential Equations, vol. 255, no. 10. Academic Press, pp. 3127–3149, 2013. ista: Fischer JL. 2013. Optimal lower bounds on asymptotic support propagation rates for the thin-film equation. Journal of Differential Equations. 255(10), 3127–3149. mla: Fischer, Julian L. “Optimal Lower Bounds on Asymptotic Support Propagation Rates for the Thin-Film Equation.” Journal of Differential Equations, vol. 255, no. 10, Academic Press, 2013, pp. 3127–49, doi:10.1016/j.jde.2013.07.028. short: J.L. Fischer, Journal of Differential Equations 255 (2013) 3127–3149. date_created: 2018-12-11T11:51:18Z date_published: 2013-11-15T00:00:00Z date_updated: 2021-01-12T06:49:47Z day: '15' doi: 10.1016/j.jde.2013.07.028 extern: 1 intvolume: ' 255' issue: '10' month: '11' page: 3127 - 3149 publication: Journal of Differential Equations publication_status: published publisher: Academic Press publist_id: '5961' quality_controlled: 0 status: public title: Optimal lower bounds on asymptotic support propagation rates for the thin-film equation type: journal_article volume: 255 year: '2013' ... --- _id: '1374' abstract: - lang: eng text: 'We study two-player zero-sum games over infinite-state graphs equipped with ωB and finitary conditions. Our first contribution is about the strategy complexity, i.e the memory required for winning strategies: we prove that over general infinite-state graphs, memoryless strategies are sufficient for finitary Büchi, and finite-memory suffices for finitary parity games. We then study pushdown games with boundedness conditions, with two contributions. First we prove a collapse result for pushdown games with ωB-conditions, implying the decidability of solving these games. Second we consider pushdown games with finitary parity along with stack boundedness conditions, and show that solving these games is EXPTIME-complete.' alternative_title: - LIPIcs author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Nathanaël full_name: Fijalkow, Nathanaël last_name: Fijalkow citation: ama: 'Chatterjee K, Fijalkow N. Infinite-state games with finitary conditions. In: 22nd EACSL Annual Conference on Computer Science Logic. Vol 23. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2013:181-196. doi:10.4230/LIPIcs.CSL.2013.181' apa: 'Chatterjee, K., & Fijalkow, N. (2013). Infinite-state games with finitary conditions. In 22nd EACSL Annual Conference on Computer Science Logic (Vol. 23, pp. 181–196). Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.181' chicago: Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” In 22nd EACSL Annual Conference on Computer Science Logic, 23:181–96. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.4230/LIPIcs.CSL.2013.181. ieee: K. Chatterjee and N. Fijalkow, “Infinite-state games with finitary conditions,” in 22nd EACSL Annual Conference on Computer Science Logic, Torino, Italy, 2013, vol. 23, pp. 181–196. ista: 'Chatterjee K, Fijalkow N. 2013. Infinite-state games with finitary conditions. 22nd EACSL Annual Conference on Computer Science Logic. CSL: Computer Science LogicLeibniz International Proceedings in Informatics, LIPIcs, vol. 23, 181–196.' mla: Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” 22nd EACSL Annual Conference on Computer Science Logic, vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–96, doi:10.4230/LIPIcs.CSL.2013.181. short: K. Chatterjee, N. Fijalkow, in:, 22nd EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–196. conference: end_date: 2013-09-05 location: Torino, Italy name: 'CSL: Computer Science Logic' start_date: 203-09-02 date_created: 2018-12-11T11:51:39Z date_published: 2013-09-01T00:00:00Z date_updated: 2021-01-12T06:50:14Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.4230/LIPIcs.CSL.2013.181 ec_funded: 1 file: - access_level: open_access checksum: b7091a3866db573c0db5ec486952255e content_type: application/pdf creator: system date_created: 2018-12-12T10:13:38Z date_updated: 2020-07-14T12:44:47Z file_id: '5023' file_name: IST-2016-624-v1+1_ChKr_Infinite-state_games_2013_17.pdf file_size: 547296 relation: main_file file_date_updated: 2020-07-14T12:44:47Z has_accepted_license: '1' intvolume: ' 23' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: 181 - 196 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: 22nd EACSL Annual Conference on Computer Science Logic publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '5837' pubrep_id: '624' quality_controlled: '1' scopus_import: 1 series_title: Leibniz International Proceedings in Informatics status: public title: Infinite-state games with finitary conditions tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 23 year: '2013' ... --- _id: '1385' abstract: - lang: eng text: It is often difficult to correctly implement a Boolean controller for a complex system, especially when concurrency is involved. Yet, it may be easy to formally specify a controller. For instance, for a pipelined processor it suffices to state that the visible behavior of the pipelined system should be identical to a non-pipelined reference system (Burch-Dill paradigm). We present a novel procedure to efficiently synthesize multiple Boolean control signals from a specification given as a quantified first-order formula (with a specific quantifier structure). Our approach uses uninterpreted functions to abstract details of the design. We construct an unsatisfiable SMT formula from the given specification. Then, from just one proof of unsatisfiability, we use a variant of Craig interpolation to compute multiple coordinated interpolants that implement the Boolean control signals. Our method avoids iterative learning and back-substitution of the control functions. We applied our approach to synthesize a controller for a simple two-stage pipelined processor, and present first experimental results. acknowledgement: "This research was supported by the European Commission through project\r\nDIAMOND \ (FP7-2009-IST-4-248613), and QUAINT (I774-N23), " author: - first_name: Georg full_name: Hofferek, Georg last_name: Hofferek - first_name: Ashutosh full_name: Gupta, Ashutosh id: 335E5684-F248-11E8-B48F-1D18A9856A87 last_name: Gupta - first_name: Bettina full_name: Könighofer, Bettina last_name: Könighofer - first_name: Jie full_name: Jiang, Jie last_name: Jiang - first_name: Roderick full_name: Bloem, Roderick last_name: Bloem citation: ama: 'Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. Synthesizing multiple boolean functions using interpolation on a single proof. In: 2013 Formal Methods in Computer-Aided Design. IEEE; 2013:77-84. doi:10.1109/FMCAD.2013.6679394' apa: 'Hofferek, G., Gupta, A., Könighofer, B., Jiang, J., & Bloem, R. (2013). Synthesizing multiple boolean functions using interpolation on a single proof. In 2013 Formal Methods in Computer-Aided Design (pp. 77–84). Portland, OR, United States: IEEE. https://doi.org/10.1109/FMCAD.2013.6679394' chicago: Hofferek, Georg, Ashutosh Gupta, Bettina Könighofer, Jie Jiang, and Roderick Bloem. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” In 2013 Formal Methods in Computer-Aided Design, 77–84. IEEE, 2013. https://doi.org/10.1109/FMCAD.2013.6679394. ieee: G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, and R. Bloem, “Synthesizing multiple boolean functions using interpolation on a single proof,” in 2013 Formal Methods in Computer-Aided Design, Portland, OR, United States, 2013, pp. 77–84. ista: 'Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. 2013. Synthesizing multiple boolean functions using interpolation on a single proof. 2013 Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 77–84.' mla: Hofferek, Georg, et al. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” 2013 Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 77–84, doi:10.1109/FMCAD.2013.6679394. short: G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, R. Bloem, in:, 2013 Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 77–84. conference: end_date: 2013-10-23 location: Portland, OR, United States name: 'FMCAD: Formal Methods in Computer-Aided Design' start_date: 2013-10-20 date_created: 2018-12-11T11:51:43Z date_published: 2013-12-11T00:00:00Z date_updated: 2021-01-12T06:50:19Z day: '11' department: - _id: ToHe doi: 10.1109/FMCAD.2013.6679394 ec_funded: 1 external_id: arxiv: - '1308.4767' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1308.4767 month: '12' oa: 1 oa_version: Preprint page: 77 - 84 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling publication: 2013 Formal Methods in Computer-Aided Design publication_status: published publisher: IEEE publist_id: '5825' quality_controlled: '1' status: public title: Synthesizing multiple boolean functions using interpolation on a single proof type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2013' ... --- _id: '1387' abstract: - lang: eng text: Choices made by nondeterministic word automata depend on both the past (the prefix of the word read so far) and the future (the suffix yet to be read). In several applications, most notably synthesis, the future is diverse or unknown, leading to algorithms that are based on deterministic automata. Hoping to retain some of the advantages of nondeterministic automata, researchers have studied restricted classes of nondeterministic automata. Three such classes are nondeterministic automata that are good for trees (GFT; i.e., ones that can be expanded to tree automata accepting the derived tree languages, thus whose choices should satisfy diverse futures), good for games (GFG; i.e., ones whose choices depend only on the past), and determinizable by pruning (DBP; i.e., ones that embody equivalent deterministic automata). The theoretical properties and relative merits of the different classes are still open, having vagueness on whether they really differ from deterministic automata. In particular, while DBP ⊆ GFG ⊆ GFT, it is not known whether every GFT automaton is GFG and whether every GFG automaton is DBP. Also open is the possible succinctness of GFG and GFT automata compared to deterministic automata. We study these problems for ω-regular automata with all common acceptance conditions. We show that GFT=GFG⊃DBP, and describe a determinization construction for GFG automata. acknowledgement: and ERC Grant QUALITY. alternative_title: - LNCS article_processing_charge: No author: - first_name: Udi full_name: Boker, Udi id: 31E297B6-F248-11E8-B48F-1D18A9856A87 last_name: Boker - first_name: Denis full_name: Kuperberg, Denis last_name: Kuperberg - first_name: Orna full_name: Kupferman, Orna last_name: Kupferman - first_name: Michał full_name: Skrzypczak, Michał last_name: Skrzypczak citation: ama: Boker U, Kuperberg D, Kupferman O, Skrzypczak M. Nondeterminism in the presence of a diverse or unknown future. 2013;7966(PART 2):89-100. doi:10.1007/978-3-642-39212-2_11 apa: 'Boker, U., Kuperberg, D., Kupferman, O., & Skrzypczak, M. (2013). Nondeterminism in the presence of a diverse or unknown future. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. https://doi.org/10.1007/978-3-642-39212-2_11' chicago: Boker, Udi, Denis Kuperberg, Orna Kupferman, and Michał Skrzypczak. “Nondeterminism in the Presence of a Diverse or Unknown Future.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39212-2_11. ieee: U. Boker, D. Kuperberg, O. Kupferman, and M. Skrzypczak, “Nondeterminism in the presence of a diverse or unknown future,” vol. 7966, no. PART 2. Springer, pp. 89–100, 2013. ista: Boker U, Kuperberg D, Kupferman O, Skrzypczak M. 2013. Nondeterminism in the presence of a diverse or unknown future. 7966(PART 2), 89–100. mla: Boker, Udi, et al. Nondeterminism in the Presence of a Diverse or Unknown Future. Vol. 7966, no. PART 2, Springer, 2013, pp. 89–100, doi:10.1007/978-3-642-39212-2_11. short: U. Boker, D. Kuperberg, O. Kupferman, M. Skrzypczak, 7966 (2013) 89–100. conference: end_date: 2013-07-12 location: Riga, Latvia name: 'ICALP: Automata, Languages and Programming' start_date: 2013-07-08 date_created: 2018-12-11T11:51:44Z date_published: 2013-07-01T00:00:00Z date_updated: 2020-08-11T10:09:09Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.1007/978-3-642-39212-2_11 ec_funded: 1 file: - access_level: open_access checksum: 98bc02e3793072e279ec8d364b381ff3 content_type: application/pdf creator: dernst date_created: 2020-05-15T11:05:50Z date_updated: 2020-07-14T12:44:48Z file_id: '7857' file_name: 2013_ICALP_Boker.pdf file_size: 276982 relation: main_file file_date_updated: 2020-07-14T12:44:48Z has_accepted_license: '1' intvolume: ' 7966' issue: PART 2 language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version page: 89 - 100 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling publication_status: published publisher: Springer publist_id: '5823' quality_controlled: '1' scopus_import: 1 series_title: Lecture Notes in Computer Science status: public title: Nondeterminism in the presence of a diverse or unknown future type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7966 year: '2013' ...