[{"author":[{"id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","first_name":"Maximilian A","orcid":"0000-0002-3937-1330","last_name":"Jösch","full_name":"Maximilian Jösch"},{"last_name":"Weber","full_name":"Weber, Franz","first_name":"Franz"},{"first_name":"Hubert","full_name":"Eichner, Hubert","last_name":"Eichner"},{"first_name":"Alexander","full_name":"Borst, Alexander","last_name":"Borst"}],"citation":{"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.","apa":"Jösch, M. A., Weber, F., Eichner, H., &#38; Borst, A. (2013). Functional specialization of parallel motion detection circuits in the fly. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.3374-12.2013\">https://doi.org/10.1523/JNEUROSCI.3374-12.2013</a>","short":"M.A. Jösch, F. Weber, H. Eichner, A. Borst, Journal of Neuroscience 33 (2013) 902–905.","ieee":"M. A. Jösch, F. Weber, H. Eichner, and A. Borst, “Functional specialization of parallel motion detection circuits in the fly,” <i>Journal of Neuroscience</i>, vol. 33, no. 3. Society for Neuroscience, pp. 902–905, 2013.","mla":"Jösch, Maximilian A., et al. “Functional Specialization of Parallel Motion Detection Circuits in the Fly.” <i>Journal of Neuroscience</i>, vol. 33, no. 3, Society for Neuroscience, 2013, pp. 902–05, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.3374-12.2013\">10.1523/JNEUROSCI.3374-12.2013</a>.","ama":"Jösch MA, Weber F, Eichner H, Borst A. Functional specialization of parallel motion detection circuits in the fly. <i>Journal of Neuroscience</i>. 2013;33(3):902-905. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.3374-12.2013\">10.1523/JNEUROSCI.3374-12.2013</a>","chicago":"Jösch, Maximilian A, Franz Weber, Hubert Eichner, and Alexander Borst. “Functional Specialization of Parallel Motion Detection Circuits in the Fly.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2013. <a href=\"https://doi.org/10.1523/JNEUROSCI.3374-12.2013\">https://doi.org/10.1523/JNEUROSCI.3374-12.2013</a>."},"publication_status":"published","day":"16","publication":"Journal of Neuroscience","year":"2013","page":"902 - 905","abstract":[{"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.","lang":"eng"}],"status":"public","date_published":"2013-01-16T00:00:00Z","quality_controlled":0,"acknowledgement":"This work was supported by the Max-Planck-Society and the SFB 870 of the Deutsche Forschungsgemeinschaft.","publisher":"Society for Neuroscience","date_created":"2018-12-11T11:51:16Z","_id":"1305","issue":"3","date_updated":"2021-01-12T06:49:45Z","type":"journal_article","intvolume":"        33","title":"Functional specialization of parallel motion detection circuits in the fly","publist_id":"5968","volume":33,"month":"01","extern":1,"doi":"10.1523/JNEUROSCI.3374-12.2013"},{"publist_id":"5962","volume":38,"extern":1,"month":"11","doi":"10.1080/03605302.2013.823548","intvolume":"        38","title":"Uniqueness of solutions of the Derrida-Lebowitz-Speer-Spohn equation and quantum drift diffusion models","_id":"1307","issue":"11","date_updated":"2021-01-12T06:49:46Z","type":"journal_article","date_published":"2013-11-01T00:00:00Z","quality_controlled":0,"date_created":"2018-12-11T11:51:17Z","publisher":"Taylor & Francis","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."}],"page":"2004 - 2047","status":"public","year":"2013","citation":{"ieee":"J. L. Fischer, “Uniqueness of solutions of the Derrida-Lebowitz-Speer-Spohn equation and quantum drift diffusion models,” <i>Communications in Partial Differential Equations</i>, vol. 38, no. 11. Taylor &#38; Francis, pp. 2004–2047, 2013.","short":"J.L. Fischer, Communications in Partial Differential Equations 38 (2013) 2004–2047.","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.","apa":"Fischer, J. L. (2013). Uniqueness of solutions of the Derrida-Lebowitz-Speer-Spohn equation and quantum drift diffusion models. <i>Communications in Partial Differential Equations</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/03605302.2013.823548\">https://doi.org/10.1080/03605302.2013.823548</a>","chicago":"Fischer, Julian L. “Uniqueness of Solutions of the Derrida-Lebowitz-Speer-Spohn Equation and Quantum Drift Diffusion Models.” <i>Communications in Partial Differential Equations</i>. Taylor &#38; Francis, 2013. <a href=\"https://doi.org/10.1080/03605302.2013.823548\">https://doi.org/10.1080/03605302.2013.823548</a>.","ama":"Fischer JL. Uniqueness of solutions of the Derrida-Lebowitz-Speer-Spohn equation and quantum drift diffusion models. <i>Communications in Partial Differential Equations</i>. 2013;38(11):2004-2047. doi:<a href=\"https://doi.org/10.1080/03605302.2013.823548\">10.1080/03605302.2013.823548</a>","mla":"Fischer, Julian L. “Uniqueness of Solutions of the Derrida-Lebowitz-Speer-Spohn Equation and Quantum Drift Diffusion Models.” <i>Communications in Partial Differential Equations</i>, vol. 38, no. 11, Taylor &#38; Francis, 2013, pp. 2004–47, doi:<a href=\"https://doi.org/10.1080/03605302.2013.823548\">10.1080/03605302.2013.823548</a>."},"publication_status":"published","day":"01","publication":"Communications in Partial Differential Equations","author":[{"orcid":"0000-0002-0479-558X","first_name":"Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","full_name":"Julian Fischer","last_name":"Fischer"}]},{"intvolume":"        45","title":"Advection-driven support shrinking in a chemotaxis model with degenerate mobility","publist_id":"5963","extern":1,"volume":45,"month":"01","doi":"10.1137/120874291","date_published":"2013-01-01T00:00:00Z","quality_controlled":0,"publisher":"Society for Industrial and Applied Mathematics ","date_created":"2018-12-11T11:51:17Z","_id":"1308","issue":"3","date_updated":"2021-01-12T06:49:46Z","type":"journal_article","year":"2013","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."}],"page":"1585 - 1615","status":"public","author":[{"last_name":"Fischer","full_name":"Julian Fischer","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","first_name":"Julian L","orcid":"0000-0002-0479-558X"}],"citation":{"ieee":"J. L. Fischer, “Advection-driven support shrinking in a chemotaxis model with degenerate mobility,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 45, no. 3. Society for Industrial and Applied Mathematics , pp. 1585–1615, 2013.","short":"J.L. Fischer, SIAM Journal on Mathematical Analysis 45 (2013) 1585–1615.","ista":"Fischer JL. 2013. Advection-driven support shrinking in a chemotaxis model with degenerate mobility. SIAM Journal on Mathematical Analysis. 45(3), 1585–1615.","apa":"Fischer, J. L. (2013). Advection-driven support shrinking in a chemotaxis model with degenerate mobility. <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics . <a href=\"https://doi.org/10.1137/120874291\">https://doi.org/10.1137/120874291</a>","ama":"Fischer JL. Advection-driven support shrinking in a chemotaxis model with degenerate mobility. <i>SIAM Journal on Mathematical Analysis</i>. 2013;45(3):1585-1615. doi:<a href=\"https://doi.org/10.1137/120874291\">10.1137/120874291</a>","chicago":"Fischer, Julian L. “Advection-Driven Support Shrinking in a Chemotaxis Model with Degenerate Mobility.” <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics , 2013. <a href=\"https://doi.org/10.1137/120874291\">https://doi.org/10.1137/120874291</a>.","mla":"Fischer, Julian L. “Advection-Driven Support Shrinking in a Chemotaxis Model with Degenerate Mobility.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 45, no. 3, Society for Industrial and Applied Mathematics , 2013, pp. 1585–615, doi:<a href=\"https://doi.org/10.1137/120874291\">10.1137/120874291</a>."},"publication_status":"published","day":"01","publication":"SIAM Journal on Mathematical Analysis"},{"publist_id":"5961","volume":255,"month":"11","extern":1,"doi":"10.1016/j.jde.2013.07.028","intvolume":"       255","title":"Optimal lower bounds on asymptotic support propagation rates for the thin-film equation","_id":"1310","date_updated":"2021-01-12T06:49:47Z","issue":"10","type":"journal_article","date_published":"2013-11-15T00:00:00Z","quality_controlled":0,"publisher":"Academic Press","date_created":"2018-12-11T11:51:18Z","page":"3127 - 3149","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."}],"status":"public","year":"2013","citation":{"chicago":"Fischer, Julian L. “Optimal Lower Bounds on Asymptotic Support Propagation Rates for the Thin-Film Equation.” <i>Journal of Differential Equations</i>. Academic Press, 2013. <a href=\"https://doi.org/10.1016/j.jde.2013.07.028\">https://doi.org/10.1016/j.jde.2013.07.028</a>.","ama":"Fischer JL. Optimal lower bounds on asymptotic support propagation rates for the thin-film equation. <i>Journal of Differential Equations</i>. 2013;255(10):3127-3149. doi:<a href=\"https://doi.org/10.1016/j.jde.2013.07.028\">10.1016/j.jde.2013.07.028</a>","mla":"Fischer, Julian L. “Optimal Lower Bounds on Asymptotic Support Propagation Rates for the Thin-Film Equation.” <i>Journal of Differential Equations</i>, vol. 255, no. 10, Academic Press, 2013, pp. 3127–49, doi:<a href=\"https://doi.org/10.1016/j.jde.2013.07.028\">10.1016/j.jde.2013.07.028</a>.","short":"J.L. Fischer, Journal of Differential Equations 255 (2013) 3127–3149.","ieee":"J. L. Fischer, “Optimal lower bounds on asymptotic support propagation rates for the thin-film equation,” <i>Journal of Differential Equations</i>, vol. 255, no. 10. Academic Press, pp. 3127–3149, 2013.","apa":"Fischer, J. L. (2013). Optimal lower bounds on asymptotic support propagation rates for the thin-film equation. <i>Journal of Differential Equations</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.jde.2013.07.028\">https://doi.org/10.1016/j.jde.2013.07.028</a>","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."},"publication_status":"published","day":"15","publication":"Journal of Differential Equations","author":[{"full_name":"Julian Fischer","last_name":"Fischer","orcid":"0000-0002-0479-558X","first_name":"Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87"}]},{"article_number":"82","publication_status":"published","citation":{"mla":"Skouras, Mélina, et al. “Computational Design of Actuated Deformable Characters.” <i>ACM Transactions on Graphics</i>, vol. 32, no. 4, 82, ACM, 2013, doi:<a href=\"https://doi.org/10.1145/2461912.2461979\">10.1145/2461912.2461979</a>.","ama":"Skouras M, Thomaszewski B, Coros S, Bickel B, Groß M. Computational design of actuated deformable characters. <i>ACM Transactions on Graphics</i>. 2013;32(4). doi:<a href=\"https://doi.org/10.1145/2461912.2461979\">10.1145/2461912.2461979</a>","chicago":"Skouras, Mélina, Bernhard Thomaszewski, Stelian Coros, Bernd Bickel, and Markus Groß. “Computational Design of Actuated Deformable Characters.” <i>ACM Transactions on Graphics</i>. ACM, 2013. <a href=\"https://doi.org/10.1145/2461912.2461979\">https://doi.org/10.1145/2461912.2461979</a>.","ista":"Skouras M, Thomaszewski B, Coros S, Bickel B, Groß M. 2013. Computational design of actuated deformable characters. ACM Transactions on Graphics. 32(4), 82.","apa":"Skouras, M., Thomaszewski, B., Coros, S., Bickel, B., &#38; Groß, M. (2013). Computational design of actuated deformable characters. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2461912.2461979\">https://doi.org/10.1145/2461912.2461979</a>","short":"M. Skouras, B. Thomaszewski, S. Coros, B. Bickel, M. Groß, ACM Transactions on Graphics 32 (2013).","ieee":"M. Skouras, B. Thomaszewski, S. Coros, B. Bickel, and M. Groß, “Computational design of actuated deformable characters,” <i>ACM Transactions on Graphics</i>, vol. 32, no. 4. ACM, 2013."},"publication":"ACM Transactions on Graphics","day":"01","language":[{"iso":"eng"}],"author":[{"full_name":"Skouras, Mélina","last_name":"Skouras","first_name":"Mélina"},{"first_name":"Bernhard","last_name":"Thomaszewski","full_name":"Thomaszewski, Bernhard"},{"first_name":"Stelian","full_name":"Coros, Stelian","last_name":"Coros"},{"last_name":"Bickel","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","orcid":"0000-0001-6511-9385"},{"last_name":"Groß","full_name":"Groß, Markus","first_name":"Markus"}],"abstract":[{"lang":"eng","text":"We present a method for fabrication-oriented design of actuated deformable characters that allows a user to automatically create physical replicas of digitally designed characters using rapid manufacturing technologies. Given a deformable character and a set of target poses as input, our method computes a small set of actuators along with their locations on the surface and optimizes the internal material distribution such that the resulting character exhibits the desired deformation behavior. We approach this problem with a dedicated algorithm that combines finite-element analysis, sparse regularization, and constrained optimization. We validate our pipeline on a set of two- and three-dimensional example characters and present results in simulation and physically-fabricated prototypes."}],"status":"public","oa_version":"None","article_processing_charge":"No","year":"2013","_id":"2107","type":"journal_article","issue":"4","date_updated":"2025-10-01T08:08:25Z","date_published":"2013-07-01T00:00:00Z","acknowledgement":"This work was partly funded by the NCCR Co-Me of the Swiss NSF","publisher":"ACM","date_created":"2018-12-11T11:55:45Z","publist_id":"4926","doi":"10.1145/2461912.2461979","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","month":"07","volume":32,"title":"Computational design of actuated deformable characters","intvolume":"        32"},{"abstract":[{"text":"We present an interactive design system that allows non-expert users to create animated mechanical characters. Given an articulated character as input, the user iteratively creates an animation by sketching motion curves indicating how different parts of the character should move. For each motion curve, our framework creates an optimized mechanism that reproduces it as closely as possible. The resulting mechanisms are attached to the character and then connected to each other using gear trains, which are created in a semi-automated fashion. The mechanical assemblies generated with our system can be driven with a single input driver, such as a hand-operated crank or an electric motor, and they can be fabricated using rapid prototyping devices. We demonstrate the versatility of our approach by designing a wide range of mechanical characters, several of which we manufactured using 3D printing. While our pipeline is designed for characters driven by planar mechanisms, significant parts of it extend directly to non-planar mechanisms, allowing us to create characters with compelling 3D motions. ","lang":"eng"}],"status":"public","year":"2013","citation":{"mla":"Coros, Stelian, et al. “Computational Design of Mechanical Characters.” <i>ACM Transactions on Graphics</i>, vol. 32, no. 4, ACM, 2013, doi:<a href=\"https://doi.org/10.1145/2461912.2461953\">10.1145/2461912.2461953</a>.","ama":"Coros S, Thomaszewski B, Noris G, et al. Computational design of mechanical characters. <i>ACM Transactions on Graphics</i>. 2013;32(4). doi:<a href=\"https://doi.org/10.1145/2461912.2461953\">10.1145/2461912.2461953</a>","chicago":"Coros, Stelian, Bernhard Thomaszewski, Gioacchino Noris, Shinjiro Sueda, Moira Forberg, Robert Sumner, Wojciech Matusik, and Bernd Bickel. “Computational Design of Mechanical Characters.” <i>ACM Transactions on Graphics</i>. ACM, 2013. <a href=\"https://doi.org/10.1145/2461912.2461953\">https://doi.org/10.1145/2461912.2461953</a>.","ista":"Coros S, Thomaszewski B, Noris G, Sueda S, Forberg M, Sumner R, Matusik W, Bickel B. 2013. Computational design of mechanical characters. ACM Transactions on Graphics. 32(4).","apa":"Coros, S., Thomaszewski, B., Noris, G., Sueda, S., Forberg, M., Sumner, R., … Bickel, B. (2013). Computational design of mechanical characters. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2461912.2461953\">https://doi.org/10.1145/2461912.2461953</a>","ieee":"S. Coros <i>et al.</i>, “Computational design of mechanical characters,” <i>ACM Transactions on Graphics</i>, vol. 32, no. 4. ACM, 2013.","short":"S. Coros, B. Thomaszewski, G. Noris, S. Sueda, M. Forberg, R. Sumner, W. Matusik, B. Bickel, ACM Transactions on Graphics 32 (2013)."},"publication_status":"published","publication":"ACM Transactions on Graphics","day":"01","author":[{"full_name":"Coros, Stelian","last_name":"Coros","first_name":"Stelian"},{"first_name":"Bernhard","last_name":"Thomaszewski","full_name":"Thomaszewski, Bernhard"},{"last_name":"Noris","full_name":"Noris, Gioacchino","first_name":"Gioacchino"},{"last_name":"Sueda","full_name":"Sueda, Shinjiro","first_name":"Shinjiro"},{"first_name":"Moira","last_name":"Forberg","full_name":"Forberg, Moira"},{"full_name":"Sumner, Robert W","last_name":"Sumner","first_name":"Robert"},{"first_name":"Wojciech","last_name":"Matusik","full_name":"Matusik, Wojciech"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel","full_name":"Bernd Bickel"}],"publist_id":"4927","extern":1,"volume":32,"month":"07","doi":"10.1145/2461912.2461953","intvolume":"        32","title":"Computational design of mechanical characters","_id":"2108","issue":"4","date_updated":"2021-01-12T06:55:21Z","type":"journal_article","quality_controlled":0,"date_published":"2013-07-01T00:00:00Z","publisher":"ACM","date_created":"2018-12-11T11:55:46Z"},{"date_created":"2018-12-11T11:55:46Z","publisher":"Elsevier","quality_controlled":0,"date_published":"2013-10-01T00:00:00Z","type":"journal_article","date_updated":"2021-01-12T06:55:22Z","issue":"6","_id":"2109","title":"Orthogonal slicing for additive manufacturing","intvolume":"        37","doi":"10.1016/j.cag.2013.05.011","extern":1,"volume":37,"month":"10","publist_id":"4924","author":[{"last_name":"Hildebrand","full_name":"Hildebrand, Kristian","first_name":"Kristian"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel","full_name":"Bernd Bickel"},{"full_name":"Alexa, Marc","last_name":"Alexa","first_name":"Marc"}],"day":"01","publication":"Computers and Graphics (Pergamon)","publication_status":"published","citation":{"ama":"Hildebrand K, Bickel B, Alexa M. Orthogonal slicing for additive manufacturing. <i>Computers and Graphics (Pergamon)</i>. 2013;37(6):669-675. doi:<a href=\"https://doi.org/10.1016/j.cag.2013.05.011\">10.1016/j.cag.2013.05.011</a>","chicago":"Hildebrand, Kristian, Bernd Bickel, and Marc Alexa. “Orthogonal Slicing for Additive Manufacturing.” <i>Computers and Graphics (Pergamon)</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.cag.2013.05.011\">https://doi.org/10.1016/j.cag.2013.05.011</a>.","mla":"Hildebrand, Kristian, et al. “Orthogonal Slicing for Additive Manufacturing.” <i>Computers and Graphics (Pergamon)</i>, vol. 37, no. 6, Elsevier, 2013, pp. 669–75, doi:<a href=\"https://doi.org/10.1016/j.cag.2013.05.011\">10.1016/j.cag.2013.05.011</a>.","ieee":"K. Hildebrand, B. Bickel, and M. Alexa, “Orthogonal slicing for additive manufacturing,” <i>Computers and Graphics (Pergamon)</i>, vol. 37, no. 6. Elsevier, pp. 669–675, 2013.","short":"K. Hildebrand, B. Bickel, M. Alexa, Computers and Graphics (Pergamon) 37 (2013) 669–675.","ista":"Hildebrand K, Bickel B, Alexa M. 2013. Orthogonal slicing for additive manufacturing. Computers and Graphics (Pergamon). 37(6), 669–675.","apa":"Hildebrand, K., Bickel, B., &#38; Alexa, M. (2013). Orthogonal slicing for additive manufacturing. <i>Computers and Graphics (Pergamon)</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cag.2013.05.011\">https://doi.org/10.1016/j.cag.2013.05.011</a>"},"year":"2013","status":"public","abstract":[{"lang":"eng","text":"Most additive manufacturing technologies work by layering, i.e. slicing the shape and then generating each slice independently. This introduces an anisotropy into the process, often as different accuracies in the tangential and normal directions, but also in terms of other parameters such as build speed or tensile strength and strain. We model this as an anisotropic cubic element. Our approach then finds a compromise between modeling each part of the shape individually in the best possible direction and using one direction for the whole shape part. In particular, we compute an orthogonal basis and consider only the three basis vectors as slice normals (i.e. fabrication directions). Then we optimize a decomposition of the shape along this basis so that each part can be consistently sliced along one of the basis vectors. In simulation, we show that this approach is superior to slicing the whole shape in one direction, only. It also has clear benefits if the shape is larger than the build volume of the available equipment."}],"page":"669 - 675"},{"publication_status":"published","citation":{"apa":"Papas, M., Regg, C., Jarosz, W., Bickel, B., Jackson, P., Matusik, W., … Groß, M. (2013). Fabricating translucent materials using continuous pigment mixtures. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2461912.2461974\">https://doi.org/10.1145/2461912.2461974</a>","ista":"Papas M, Regg C, Jarosz W, Bickel B, Jackson P, Matusik W, Marschner S, Groß M. 2013. Fabricating translucent materials using continuous pigment mixtures. ACM Transactions on Graphics. 32(4).","ieee":"M. Papas <i>et al.</i>, “Fabricating translucent materials using continuous pigment mixtures,” <i>ACM Transactions on Graphics</i>, vol. 32, no. 4. ACM, 2013.","short":"M. Papas, C. Regg, W. Jarosz, B. Bickel, P. Jackson, W. Matusik, S. Marschner, M. Groß, ACM Transactions on Graphics 32 (2013).","mla":"Papas, Marios, et al. “Fabricating Translucent Materials Using Continuous Pigment Mixtures.” <i>ACM Transactions on Graphics</i>, vol. 32, no. 4, ACM, 2013, doi:<a href=\"https://doi.org/10.1145/2461912.2461974\">10.1145/2461912.2461974</a>.","chicago":"Papas, Marios, Christian Regg, Wojciech Jarosz, Bernd Bickel, Philip Jackson, Wojciech Matusik, Steve Marschner, and Markus Groß. “Fabricating Translucent Materials Using Continuous Pigment Mixtures.” <i>ACM Transactions on Graphics</i>. ACM, 2013. <a href=\"https://doi.org/10.1145/2461912.2461974\">https://doi.org/10.1145/2461912.2461974</a>.","ama":"Papas M, Regg C, Jarosz W, et al. Fabricating translucent materials using continuous pigment mixtures. <i>ACM Transactions on Graphics</i>. 2013;32(4). doi:<a href=\"https://doi.org/10.1145/2461912.2461974\">10.1145/2461912.2461974</a>"},"publication":"ACM Transactions on Graphics","day":"01","author":[{"first_name":"Marios","last_name":"Papas","full_name":"Papas, Marios"},{"last_name":"Regg","full_name":"Regg, Christian","first_name":"Christian"},{"first_name":"Wojciech","last_name":"Jarosz","full_name":"Jarosz, Wojciech"},{"full_name":"Bernd Bickel","last_name":"Bickel","orcid":"0000-0001-6511-9385","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Jackson, Philip V","last_name":"Jackson","first_name":"Philip"},{"full_name":"Matusik, Wojciech","last_name":"Matusik","first_name":"Wojciech"},{"full_name":"Marschner, Steve","last_name":"Marschner","first_name":"Steve"},{"last_name":"Groß","full_name":"Groß, Markus S","first_name":"Markus"}],"abstract":[{"text":"We present a method for practical physical reproduction and design of homogeneous materials with desired subsurface scattering. Our process uses a collection of different pigments that can be suspended in a clear base material. Our goal is to determine pigment concentrations that best reproduce the appearance and subsurface scattering of a given target material. In order to achieve this task we first fabricate a collection of material samples composed of known mixtures of the available pigments with the base material. We then acquire their reflectance profiles using a custom-built measurement device. We use the same device to measure the reflectance profile of a target material. Based on the database of mappings from pigment concentrations to reflectance profiles, we use an optimization process to compute the concentration of pigments to best replicate the target material appearance. We demonstrate the practicality of our method by reproducing a variety of different translucent materials. We also present a tool that allows the user to explore the range of achievable appearances for a given set of pigments. ","lang":"eng"}],"status":"public","year":"2013","_id":"2110","type":"journal_article","issue":"4","date_updated":"2021-01-12T06:55:22Z","date_published":"2013-07-01T00:00:00Z","quality_controlled":0,"date_created":"2018-12-11T11:55:46Z","publisher":"ACM","publist_id":"4925","doi":"10.1145/2461912.2461974","volume":32,"extern":1,"month":"07","title":"Fabricating translucent materials using continuous pigment mixtures","intvolume":"        32"},{"_id":"2111","type":"journal_article","issue":"6","date_updated":"2021-01-12T06:55:23Z","date_published":"2013-11-01T00:00:00Z","quality_controlled":0,"date_created":"2018-12-11T11:55:47Z","publisher":"ACM","publist_id":"4922","doi":"10.1145/2508363.2508416","volume":32,"extern":1,"month":"11","title":"Augmenting physical avatars using projector-based illumination","intvolume":"        32","publication_status":"published","citation":{"mla":"Bermano, Amit, et al. “Augmenting Physical Avatars Using Projector-Based Illumination.” <i>ACM Transactions on Graphics</i>, vol. 32, no. 6, ACM, 2013, doi:<a href=\"https://doi.org/10.1145/2508363.2508416\">10.1145/2508363.2508416</a>.","ama":"Bermano A, Bruschweiler P, Grundhöfer A, Iwai D, Bickel B, Groß M. Augmenting physical avatars using projector-based illumination. <i>ACM Transactions on Graphics</i>. 2013;32(6). doi:<a href=\"https://doi.org/10.1145/2508363.2508416\">10.1145/2508363.2508416</a>","chicago":"Bermano, Amit, Philipp Bruschweiler, Anselm Grundhöfer, Daisuke Iwai, Bernd Bickel, and Markus Groß. “Augmenting Physical Avatars Using Projector-Based Illumination.” <i>ACM Transactions on Graphics</i>. ACM, 2013. <a href=\"https://doi.org/10.1145/2508363.2508416\">https://doi.org/10.1145/2508363.2508416</a>.","apa":"Bermano, A., Bruschweiler, P., Grundhöfer, A., Iwai, D., Bickel, B., &#38; Groß, M. (2013). Augmenting physical avatars using projector-based illumination. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2508363.2508416\">https://doi.org/10.1145/2508363.2508416</a>","ista":"Bermano A, Bruschweiler P, Grundhöfer A, Iwai D, Bickel B, Groß M. 2013. Augmenting physical avatars using projector-based illumination. ACM Transactions on Graphics. 32(6).","ieee":"A. Bermano, P. Bruschweiler, A. Grundhöfer, D. Iwai, B. Bickel, and M. Groß, “Augmenting physical avatars using projector-based illumination,” <i>ACM Transactions on Graphics</i>, vol. 32, no. 6. ACM, 2013.","short":"A. Bermano, P. Bruschweiler, A. Grundhöfer, D. Iwai, B. Bickel, M. Groß, ACM Transactions on Graphics 32 (2013)."},"day":"01","publication":"ACM Transactions on Graphics","author":[{"full_name":"Bermano, Amit H","last_name":"Bermano","first_name":"Amit"},{"first_name":"Philipp","full_name":"Bruschweiler, Philipp","last_name":"Bruschweiler"},{"last_name":"Grundhöfer","full_name":"Grundhöfer, Anselm","first_name":"Anselm"},{"first_name":"Daisuke","full_name":"Iwai, Daisuke","last_name":"Iwai"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel","full_name":"Bernd Bickel"},{"last_name":"Groß","full_name":"Groß, Markus S","first_name":"Markus"}],"abstract":[{"lang":"eng","text":"Animated animatronic figures are a unique way to give physical presence to a character. However, their movement and expressions are often limited due to mechanical constraints. In this paper, we propose a complete process for augmenting physical avatars using projector-based illumination, significantly increasing their expressiveness. Given an input animation, the system decomposes the motion into low-frequency motion that can be physically reproduced by the animatronic head and high-frequency details that are added using projected shading. At the core is a spatio-temporal optimization process that compresses the motion in gradient space, ensuring faithful motion replay while respecting the physical limitations of the system. We also propose a complete multi-camera and projection system, including a novel defocused projection and subsurface scattering compensation scheme. The result of our system is a highly expressive physical avatar that features facial details and motion otherwise unattainable due to physical constraints."}],"status":"public","year":"2013"},{"title":"Expression, purification, crystallization and preliminary X-ray diffraction analysis of carbonyl reductase from Candida parapsilosis ATCC 7330","intvolume":"        69","volume":69,"month":"03","OA_type":"closed access","date_updated":"2026-02-23T08:56:25Z","_id":"21110","year":"2013","article_processing_charge":"No","oa_version":"None","page":"313-315","author":[{"last_name":"Aggarwal","full_name":"Aggarwal, Nidhi","first_name":"Nidhi"},{"first_name":"Pradeep K","orcid":"0000-0001-5996-956X","id":"6a3def15-d4b4-11ef-9fa9-a24c1f545ec3","full_name":"Mandal, Pradeep K","last_name":"Mandal"},{"last_name":"Gautham","full_name":"Gautham, Namasivayam","first_name":"Namasivayam"},{"last_name":"Chadha","full_name":"Chadha, Anju","first_name":"Anju"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1744-3091"]},"publication":"Acta Crystallographica Section F Structural Biology Communications","publication_status":"published","citation":{"short":"N. Aggarwal, P.K. Mandal, N. Gautham, A. Chadha, Acta Crystallographica Section F Structural Biology Communications 69 (2013) 313–315.","ieee":"N. Aggarwal, P. K. Mandal, N. Gautham, and A. Chadha, “Expression, purification, crystallization and preliminary X-ray diffraction analysis of carbonyl reductase from Candida parapsilosis ATCC 7330,” <i>Acta Crystallographica Section F Structural Biology Communications</i>, vol. 69, no. 3. International Union of Crystallography, pp. 313–315, 2013.","ista":"Aggarwal N, Mandal PK, Gautham N, Chadha A. 2013. Expression, purification, crystallization and preliminary X-ray diffraction analysis of carbonyl reductase from Candida parapsilosis ATCC 7330. Acta Crystallographica Section F Structural Biology Communications. 69(3), 313–315.","apa":"Aggarwal, N., Mandal, P. K., Gautham, N., &#38; Chadha, A. (2013). Expression, purification, crystallization and preliminary X-ray diffraction analysis of carbonyl reductase from Candida parapsilosis ATCC 7330. <i>Acta Crystallographica Section F Structural Biology Communications</i>. International Union of Crystallography. <a href=\"https://doi.org/10.1107/s1744309113003667\">https://doi.org/10.1107/s1744309113003667</a>","ama":"Aggarwal N, Mandal PK, Gautham N, Chadha A. Expression, purification, crystallization and preliminary X-ray diffraction analysis of carbonyl reductase from Candida parapsilosis ATCC 7330. <i>Acta Crystallographica Section F Structural Biology Communications</i>. 2013;69(3):313-315. doi:<a href=\"https://doi.org/10.1107/s1744309113003667\">10.1107/s1744309113003667</a>","chicago":"Aggarwal, Nidhi, Pradeep K Mandal, Namasivayam Gautham, and Anju Chadha. “Expression, Purification, Crystallization and Preliminary X-Ray Diffraction Analysis of Carbonyl Reductase from Candida Parapsilosis ATCC 7330.” <i>Acta Crystallographica Section F Structural Biology Communications</i>. International Union of Crystallography, 2013. <a href=\"https://doi.org/10.1107/s1744309113003667\">https://doi.org/10.1107/s1744309113003667</a>.","mla":"Aggarwal, Nidhi, et al. “Expression, Purification, Crystallization and Preliminary X-Ray Diffraction Analysis of Carbonyl Reductase from Candida Parapsilosis ATCC 7330.” <i>Acta Crystallographica Section F Structural Biology Communications</i>, vol. 69, no. 3, International Union of Crystallography, 2013, pp. 313–15, doi:<a href=\"https://doi.org/10.1107/s1744309113003667\">10.1107/s1744309113003667</a>."},"doi":"10.1107/s1744309113003667","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","article_type":"original","publisher":"International Union of Crystallography","date_created":"2026-01-29T22:11:18Z","date_published":"2013-03-01T00:00:00Z","quality_controlled":"1","type":"journal_article","issue":"3","status":"public","abstract":[{"text":"The NAD(P)H-dependent carbonyl reductase from Candida parapsilosis ATCC 7330 catalyses the asymmetric reduction of ethyl 4-phenyl-2-oxobutanoate to ethyl (R)-4-phenyl-2-hydroxybutanoate, a precursor of angiotensin-converting enzyme inhibitors such as Cilazapril and Benazepril. The carbonyl reductase was expressed in Escherichia coli and purified by GST-affinity and size-exclusion chromatography. Crystals were obtained by the hanging-drop vapour-diffusion method and diffracted to 1.86 Å resolution. The asymmetric unit contained two molecules of carbonyl reductase, with a solvent content of 48%. The structure was solved by molecular replacement using cinnamyl alcohol dehydrogenase from Saccharomyces cerevisiae as a search model.","lang":"eng"}],"day":"01"},{"publication_status":"published","citation":{"chicago":"Miguel, Eder, Rasmus Tamstorf, Derek Bradley, Sara Schvartzman, Bernhard Thomaszewski, Bernd Bickel, Wojciech Matusik, Steve Marschner, and Miguel Otaduy. “Modeling and Estimation of Internal Friction in Cloth.” <i>ACM Transactions on Graphics</i>. ACM, 2013. <a href=\"https://doi.org/10.1145/2508363.2508389 \">https://doi.org/10.1145/2508363.2508389 </a>.","ama":"Miguel E, Tamstorf R, Bradley D, et al. Modeling and estimation of internal friction in cloth. <i>ACM Transactions on Graphics</i>. 2013;32(6). doi:<a href=\"https://doi.org/10.1145/2508363.2508389 \">10.1145/2508363.2508389 </a>","mla":"Miguel, Eder, et al. “Modeling and Estimation of Internal Friction in Cloth.” <i>ACM Transactions on Graphics</i>, vol. 32, no. 6, ACM, 2013, doi:<a href=\"https://doi.org/10.1145/2508363.2508389 \">10.1145/2508363.2508389 </a>.","ieee":"E. Miguel <i>et al.</i>, “Modeling and estimation of internal friction in cloth,” <i>ACM Transactions on Graphics</i>, vol. 32, no. 6. ACM, 2013.","short":"E. Miguel, R. Tamstorf, D. Bradley, S. Schvartzman, B. Thomaszewski, B. Bickel, W. Matusik, S. Marschner, M. Otaduy, ACM Transactions on Graphics 32 (2013).","ista":"Miguel E, Tamstorf R, Bradley D, Schvartzman S, Thomaszewski B, Bickel B, Matusik W, Marschner S, Otaduy M. 2013. Modeling and estimation of internal friction in cloth. ACM Transactions on Graphics. 32(6).","apa":"Miguel, E., Tamstorf, R., Bradley, D., Schvartzman, S., Thomaszewski, B., Bickel, B., … Otaduy, M. (2013). Modeling and estimation of internal friction in cloth. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2508363.2508389 \">https://doi.org/10.1145/2508363.2508389 </a>"},"publication":"ACM Transactions on Graphics","day":"01","author":[{"first_name":"Eder","last_name":"Miguel","full_name":"Miguel, Eder"},{"full_name":"Tamstorf, Rasmus","last_name":"Tamstorf","first_name":"Rasmus"},{"last_name":"Bradley","full_name":"Bradley, Derek J","first_name":"Derek"},{"full_name":"Schvartzman, Sara C","last_name":"Schvartzman","first_name":"Sara"},{"first_name":"Bernhard","full_name":"Thomaszewski, Bernhard","last_name":"Thomaszewski"},{"full_name":"Bernd Bickel","last_name":"Bickel","orcid":"0000-0001-6511-9385","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Matusik","full_name":"Matusik, Wojciech","first_name":"Wojciech"},{"last_name":"Marschner","full_name":"Marschner, Steve","first_name":"Steve"},{"last_name":"Otaduy","full_name":"Otaduy, Miguel A","first_name":"Miguel"}],"abstract":[{"lang":"eng","text":"Force-deformation measurements of cloth exhibit significant hysteresis, and many researchers have identified internal friction as the source of this effect. However, it has not been incorporated into computer animation models of cloth. In this paper, we propose a model of internal friction based on an augmented reparameterization of Dahl's model, and we show that this model provides a good match to several important features of cloth hysteresis even with a minimal set of parameters. We also propose novel parameter estimation procedures that are based on simple and inexpensive setups and need only sparse data, as opposed to the complex hardware and dense data acquisition of previous methods. Finally, we provide an algorithm for the efficient simulation of internal friction, and we demonstrate it on simulation examples that show disparate behavior with and without internal friction."}],"status":"public","year":"2013","_id":"2112","type":"journal_article","date_updated":"2021-01-12T06:55:23Z","issue":"6","date_published":"2013-11-01T00:00:00Z","quality_controlled":0,"date_created":"2018-12-11T11:55:47Z","publisher":"ACM","acknowledgement":"This work was supported in part by the European Research Council (ERC-2011-StG-280135 Animetrics) and the Spanish Ministry of Economy (TIN2012-35840).","publist_id":"4923","doi":"10.1145/2508363.2508389 ","month":"11","volume":32,"extern":1,"title":"Modeling and estimation of internal friction in cloth","intvolume":"        32"},{"author":[{"first_name":"Olivier","full_name":"Rouiller, Olivier","last_name":"Rouiller"},{"last_name":"Bickel","full_name":"Bernd Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","orcid":"0000-0001-6511-9385"},{"last_name":"Kautz","full_name":"Kautz, Jan","first_name":"Jan"},{"first_name":"Wojciech","full_name":"Matusik, Wojciech","last_name":"Matusik"},{"first_name":"Marc","full_name":"Alexa, Marc","last_name":"Alexa"}],"day":"23","publication":"IEEE Computer Graphics and Applications","citation":{"ama":"Rouiller O, Bickel B, Kautz J, Matusik W, Alexa M. 3D printing spatially varying BRDFs. <i>IEEE Computer Graphics and Applications</i>. 2013;33(6):48-57. doi:<a href=\"https://doi.org/10.1109/MCG.2013.82 \">10.1109/MCG.2013.82 </a>","chicago":"Rouiller, Olivier, Bernd Bickel, Jan Kautz, Wojciech Matusik, and Marc Alexa. “3D Printing Spatially Varying BRDFs.” <i>IEEE Computer Graphics and Applications</i>. IEEE, 2013. <a href=\"https://doi.org/10.1109/MCG.2013.82 \">https://doi.org/10.1109/MCG.2013.82 </a>.","mla":"Rouiller, Olivier, et al. “3D Printing Spatially Varying BRDFs.” <i>IEEE Computer Graphics and Applications</i>, vol. 33, no. 6, IEEE, 2013, pp. 48–57, doi:<a href=\"https://doi.org/10.1109/MCG.2013.82 \">10.1109/MCG.2013.82 </a>.","ieee":"O. Rouiller, B. Bickel, J. Kautz, W. Matusik, and M. Alexa, “3D printing spatially varying BRDFs,” <i>IEEE Computer Graphics and Applications</i>, vol. 33, no. 6. IEEE, pp. 48–57, 2013.","short":"O. Rouiller, B. Bickel, J. Kautz, W. Matusik, M. Alexa, IEEE Computer Graphics and Applications 33 (2013) 48–57.","ista":"Rouiller O, Bickel B, Kautz J, Matusik W, Alexa M. 2013. 3D printing spatially varying BRDFs. IEEE Computer Graphics and Applications. 33(6), 48–57.","apa":"Rouiller, O., Bickel, B., Kautz, J., Matusik, W., &#38; Alexa, M. (2013). 3D printing spatially varying BRDFs. <i>IEEE Computer Graphics and Applications</i>. IEEE. <a href=\"https://doi.org/10.1109/MCG.2013.82 \">https://doi.org/10.1109/MCG.2013.82 </a>"},"publication_status":"published","year":"2013","status":"public","page":"48 - 57","abstract":[{"text":"A new method fabricates custom surface reflectance and spatially varying bidirectional reflectance distribution functions (svBRDFs). Researchers optimize a microgeometry for a range of normal distribution functions and simulate the resulting surface's effective reflectance. Using the simulation's results, they reproduce an input svBRDF's appearance by distributing the microgeometry on the printed material's surface. This method lets people print svBRDFs on planar samples with current 3D printing technology, even with a limited set of printing materials. It extends naturally to printing svBRDFs on arbitrary shapes.","lang":"eng"}],"publisher":"IEEE","date_created":"2018-12-11T11:55:47Z","date_published":"2013-09-23T00:00:00Z","quality_controlled":0,"date_updated":"2021-01-12T06:55:23Z","issue":"6","type":"journal_article","_id":"2113","intvolume":"        33","title":"3D printing spatially varying BRDFs","month":"09","volume":33,"extern":1,"doi":"10.1109/MCG.2013.82 ","publist_id":"4920"},{"month":"12","extern":1,"volume":33,"doi":"10.1109/MCG.2013.89","publist_id":"4921","intvolume":"        33","title":"Computational aspects of fabrication: Modeling, design and 3d printing","date_updated":"2021-01-12T06:55:24Z","issue":"6","type":"journal_article","_id":"2114","date_created":"2018-12-11T11:55:48Z","publisher":"IEEE","quality_controlled":0,"date_published":"2013-12-01T00:00:00Z","status":"public","page":"24 - 25","abstract":[{"lang":"eng","text":"3D printing is considered a disruptive technology with a potentially tremendous socioeconomic impact. The three articles in this special issue illustrate how novel computer graphics approaches are advancing such digital fabrication."}],"year":"2013","day":"01","publication":"IEEE Computer Graphics and Applications","citation":{"short":"B. Bickel, M. Alexa, IEEE Computer Graphics and Applications 33 (2013) 24–25.","ieee":"B. Bickel and M. Alexa, “Computational aspects of fabrication: Modeling, design and 3d printing,” <i>IEEE Computer Graphics and Applications</i>, vol. 33, no. 6. IEEE, pp. 24–25, 2013.","ista":"Bickel B, Alexa M. 2013. Computational aspects of fabrication: Modeling, design and 3d printing. IEEE Computer Graphics and Applications. 33(6), 24–25.","apa":"Bickel, B., &#38; Alexa, M. (2013). Computational aspects of fabrication: Modeling, design and 3d printing. <i>IEEE Computer Graphics and Applications</i>. IEEE. <a href=\"https://doi.org/10.1109/MCG.2013.89\">https://doi.org/10.1109/MCG.2013.89</a>","chicago":"Bickel, Bernd, and Marc Alexa. “Computational Aspects of Fabrication: Modeling, Design and 3d Printing.” <i>IEEE Computer Graphics and Applications</i>. IEEE, 2013. <a href=\"https://doi.org/10.1109/MCG.2013.89\">https://doi.org/10.1109/MCG.2013.89</a>.","ama":"Bickel B, Alexa M. Computational aspects of fabrication: Modeling, design and 3d printing. <i>IEEE Computer Graphics and Applications</i>. 2013;33(6):24-25. doi:<a href=\"https://doi.org/10.1109/MCG.2013.89\">10.1109/MCG.2013.89</a>","mla":"Bickel, Bernd, and Marc Alexa. “Computational Aspects of Fabrication: Modeling, Design and 3d Printing.” <i>IEEE Computer Graphics and Applications</i>, vol. 33, no. 6, IEEE, 2013, pp. 24–25, doi:<a href=\"https://doi.org/10.1109/MCG.2013.89\">10.1109/MCG.2013.89</a>."},"publication_status":"published","author":[{"first_name":"Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bernd Bickel","last_name":"Bickel"},{"first_name":"Marc","last_name":"Alexa","full_name":"Alexa, Marc"}]},{"date_created":"2018-12-11T11:55:49Z","acknowledgement":"The first and third named authors were supported by VICI subsidy 639.033.604 of the Netherlands Organisation for Scientific Research (NWO). The first and second named authors were supported by the German Research Foundation in the Collaborative Research C","publisher":"Institute of Mathematical Statistics","quality_controlled":0,"date_published":"2013-11-18T00:00:00Z","date_updated":"2021-01-12T06:55:24Z","type":"journal_article","_id":"2117","intvolume":"        18","title":"Poisson stochastic integration in Banach spaces","month":"11","extern":1,"volume":18,"oa":1,"doi":"10.1214/EJP.v18-2945 ","publist_id":"4917","author":[{"first_name":"Sjoerd","last_name":"Dirksen","full_name":"Dirksen, Sjoerd"},{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","orcid":"0000-0002-0845-1338","last_name":"Maas","full_name":"Jan Maas"},{"last_name":"Van Neerven","full_name":"van Neerven, Jan M","first_name":"Jan"}],"publication":"Electronic Journal of Probability","day":"18","citation":{"ama":"Dirksen S, Maas J, Van Neerven J. Poisson stochastic integration in Banach spaces. <i>Electronic Journal of Probability</i>. 2013;18. doi:<a href=\"https://doi.org/10.1214/EJP.v18-2945 \">10.1214/EJP.v18-2945 </a>","chicago":"Dirksen, Sjoerd, Jan Maas, and Jan Van Neerven. “Poisson Stochastic Integration in Banach Spaces.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2013. <a href=\"https://doi.org/10.1214/EJP.v18-2945 \">https://doi.org/10.1214/EJP.v18-2945 </a>.","mla":"Dirksen, Sjoerd, et al. “Poisson Stochastic Integration in Banach Spaces.” <i>Electronic Journal of Probability</i>, vol. 18, Institute of Mathematical Statistics, 2013, doi:<a href=\"https://doi.org/10.1214/EJP.v18-2945 \">10.1214/EJP.v18-2945 </a>.","short":"S. Dirksen, J. Maas, J. Van Neerven, Electronic Journal of Probability 18 (2013).","ieee":"S. Dirksen, J. Maas, and J. Van Neerven, “Poisson stochastic integration in Banach spaces,” <i>Electronic Journal of Probability</i>, vol. 18. Institute of Mathematical Statistics, 2013.","apa":"Dirksen, S., Maas, J., &#38; Van Neerven, J. (2013). Poisson stochastic integration in Banach spaces. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/EJP.v18-2945 \">https://doi.org/10.1214/EJP.v18-2945 </a>","ista":"Dirksen S, Maas J, Van Neerven J. 2013. Poisson stochastic integration in Banach spaces. Electronic Journal of Probability. 18."},"publication_status":"published","year":"2013","status":"public","abstract":[{"lang":"eng","text":"We prove new upper and lower bounds for Banach space-valued stochastic integrals with respect to a compensated Poisson random measure. Our estimates apply to Banach spaces with non-trivial martingale (co)type and extend various results in the literature. We also develop a Malliavin framework to interpret Poisson stochastic integrals as vector-valued Skorohod integrals, and prove a Clark-Ocone representation formula."}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.7901 "}]},{"title":"Gromov-Hausdorff convergence of discrete transportation metrics","intvolume":"        45","doi":"10.1137/120886315 ","oa":1,"month":"01","volume":45,"extern":1,"publist_id":"4904","date_created":"2018-12-11T11:55:53Z","publisher":"Society for Industrial and Applied Mathematics ","acknowledgement":"JM acknowledges support by Rubicon subsidy 680-50-0901 of the Netherlands Organisation for Scientific Research (NWO).","date_published":"2013-01-01T00:00:00Z","quality_controlled":0,"type":"journal_article","date_updated":"2021-01-12T06:55:29Z","issue":"2","_id":"2129","year":"2013","status":"public","abstract":[{"text":"This paper continues the investigation of `Wasserstein-like' transportation distances for probability measures on discrete sets. We prove that the discrete transportation metrics on the d-dimensional discrete torus with mesh size 1/N converge, when N→∞, to the standard 2-Wasserstein distance W_2 on the continuous torus in the sense of Gromov-Hausdorff. This is the first convergence result for the recently developed discrete transportation metrics. The result shows the compatibility between these metrics and the well-established 2-Wasserstein metric. \n\n\n","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1207.6501"}],"page":"879 - 899","author":[{"first_name":"Nicola","full_name":"Gigli, Nicola","last_name":"Gigli"},{"last_name":"Maas","full_name":"Jan Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","orcid":"0000-0002-0845-1338"}],"publication":"SIAM Journal on Mathematical Analysis","day":"01","publication_status":"published","citation":{"apa":"Gigli, N., &#38; Maas, J. (2013). Gromov-Hausdorff convergence of discrete transportation metrics. <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics . <a href=\"https://doi.org/10.1137/120886315 \">https://doi.org/10.1137/120886315 </a>","ista":"Gigli N, Maas J. 2013. Gromov-Hausdorff convergence of discrete transportation metrics. SIAM Journal on Mathematical Analysis. 45(2), 879–899.","short":"N. Gigli, J. Maas, SIAM Journal on Mathematical Analysis 45 (2013) 879–899.","ieee":"N. Gigli and J. Maas, “Gromov-Hausdorff convergence of discrete transportation metrics,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 45, no. 2. Society for Industrial and Applied Mathematics , pp. 879–899, 2013.","mla":"Gigli, Nicola, and Jan Maas. “Gromov-Hausdorff Convergence of Discrete Transportation Metrics.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 45, no. 2, Society for Industrial and Applied Mathematics , 2013, pp. 879–99, doi:<a href=\"https://doi.org/10.1137/120886315 \">10.1137/120886315 </a>.","chicago":"Gigli, Nicola, and Jan Maas. “Gromov-Hausdorff Convergence of Discrete Transportation Metrics.” <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics , 2013. <a href=\"https://doi.org/10.1137/120886315 \">https://doi.org/10.1137/120886315 </a>.","ama":"Gigli N, Maas J. Gromov-Hausdorff convergence of discrete transportation metrics. <i>SIAM Journal on Mathematical Analysis</i>. 2013;45(2):879-899. doi:<a href=\"https://doi.org/10.1137/120886315 \">10.1137/120886315 </a>"}},{"author":[{"last_name":"Lemeshko","full_name":"Mikhail Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","orcid":"0000-0002-6990-7802"}],"day":"07","publication":"Frontiers Physics","citation":{"short":"M. Lemeshko, Frontiers Physics 1 (2013).","ieee":"M. Lemeshko, “Manipulating scattering of ultracold atoms with light-induced dissipation,” <i>Frontiers Physics</i>, vol. 1, no. 17. Frontiers Media, 2013.","apa":"Lemeshko, M. (2013). Manipulating scattering of ultracold atoms with light-induced dissipation. <i>Frontiers Physics</i>. Frontiers Media. <a href=\"https://doi.org/10.3389/fphy.2013.00017\">https://doi.org/10.3389/fphy.2013.00017</a>","ista":"Lemeshko M. 2013. Manipulating scattering of ultracold atoms with light-induced dissipation. Frontiers Physics. 1(17).","ama":"Lemeshko M. Manipulating scattering of ultracold atoms with light-induced dissipation. <i>Frontiers Physics</i>. 2013;1(17). doi:<a href=\"https://doi.org/10.3389/fphy.2013.00017\">10.3389/fphy.2013.00017</a>","chicago":"Lemeshko, Mikhail. “Manipulating Scattering of Ultracold Atoms with Light-Induced Dissipation.” <i>Frontiers Physics</i>. Frontiers Media, 2013. <a href=\"https://doi.org/10.3389/fphy.2013.00017\">https://doi.org/10.3389/fphy.2013.00017</a>.","mla":"Lemeshko, Mikhail. “Manipulating Scattering of Ultracold Atoms with Light-Induced Dissipation.” <i>Frontiers Physics</i>, vol. 1, no. 17, Frontiers Media, 2013, doi:<a href=\"https://doi.org/10.3389/fphy.2013.00017\">10.3389/fphy.2013.00017</a>."},"publication_status":"published","year":"2013","status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1307.8129","open_access":"1"}],"abstract":[{"text":"Recently it has been shown that pairs of atoms can form metastable bonds due to non-conservative forces induced by dissipation [Lemeshko&amp;Weimer, Nature Comm. 4, 2230 (2013)]. Here we study the dynamics of interaction-induced coherent population trapping - the process responsible for the formation of dissipatively bound molecules. We derive the effective dissipative potentials induced between ultracold atoms by laser light, and study the time evolution of the scattering states. We demonstrate that binding occurs on short timescales of ~10 microseconds, even if the initial kinetic energy of the atoms significantly exceeds the depth of the dissipative potential. Dissipatively-bound molecules with preordained bond lengths and vibrational wavefunctions can be created and detected in current experiments with ultracold atoms.","lang":"eng"}],"acknowledgement":"The work was supported by the NSF through a grant for the Institute for Theoretical Atomic, Molecular, and Optical Physics at Harvard University and Smithsonian Astrophysical Observatory","publisher":"Frontiers Media","date_created":"2018-12-11T11:55:56Z","date_published":"2013-10-07T00:00:00Z","quality_controlled":0,"date_updated":"2021-01-12T06:55:32Z","issue":"17","type":"journal_article","_id":"2139","intvolume":"         1","title":"Manipulating scattering of ultracold atoms with light-induced dissipation","extern":1,"month":"10","volume":1,"doi":"10.3389/fphy.2013.00017","oa":1,"publist_id":"4885"},{"publication_status":"published","citation":{"short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–128.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative abstraction refinement,” in <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i>, Rome, Italy, 2013, pp. 115–128.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2013). Quantitative abstraction refinement. In <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i> (pp. 115–128). Rome, Italy: ACM. <a href=\"https://doi.org/10.1145/2429069.2429085\">https://doi.org/10.1145/2429069.2429085</a>","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2013. Quantitative abstraction refinement. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 115–128.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Quantitative abstraction refinement. In: <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>. ACM; 2013:115-128. doi:<a href=\"https://doi.org/10.1145/2429069.2429085\">10.1145/2429069.2429085</a>","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Abstraction Refinement.” In <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, 115–28. ACM, 2013. <a href=\"https://doi.org/10.1145/2429069.2429085\">https://doi.org/10.1145/2429069.2429085</a>.","mla":"Cerny, Pavol, et al. “Quantitative Abstraction Refinement.” <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, ACM, 2013, pp. 115–28, doi:<a href=\"https://doi.org/10.1145/2429069.2429085\">10.1145/2429069.2429085</a>."},"publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","day":"01","language":[{"iso":"eng"}],"author":[{"last_name":"Cerny","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna"}],"page":"115 - 128","abstract":[{"text":"We propose a general framework for abstraction with respect to quantitative properties, such as worst-case execution time, or power consumption. Our framework provides a systematic way for counter-example guided abstraction refinement for quantitative properties. The salient aspect of the framework is that it allows anytime verification, that is, verification algorithms that can be stopped at any time (for example, due to exhaustion of memory), and report approximations that improve monotonically when the algorithms are given more time. We instantiate the framework with a number of quantitative abstractions and refinement schemes, which differ in terms of how much quantitative information they keep from the original system. We introduce both state-based and trace-based quantitative abstractions, and we describe conditions that define classes of quantitative properties for which the abstractions provide over-approximations. We give algorithms for evaluating the quantitative properties on the abstract systems. We present algorithms for counter-example based refinements for quantitative properties for both state-based and segment-based abstractions. We perform a case study on worst-case execution time of executables to evaluate the anytime verification aspect and the quantitative abstractions we proposed.","lang":"eng"}],"project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF"}],"status":"public","oa_version":"None","corr_author":"1","conference":{"name":"POPL: Principles of Programming Languages","start_date":"2013-07-23","location":"Rome, Italy","end_date":"2013-01-25"},"year":"2013","_id":"2182","type":"conference","date_updated":"2024-10-09T20:55:21Z","ec_funded":1,"quality_controlled":"1","date_published":"2013-01-01T00:00:00Z","publisher":"ACM","date_created":"2018-12-11T11:56:11Z","scopus_import":1,"department":[{"_id":"ToHe"}],"publist_id":"4800","doi":"10.1145/2429069.2429085","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","title":"Quantitative abstraction refinement"},{"date_updated":"2024-10-14T12:21:03Z","_id":"13405","month":"10","volume":24,"intvolume":"        24","title":"Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol","publication":"Synlett","citation":{"chicago":"Ely, Tal, Sanjib Das, Wenjie Li, Pintu Kundu, Einat Tirosh, David Cahen, Ayelet Vilan, and Rafal Klajn. “Photocontrol of Electrical Conductance with a Nonsymmetrical Azobenzene Dithiol.” <i>Synlett</i>. Georg Thieme Verlag, 2013. <a href=\"https://doi.org/10.1055/s-0033-1340087\">https://doi.org/10.1055/s-0033-1340087</a>.","ama":"Ely T, Das S, Li W, et al. Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol. <i>Synlett</i>. 2013;24(18):2370-2374. doi:<a href=\"https://doi.org/10.1055/s-0033-1340087\">10.1055/s-0033-1340087</a>","mla":"Ely, Tal, et al. “Photocontrol of Electrical Conductance with a Nonsymmetrical Azobenzene Dithiol.” <i>Synlett</i>, vol. 24, no. 18, Georg Thieme Verlag, 2013, pp. 2370–74, doi:<a href=\"https://doi.org/10.1055/s-0033-1340087\">10.1055/s-0033-1340087</a>.","short":"T. Ely, S. Das, W. Li, P. Kundu, E. Tirosh, D. Cahen, A. Vilan, R. Klajn, Synlett 24 (2013) 2370–2374.","ieee":"T. Ely <i>et al.</i>, “Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol,” <i>Synlett</i>, vol. 24, no. 18. Georg Thieme Verlag, pp. 2370–2374, 2013.","ista":"Ely T, Das S, Li W, Kundu P, Tirosh E, Cahen D, Vilan A, Klajn R. 2013. Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol. Synlett. 24(18), 2370–2374.","apa":"Ely, T., Das, S., Li, W., Kundu, P., Tirosh, E., Cahen, D., … Klajn, R. (2013). Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol. <i>Synlett</i>. Georg Thieme Verlag. <a href=\"https://doi.org/10.1055/s-0033-1340087\">https://doi.org/10.1055/s-0033-1340087</a>"},"publication_status":"published","author":[{"first_name":"Tal","full_name":"Ely, Tal","last_name":"Ely"},{"first_name":"Sanjib","full_name":"Das, Sanjib","last_name":"Das"},{"full_name":"Li, Wenjie","last_name":"Li","first_name":"Wenjie"},{"first_name":"Pintu","last_name":"Kundu","full_name":"Kundu, Pintu"},{"first_name":"Einat","full_name":"Tirosh, Einat","last_name":"Tirosh"},{"first_name":"David","last_name":"Cahen","full_name":"Cahen, David"},{"last_name":"Vilan","full_name":"Vilan, Ayelet","first_name":"Ayelet"},{"last_name":"Klajn","full_name":"Klajn, Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","first_name":"Rafal"}],"publication_identifier":{"issn":["0936-5214"],"eissn":["1437-2096"]},"language":[{"iso":"eng"}],"oa_version":"None","page":"2370-2374","year":"2013","article_processing_charge":"No","issue":"18","type":"journal_article","scopus_import":"1","date_created":"2023-08-01T09:47:17Z","publisher":"Georg Thieme Verlag","quality_controlled":"1","date_published":"2013-10-22T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","doi":"10.1055/s-0033-1340087","article_type":"original","keyword":["Organic Chemistry"],"day":"22","status":"public","abstract":[{"text":"We report a method for preparing electrode–molecule–electrode junctions that incorporate nonsymmetrical azobenzene dithiols. Our approach is based on sequential deprotection of thiol moieties originally carrying two different protecting groups. The azobenzene derivatives retained their switching properties within monolayers and permitted the photocontrol of electrical conductance.","lang":"eng"}]},{"type":"journal_article","issue":"3","date_created":"2023-08-01T09:47:30Z","publisher":"Wiley","scopus_import":"1","date_published":"2013-01-18T00:00:00Z","quality_controlled":"1","doi":"10.1002/adma.201201734","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","article_type":"original","keyword":["Mechanical Engineering","Mechanics of Materials","General Materials Science"],"day":"18","status":"public","abstract":[{"lang":"eng","text":"Dual-responsive nanoparticles are designed by functionalizing magnetic cores with light-responsive ligands. These materials respond to both light and magnetic fields and can be assembled into various higher-order structures, depending on the relative contributions of these two stimuli."}],"date_updated":"2024-10-14T12:21:16Z","_id":"13406","pmid":1,"volume":25,"month":"01","external_id":{"pmid":["22933327"]},"title":"Dual-responsive nanoparticles and their self-assembly","intvolume":"        25","publication":"Advanced Materials","publication_status":"published","citation":{"ama":"Das S, Ranjan P, Maiti PS, Singh G, Leitus G, Klajn R. Dual-responsive nanoparticles and their self-assembly. <i>Advanced Materials</i>. 2013;25(3):422-426. doi:<a href=\"https://doi.org/10.1002/adma.201201734\">10.1002/adma.201201734</a>","chicago":"Das, Sanjib, Priyadarshi Ranjan, Pradipta Sankar Maiti, Gurvinder Singh, Gregory Leitus, and Rafal Klajn. “Dual-Responsive Nanoparticles and Their Self-Assembly.” <i>Advanced Materials</i>. Wiley, 2013. <a href=\"https://doi.org/10.1002/adma.201201734\">https://doi.org/10.1002/adma.201201734</a>.","mla":"Das, Sanjib, et al. “Dual-Responsive Nanoparticles and Their Self-Assembly.” <i>Advanced Materials</i>, vol. 25, no. 3, Wiley, 2013, pp. 422–26, doi:<a href=\"https://doi.org/10.1002/adma.201201734\">10.1002/adma.201201734</a>.","ieee":"S. Das, P. Ranjan, P. S. Maiti, G. Singh, G. Leitus, and R. Klajn, “Dual-responsive nanoparticles and their self-assembly,” <i>Advanced Materials</i>, vol. 25, no. 3. Wiley, pp. 422–426, 2013.","short":"S. Das, P. Ranjan, P.S. Maiti, G. Singh, G. Leitus, R. Klajn, Advanced Materials 25 (2013) 422–426.","ista":"Das S, Ranjan P, Maiti PS, Singh G, Leitus G, Klajn R. 2013. Dual-responsive nanoparticles and their self-assembly. Advanced Materials. 25(3), 422–426.","apa":"Das, S., Ranjan, P., Maiti, P. S., Singh, G., Leitus, G., &#38; Klajn, R. (2013). Dual-responsive nanoparticles and their self-assembly. <i>Advanced Materials</i>. Wiley. <a href=\"https://doi.org/10.1002/adma.201201734\">https://doi.org/10.1002/adma.201201734</a>"},"author":[{"last_name":"Das","full_name":"Das, Sanjib","first_name":"Sanjib"},{"first_name":"Priyadarshi","last_name":"Ranjan","full_name":"Ranjan, Priyadarshi"},{"first_name":"Pradipta Sankar","full_name":"Maiti, Pradipta Sankar","last_name":"Maiti"},{"last_name":"Singh","full_name":"Singh, Gurvinder","first_name":"Gurvinder"},{"full_name":"Leitus, Gregory","last_name":"Leitus","first_name":"Gregory"},{"full_name":"Klajn, Rafal","last_name":"Klajn","first_name":"Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0935-9648"]},"oa_version":"None","page":"422-426","year":"2013","article_processing_charge":"No"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.4230/LIPIcs.CSL.2013.181","file":[{"creator":"system","relation":"main_file","checksum":"b7091a3866db573c0db5ec486952255e","file_name":"IST-2016-624-v1+1_ChKr_Infinite-state_games_2013_17.pdf","access_level":"open_access","file_id":"5023","file_size":547296,"date_created":"2018-12-12T10:13:38Z","date_updated":"2020-07-14T12:44:47Z","content_type":"application/pdf"}],"publist_id":"5837","has_accepted_license":"1","department":[{"_id":"KrCh"}],"scopus_import":1,"series_title":"Leibniz International Proceedings in Informatics","date_created":"2018-12-11T11:51:39Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","date_published":"2013-09-01T00:00:00Z","type":"conference","alternative_title":["LIPIcs"],"status":"public","abstract":[{"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.","lang":"eng"}],"day":"01","intvolume":"        23","title":"Infinite-state games with finitary conditions","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["000"],"volume":23,"pubrep_id":"624","month":"09","oa":1,"ec_funded":1,"date_updated":"2024-10-09T20:55:23Z","_id":"1374","year":"2013","conference":{"location":"Torino, Italy","end_date":"2013-09-05","name":"CSL: Computer Science Logic","start_date":"203-09-02"},"oa_version":"Published Version","corr_author":"1","page":"181 - 196","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Fijalkow, Nathanaël","last_name":"Fijalkow","first_name":"Nathanaël"}],"file_date_updated":"2020-07-14T12:44:47Z","language":[{"iso":"eng"}],"publication":"22nd EACSL Annual Conference on Computer Science Logic","citation":{"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.","ieee":"K. Chatterjee and N. Fijalkow, “Infinite-state games with finitary conditions,” in <i>22nd EACSL Annual Conference on Computer Science Logic</i>, Torino, Italy, 2013, vol. 23, pp. 181–196.","apa":"Chatterjee, K., &#38; Fijalkow, N. (2013). Infinite-state games with finitary conditions. In <i>22nd EACSL Annual Conference on Computer Science Logic</i> (Vol. 23, pp. 181–196). Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">https://doi.org/10.4230/LIPIcs.CSL.2013.181</a>","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.","chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” In <i>22nd EACSL Annual Conference on Computer Science Logic</i>, 23:181–96. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">https://doi.org/10.4230/LIPIcs.CSL.2013.181</a>.","ama":"Chatterjee K, Fijalkow N. Infinite-state games with finitary conditions. In: <i>22nd EACSL Annual Conference on Computer Science Logic</i>. Vol 23. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2013:181-196. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">10.4230/LIPIcs.CSL.2013.181</a>","mla":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” <i>22nd EACSL Annual Conference on Computer Science Logic</i>, vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–96, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">10.4230/LIPIcs.CSL.2013.181</a>."},"publication_status":"published"}]