[{"main_file_link":[{"url":"http://arxiv.org/abs/1112.5026","open_access":"1"}],"day":"01","oa":1,"oa_version":"Preprint","external_id":{"isi":["000302410200006"],"arxiv":["1112.5026"]},"intvolume":"        85","date_created":"2018-12-11T12:02:20Z","date_updated":"2026-08-12T14:29:02Z","das_tickbox":"1","publist_id":"3386","title":"Optimizing information flow in small genetic networks. III. A self-interacting gene","publication_status":"published","fulldoi":"https://doi.org/10.1103/PhysRevE.85.041903","publisher":"American Physical Society","department":[{"_id":"GaTk"}],"scopus_import":"1","quality_controlled":"1","publication":"Physical Review E","type":"journal_article","abstract":[{"text":"Living cells must control the reading out or &quot;expression&quot; of information encoded in their genomes, and this regulation often is mediated by transcription factors--proteins that bind to DNA and either enhance or repress the expression of nearby genes. But the expression of transcription factor proteins is itself regulated, and many transcription factors regulate their own expression in addition to responding to other input signals. Here we analyze the simplest of such self-regulatory circuits, asking how parameters can be chosen to optimize information transmission from inputs to outputs in the steady state. Some nonzero level of self-regulation is almost always optimal, with self-activation dominant when transcription factor concentrations are low and self-repression dominant when concentrations are high. In steady state the optimal self-activation is never strong enough to induce bistability, although there is a limit in which the optimal parameters are very close to the critical point.","lang":"eng"}],"article_processing_charge":"No","volume":85,"corr_author":"1","arxiv":1,"acknowledgement":"We thank T. Gregor, E. F. Wieschaus, and, especially, C. G. Callan for helpful discussions.\r\nWork at Princeton was supported in part by NSF Grants No. PHY–0957573 and No. CCF–0939370, by NIH Grant No. R01 GM077599, and by the W. M. Keck Foundation. For part of this work, G.T. was supported in part by NSF Grant No. EF–0928048 and by the Vice Provost for Research at the University of Pennsylvania.","status":"public","isi":1,"citation":{"apa":"Tkačik, G., Walczak, A., &#38; Bialek, W. (2012). Optimizing information flow in small genetic networks. III. A self-interacting gene. <i>Physical Review E</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">https://doi.org/10.1103/PhysRevE.85.041903</a>","mla":"Tkačik, Gašper, et al. “Optimizing Information Flow in Small Genetic Networks. III. A Self-Interacting Gene.” <i>Physical Review E</i>, vol. 85, no. 4, 041903, American Physical Society, 2012, doi:<a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">10.1103/PhysRevE.85.041903</a>.","ieee":"G. Tkačik, A. Walczak, and W. Bialek, “Optimizing information flow in small genetic networks. III. A self-interacting gene,” <i>Physical Review E</i>, vol. 85, no. 4. American Physical Society, 2012.","short":"G. Tkačik, A. Walczak, W. Bialek, Physical Review E 85 (2012).","ista":"Tkačik G, Walczak A, Bialek W. 2012. Optimizing information flow in small genetic networks. III. A self-interacting gene. Physical Review E. 85(4), 041903.","chicago":"Tkačik, Gašper, Aleksandra Walczak, and William Bialek. “Optimizing Information Flow in Small Genetic Networks. III. A Self-Interacting Gene.” <i>Physical Review E</i>. American Physical Society, 2012. <a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">https://doi.org/10.1103/PhysRevE.85.041903</a>.","ama":"Tkačik G, Walczak A, Bialek W. Optimizing information flow in small genetic networks. III. A self-interacting gene. <i>Physical Review E</i>. 2012;85(4). doi:<a href=\"https://doi.org/10.1103/PhysRevE.85.041903\">10.1103/PhysRevE.85.041903</a>"},"doi":"10.1103/PhysRevE.85.041903","article_number":"041903","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","first_name":"Gasper"},{"full_name":"Walczak, Aleksandra","first_name":"Aleksandra","last_name":"Walczak"},{"full_name":"Bialek, William","first_name":"William","last_name":"Bialek"}],"month":"04","date_published":"2012-04-01T00:00:00Z","year":"2012","issue":"4","_id":"3262","language":[{"iso":"eng"}]},{"page":"43 - 52","publist_id":"3799","date_updated":"2026-08-12T14:34:15Z","date_created":"2018-12-11T12:00:26Z","external_id":{"arxiv":["1207.7019"]},"oa":1,"oa_version":"Preprint","day":"01","main_file_link":[{"url":"http://arxiv.org/abs/1207.7019","open_access":"1"}],"type":"conference","publication":"Proceedings of the 10th ACM international conference on Embedded software","quality_controlled":"1","scopus_import":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"ACM","fulldoi":"https://doi.org/10.1145/2380356.2380370","publication_status":"published","title":"Finite automata with time delay blocks","doi":"10.1145/2380356.2380370","citation":{"ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time delay blocks,” in <i>Proceedings of the 10th ACM international conference on Embedded software</i>, Tampere, Finland, 2012, pp. 43–52.","mla":"Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.” <i>Proceedings of the 10th ACM International Conference on Embedded Software</i>, ACM, 2012, pp. 43–52, doi:<a href=\"https://doi.org/10.1145/2380356.2380370\">10.1145/2380356.2380370</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Prabhu, V. (2012). Finite automata with time delay blocks. In <i>Proceedings of the 10th ACM international conference on Embedded software</i> (pp. 43–52). Tampere, Finland: ACM. <a href=\"https://doi.org/10.1145/2380356.2380370\">https://doi.org/10.1145/2380356.2380370</a>","ama":"Chatterjee K, Henzinger TA, Prabhu V. Finite automata with time delay blocks. In: <i>Proceedings of the 10th ACM International Conference on Embedded Software</i>. ACM; 2012:43-52. doi:<a href=\"https://doi.org/10.1145/2380356.2380370\">10.1145/2380356.2380370</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.” In <i>Proceedings of the 10th ACM International Conference on Embedded Software</i>, 43–52. ACM, 2012. <a href=\"https://doi.org/10.1145/2380356.2380370\">https://doi.org/10.1145/2380356.2380370</a>.","ista":"Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay blocks. Proceedings of the 10th ACM international conference on Embedded software. EMSOFT: Embedded Software , 43–52.","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Proceedings of the 10th ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52."},"status":"public","acknowledgement":"This work has been financially supported in part by the European Commission FP7-ICT Cognitive Systems, Interaction, and Robotics under the contract # 270180 (NOPTILUS); by Fundacao para Ciencia e Tecnologia under project PTDC/EEA-CRO/104901/2008 (Modeling and control of Networked vehicle systems in persistent autonomous operations); by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification; FWF NFN Grant No S11407-N23 (RiSE); ERC Start grant (279307: Graph Games); Microsoft faculty fellows award; ERC Advanced grant QUAREM; and FWF Grant No S11403-N23 (RiSE).","arxiv":1,"article_processing_charge":"No","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"}],"abstract":[{"text":"The notion of delays arises naturally in many computational models, such as, in the design of circuits, control systems, and dataflow languages. In this work, we introduce automata with delay blocks (ADBs), extending finite state automata with variable time delay blocks, for deferring individual transition output symbols, in a discrete-time setting. We show that the ADB languages strictly subsume the regular languages, and are incomparable in expressive power to the context-free languages. We show that ADBs are closed under union, concatenation and Kleene star, and under intersection with regular languages, but not closed under complementation and intersection with other ADB languages. We show that the emptiness and the membership problems are decidable in polynomial time for ADBs, whereas the universality problem is undecidable. Finally we consider the linear-time model checking problem, i.e., whether the language of an ADB is contained in a regular language, and show that the model checking problem is PSPACE-complete. Copyright 2012 ACM.","lang":"eng"}],"language":[{"iso":"eng"}],"ec_funded":1,"_id":"2936","year":"2012","date_published":"2012-10-01T00:00:00Z","month":"10","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"first_name":"Vinayak","full_name":"Prabhu, Vinayak","last_name":"Prabhu"}],"conference":{"location":"Tampere, Finland","name":"EMSOFT: Embedded Software ","start_date":"2012-10-07","end_date":"2012-10-12"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"language":[{"iso":"eng"}],"_id":"10907","editor":[{"last_name":"Jiang","first_name":"Xiaoyi","full_name":"Jiang, Xiaoyi"},{"last_name":"Ferrer","first_name":"Miquel","full_name":"Ferrer, Miquel"},{"last_name":"Torsello","first_name":"Andrea","full_name":"Torsello, Andrea"}],"year":"2011","date_published":"2011-06-01T00:00:00Z","month":"06","alternative_title":["LNCS"],"author":[{"last_name":"Artner","full_name":"Artner, Nicole M.","first_name":"Nicole M."},{"full_name":"Ion, Adrian","first_name":"Adrian","id":"29F89302-F248-11E8-B48F-1D18A9856A87","last_name":"Ion"},{"last_name":"Kropatsch","full_name":"Kropatsch, Walter G.","first_name":"Walter G."}],"conference":{"start_date":"2011-05-18","end_date":"2011-05-20","location":"Münster, Germany","name":"GbRPR: Graph-based Representations in Pattern Recognition"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","doi":"10.1007/978-3-642-20844-7_22","citation":{"mla":"Artner, Nicole M., et al. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.” <i>Graph-Based Representations in Pattern Recognition</i>, edited by Xiaoyi Jiang et al., vol. 6658, Springer, 2011, pp. 215–24, doi:<a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">10.1007/978-3-642-20844-7_22</a>.","apa":"Artner, N. M., Ion, A., &#38; Kropatsch, W. G. (2011). Spatio-temporal extraction of articulated models in a graph pyramid. In X. Jiang, M. Ferrer, &#38; A. Torsello (Eds.), <i>Graph-Based Representations in Pattern Recognition</i> (Vol. 6658, pp. 215–224). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">https://doi.org/10.1007/978-3-642-20844-7_22</a>","ieee":"N. M. Artner, A. Ion, and W. G. Kropatsch, “Spatio-temporal extraction of articulated models in a graph pyramid,” in <i>Graph-Based Representations in Pattern Recognition</i>, Münster, Germany, 2011, vol. 6658, pp. 215–224.","ista":"Artner NM, Ion A, Kropatsch WG. 2011. Spatio-temporal extraction of articulated models in a graph pyramid. Graph-Based Representations in Pattern Recognition. GbRPR: Graph-based Representations in Pattern RecognitionLNIP, LNCS, vol. 6658, 215–224.","short":"N.M. Artner, A. Ion, W.G. Kropatsch, in:, X. Jiang, M. Ferrer, A. Torsello (Eds.), Graph-Based Representations in Pattern Recognition, Springer, Berlin, Heidelberg, 2011, pp. 215–224.","ama":"Artner NM, Ion A, Kropatsch WG. Spatio-temporal extraction of articulated models in a graph pyramid. In: Jiang X, Ferrer M, Torsello A, eds. <i>Graph-Based Representations in Pattern Recognition</i>. Vol 6658. LNIP. Berlin, Heidelberg: Springer; 2011:215-224. doi:<a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">10.1007/978-3-642-20844-7_22</a>","chicago":"Artner, Nicole M., Adrian Ion, and Walter G. Kropatsch. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.” In <i>Graph-Based Representations in Pattern Recognition</i>, edited by Xiaoyi Jiang, Miquel Ferrer, and Andrea Torsello, 6658:215–24. LNIP. Berlin, Heidelberg: Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-20844-7_22\">https://doi.org/10.1007/978-3-642-20844-7_22</a>."},"status":"public","series_title":"LNIP","acknowledgement":"This work has been partially supported by the Austrian Science Fund under grants S9103-N13 and P18716-N13.","corr_author":"1","article_processing_charge":"No","volume":6658,"abstract":[{"lang":"eng","text":"This paper presents a method to create a model of an articulated object using the planar motion in an initialization video. The model consists of rigid parts connected by points of articulation. The rigid parts are described by the positions of salient feature-points tracked throughout the video. Following a filtering step that identifies points that belong to different objects, rigid parts are found by a grouping process in a graph pyramid. Valid articulation points are selected by verifying multiple hypotheses for each pair of parts."}],"type":"conference","quality_controlled":"1","publication":"Graph-Based Representations in Pattern Recognition","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783642208447"],"isbn":["9783642208430"],"issn":["0302-9743"]},"scopus_import":"1","department":[{"_id":"HeEd"}],"publisher":"Springer","publication_status":"published","fulldoi":"https://doi.org/10.1007/978-3-642-20844-7_22","title":"Spatio-temporal extraction of articulated models in a graph pyramid","page":"215-224","place":"Berlin, Heidelberg","date_updated":"2024-10-09T21:02:32Z","date_created":"2022-03-21T08:08:35Z","intvolume":"      6658","oa_version":"None","day":"01"},{"citation":{"ieee":"J. A. Talamas and M. Hetzer, “POM121 and Sun1 play a role in early steps of interphase NPC assembly,” <i>Journal of Cell Biology</i>, vol. 194, no. 1. Rockefeller University Press, pp. 27–37, 2011.","apa":"Talamas, J. A., &#38; Hetzer, M. (2011). POM121 and Sun1 play a role in early steps of interphase NPC assembly. <i>Journal of Cell Biology</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1083/jcb.201012154\">https://doi.org/10.1083/jcb.201012154</a>","mla":"Talamas, Jessica A., and Martin Hetzer. “POM121 and Sun1 Play a Role in Early Steps of Interphase NPC Assembly.” <i>Journal of Cell Biology</i>, vol. 194, no. 1, Rockefeller University Press, 2011, pp. 27–37, doi:<a href=\"https://doi.org/10.1083/jcb.201012154\">10.1083/jcb.201012154</a>.","chicago":"Talamas, Jessica A., and Martin Hetzer. “POM121 and Sun1 Play a Role in Early Steps of Interphase NPC Assembly.” <i>Journal of Cell Biology</i>. Rockefeller University Press, 2011. <a href=\"https://doi.org/10.1083/jcb.201012154\">https://doi.org/10.1083/jcb.201012154</a>.","ama":"Talamas JA, Hetzer M. POM121 and Sun1 play a role in early steps of interphase NPC assembly. <i>Journal of Cell Biology</i>. 2011;194(1):27-37. doi:<a href=\"https://doi.org/10.1083/jcb.201012154\">10.1083/jcb.201012154</a>","ista":"Talamas JA, Hetzer M. 2011. POM121 and Sun1 play a role in early steps of interphase NPC assembly. Journal of Cell Biology. 194(1), 27–37.","short":"J.A. Talamas, M. Hetzer, Journal of Cell Biology 194 (2011) 27–37."},"doi":"10.1083/jcb.201012154","status":"public","keyword":["Cell Biology"],"abstract":[{"text":"Nuclear pore complexes (NPCs) assemble at the end of mitosis during nuclear envelope (NE) reformation and into an intact NE as cells progress through interphase. Although recent studies have shown that NPC formation occurs by two different molecular mechanisms at two distinct cell cycle stages, little is known about the molecular players that mediate the fusion of the outer and inner nuclear membranes to form pores. In this paper, we provide evidence that the transmembrane nucleoporin (Nup), POM121, but not the Nup107–160 complex, is present at new pore assembly sites at a time that coincides with inner nuclear membrane (INM) and outer nuclear membrane (ONM) fusion. Overexpression of POM121 resulted in juxtaposition of the INM and ONM. Additionally, Sun1, an INM protein that is known to interact with the cytoskeleton, was specifically required for interphase assembly and localized with POM121 at forming pores. We propose a model in which POM121 and Sun1 interact transiently to promote early steps of interphase NPC assembly.","lang":"eng"}],"article_processing_charge":"No","volume":194,"language":[{"iso":"eng"}],"_id":"11094","year":"2011","issue":"1","extern":"1","month":"07","date_published":"2011-07-04T00:00:00Z","author":[{"first_name":"Jessica A.","full_name":"Talamas, Jessica A.","last_name":"Talamas"},{"orcid":"0000-0002-2111-992X","first_name":"Martin W","full_name":"HETZER, Martin W","last_name":"HETZER","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","page":"27-37","date_updated":"2024-10-14T11:26:10Z","external_id":{"pmid":["21727197"]},"intvolume":"       194","date_created":"2022-04-07T07:52:18Z","day":"04","oa":1,"oa_version":"Published Version","main_file_link":[{"url":"https://doi.org/10.1083/jcb.201012154","open_access":"1"}],"quality_controlled":"1","pmid":1,"publication":"Journal of Cell Biology","type":"journal_article","publication_identifier":{"issn":["0021-9525"],"eissn":["1540-8140"]},"scopus_import":"1","publication_status":"published","fulldoi":"https://doi.org/10.1083/jcb.201012154","publisher":"Rockefeller University Press","title":"POM121 and Sun1 play a role in early steps of interphase NPC assembly"},{"extern":"1","year":"2011","issue":"3","_id":"11095","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"letter_note","author":[{"id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","last_name":"HETZER","first_name":"Martin W","orcid":"0000-0002-2111-992X","full_name":"HETZER, Martin W"},{"last_name":"Cavalli","first_name":"Giacomo","full_name":"Cavalli, Giacomo"}],"date_published":"2011-06-01T00:00:00Z","month":"06","citation":{"short":"M. Hetzer, G. Cavalli, Current Opinion in Cell Biology 23 (2011) 255–257.","ista":"Hetzer M, Cavalli G. 2011. Editorial overview. Current Opinion in Cell Biology. 23(3), 255–257.","ama":"Hetzer M, Cavalli G. Editorial overview. <i>Current Opinion in Cell Biology</i>. 2011;23(3):255-257. doi:<a href=\"https://doi.org/10.1016/j.ceb.2011.04.013\">10.1016/j.ceb.2011.04.013</a>","chicago":"Hetzer, Martin, and Giacomo Cavalli. “Editorial Overview.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.ceb.2011.04.013\">https://doi.org/10.1016/j.ceb.2011.04.013</a>.","mla":"Hetzer, Martin, and Giacomo Cavalli. “Editorial Overview.” <i>Current Opinion in Cell Biology</i>, vol. 23, no. 3, Elsevier, 2011, pp. 255–57, doi:<a href=\"https://doi.org/10.1016/j.ceb.2011.04.013\">10.1016/j.ceb.2011.04.013</a>.","apa":"Hetzer, M., &#38; Cavalli, G. (2011). Editorial overview. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2011.04.013\">https://doi.org/10.1016/j.ceb.2011.04.013</a>","ieee":"M. Hetzer and G. Cavalli, “Editorial overview,” <i>Current Opinion in Cell Biology</i>, vol. 23, no. 3. Elsevier, pp. 255–257, 2011."},"doi":"10.1016/j.ceb.2011.04.013","volume":23,"article_processing_charge":"No","status":"public","keyword":["Cell Biology"],"publication_identifier":{"issn":["0955-0674"]},"pmid":1,"publication":"Current Opinion in Cell Biology","quality_controlled":"1","type":"journal_article","title":"Editorial overview","publication_status":"published","fulldoi":"https://doi.org/10.1016/j.ceb.2011.04.013","publisher":"Elsevier","scopus_import":"1","page":"255-257","day":"01","oa_version":"None","external_id":{"pmid":["21592757"]},"date_created":"2022-04-07T07:52:27Z","intvolume":"        23","date_updated":"2024-10-14T11:26:20Z"},{"type":"journal_article","publication":"Current Opinion in Cell Biology","pmid":1,"quality_controlled":"1","publication_identifier":{"issn":["0955-0674"]},"scopus_import":"1","publisher":"Elsevier","publication_status":"published","fulldoi":"https://doi.org/10.1016/j.ceb.2010.09.008","title":"Functional interactions between nucleoporins and chromatin","page":"65-70","date_updated":"2024-10-14T11:26:31Z","date_created":"2022-04-07T07:52:37Z","intvolume":"        23","external_id":{"pmid":["21030234"]},"oa_version":"None","day":"01","language":[{"iso":"eng"}],"_id":"11096","issue":"1","year":"2011","extern":"1","date_published":"2011-02-01T00:00:00Z","month":"02","author":[{"first_name":"Yun","full_name":"Liang, Yun","last_name":"Liang"},{"last_name":"HETZER","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","full_name":"HETZER, Martin W","orcid":"0000-0002-2111-992X","first_name":"Martin W"}],"article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1016/j.ceb.2010.09.008","citation":{"mla":"Liang, Yun, and Martin Hetzer. “Functional Interactions between Nucleoporins and Chromatin.” <i>Current Opinion in Cell Biology</i>, vol. 23, no. 1, Elsevier, 2011, pp. 65–70, doi:<a href=\"https://doi.org/10.1016/j.ceb.2010.09.008\">10.1016/j.ceb.2010.09.008</a>.","apa":"Liang, Y., &#38; Hetzer, M. (2011). Functional interactions between nucleoporins and chromatin. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2010.09.008\">https://doi.org/10.1016/j.ceb.2010.09.008</a>","ieee":"Y. Liang and M. Hetzer, “Functional interactions between nucleoporins and chromatin,” <i>Current Opinion in Cell Biology</i>, vol. 23, no. 1. Elsevier, pp. 65–70, 2011.","ista":"Liang Y, Hetzer M. 2011. Functional interactions between nucleoporins and chromatin. Current Opinion in Cell Biology. 23(1), 65–70.","short":"Y. Liang, M. Hetzer, Current Opinion in Cell Biology 23 (2011) 65–70.","ama":"Liang Y, Hetzer M. Functional interactions between nucleoporins and chromatin. <i>Current Opinion in Cell Biology</i>. 2011;23(1):65-70. doi:<a href=\"https://doi.org/10.1016/j.ceb.2010.09.008\">10.1016/j.ceb.2010.09.008</a>","chicago":"Liang, Yun, and Martin Hetzer. “Functional Interactions between Nucleoporins and Chromatin.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.ceb.2010.09.008\">https://doi.org/10.1016/j.ceb.2010.09.008</a>."},"keyword":["Cell Biology"],"status":"public","volume":23,"article_processing_charge":"No","abstract":[{"lang":"eng","text":"As the gatekeepers of the eukaryotic cell nucleus, nuclear pore complexes (NPCs) mediate all molecular trafficking between the nucleoplasm and the cytoplasm. In recent years, transport-independent functions of NPC components, nucleoporins, have been identified including roles in chromatin organization and gene regulation. Here, we summarize our current view of the NPC as a dynamic hub for the integration of chromatin regulation and nuclear trafficking and discuss the functional interplay between nucleoporins and the nuclear genome."}]},{"page":"585-597","oa_version":"None","day":"18","date_updated":"2024-10-14T11:27:48Z","intvolume":"        75","date_created":"2022-04-07T07:53:18Z","external_id":{"pmid":["21502404"]},"type":"journal_article","quality_controlled":"1","pmid":1,"publication":"Cold Spring Harbor Symposia on Quantitative Biology","publication_identifier":{"issn":["0091-7451","1943-4456"],"isbn":["9781936113071"]},"title":"Nuclear pore complexes: Guardians of the nuclear genome","scopus_import":"1","publisher":"Cold Spring Harbor Laboratory Press","publication_status":"published","fulldoi":"https://doi.org/10.1101/sqb.2010.75.059","doi":"10.1101/sqb.2010.75.059","citation":{"ieee":"M. Capelson, C. Doucet, and M. Hetzer, “Nuclear pore complexes: Guardians of the nuclear genome,” <i>Cold Spring Harbor Symposia on Quantitative Biology</i>, vol. 75. Cold Spring Harbor Laboratory Press, pp. 585–597, 2011.","apa":"Capelson, M., Doucet, C., &#38; Hetzer, M. (2011). Nuclear pore complexes: Guardians of the nuclear genome. <i>Cold Spring Harbor Symposia on Quantitative Biology</i>. Cold Spring Harbor Laboratory Press. <a href=\"https://doi.org/10.1101/sqb.2010.75.059\">https://doi.org/10.1101/sqb.2010.75.059</a>","mla":"Capelson, M., et al. “Nuclear Pore Complexes: Guardians of the Nuclear Genome.” <i>Cold Spring Harbor Symposia on Quantitative Biology</i>, vol. 75, Cold Spring Harbor Laboratory Press, 2011, pp. 585–97, doi:<a href=\"https://doi.org/10.1101/sqb.2010.75.059\">10.1101/sqb.2010.75.059</a>.","chicago":"Capelson, M., C. Doucet, and Martin Hetzer. “Nuclear Pore Complexes: Guardians of the Nuclear Genome.” <i>Cold Spring Harbor Symposia on Quantitative Biology</i>. Cold Spring Harbor Laboratory Press, 2011. <a href=\"https://doi.org/10.1101/sqb.2010.75.059\">https://doi.org/10.1101/sqb.2010.75.059</a>.","ama":"Capelson M, Doucet C, Hetzer M. Nuclear pore complexes: Guardians of the nuclear genome. <i>Cold Spring Harbor Symposia on Quantitative Biology</i>. 2011;75:585-597. doi:<a href=\"https://doi.org/10.1101/sqb.2010.75.059\">10.1101/sqb.2010.75.059</a>","ista":"Capelson M, Doucet C, Hetzer M. 2011. Nuclear pore complexes: Guardians of the nuclear genome. Cold Spring Harbor Symposia on Quantitative Biology. 75, 585–597.","short":"M. Capelson, C. Doucet, M. Hetzer, Cold Spring Harbor Symposia on Quantitative Biology 75 (2011) 585–597."},"volume":75,"article_processing_charge":"No","abstract":[{"text":"Eukaryotic cell function depends on the physical separation of nucleoplasmic and cytoplasmic components by the nuclear envelope (NE). Molecular communication between the two compartments involves active, signal-mediated trafficking, a function that is exclusively performed by nuclear pore complexes (NPCs). The individual NPC components and the mechanisms that are involved in nuclear trafficking are well documented and have become textbook knowledge. However, in addition to their roles as nuclear gatekeepers, NPC components-nucleoporins-have been shown to have critical roles in chromatin organization and gene regulation. These findings have sparked new enthusiasm to study the roles of this multiprotein complex in nuclear organization and explore novel functions that in some cases appear to go beyond a role in transport. Here, we discuss our present view of NPC biogenesis, which is tightly linked to proper cell cycle progression and cell differentiation. In addition, we summarize new data suggesting that NPCs represent dynamic hubs for the integration of gene regulation and nuclear transport processes.","lang":"eng"}],"keyword":["Genetics","Molecular Biology","Biochemistry"],"status":"public","year":"2011","extern":"1","language":[{"iso":"eng"}],"_id":"11100","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"04","date_published":"2011-04-18T00:00:00Z","author":[{"full_name":"Capelson, M.","first_name":"M.","last_name":"Capelson"},{"last_name":"Doucet","full_name":"Doucet, C.","first_name":"C."},{"full_name":"HETZER, Martin W","first_name":"Martin W","orcid":"0000-0002-2111-992X","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","last_name":"HETZER"}]},{"title":"Droplet and cluster formation in freely falling granular streams","publication_status":"published","fulldoi":"https://doi.org/10.1103/PhysRevE.83.051302","publisher":"American Physical Society","quality_controlled":"1","publication":"Physical Review E","type":"journal_article","main_file_link":[{"url":"https://arxiv.org/abs/1006.1371","open_access":"1"}],"day":"12","oa_version":"Preprint","oa":1,"external_id":{"arxiv":["1006.1371"]},"intvolume":"        83","date_created":"2018-12-11T11:44:41Z","date_updated":"2021-01-12T06:48:25Z","publist_id":"7942","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Scott R","orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","last_name":"Waitukaitis"},{"full_name":"Grütjen, Helge","first_name":"Helge","last_name":"Grütjen"},{"last_name":"Royer","full_name":"Royer, John","first_name":"John"},{"first_name":"Heinrich","full_name":"Jaeger, Heinrich","last_name":"Jaeger"}],"month":"05","date_published":"2011-05-12T00:00:00Z","extern":"1","year":"2011","issue":"5","_id":"112","language":[{"iso":"eng"}],"abstract":[{"text":"Particle beams are important tools for probing atomic and molecular interactions. Here we demonstrate that particle beams also offer a unique opportunity to investigate interactions in macroscopic systems, such as granular media. Motivated by recent experiments on streams of grains that exhibit liquid-like breakup into droplets, we use molecular dynamics simulations to investigate the evolution of a dense stream of macroscopic spheres accelerating out of an opening at the bottom of a reservoir. We show how nanoscale details associated with energy dissipation during collisions modify the stream\\'s macroscopic behavior. We find that inelastic collisions collimate the stream, while the presence of short-range attractive interactions drives structure formation. Parameterizing the collision dynamics by the coefficient of restitution (i.e., the ratio of relative velocities before and after impact) and the strength of the cohesive interaction, we map out a spectrum of behaviors that ranges from gaslike jets in which all grains drift apart to liquid-like streams that break into large droplets containing hundreds of grains. We also find a new, intermediate regime in which small aggregates form by capture from the gas phase, similar to what can be observed in molecular beams. Our results show that nearly all aspects of stream behavior are closely related to the velocity gradient associated with vertical free fall. Led by this observation, we propose a simple energy balance model to explain the droplet formation process. The qualitative as well as many quantitative features of the simulations and the model compare well with available experimental data and provide a first quantitative measure of the role of attractions in freely cooling granular streams.","lang":"eng"}],"volume":83,"arxiv":1,"acknowledgement":"This work was supported by the NSF through CBET-0933242. We acknowledge use of shared facilities provided by the Keck Facility for Ultrafast Imaging at the University of Chicago and by the Chicago MRSEC through NSF DMR-0820054. Software support by Itasca Consulting Group, Inc., under the Itasca Educational Partnership is gratefully acknowledged. H.G. thanks the German-American Fulbright Commission for fellowship support during his stay at the University of Chicago.","status":"public","citation":{"ista":"Waitukaitis SR, Grütjen H, Royer J, Jaeger H. 2011. Droplet and cluster formation in freely falling granular streams. Physical Review E. 83(5), 051302.","short":"S.R. Waitukaitis, H. Grütjen, J. Royer, H. Jaeger, Physical Review E 83 (2011).","ama":"Waitukaitis SR, Grütjen H, Royer J, Jaeger H. Droplet and cluster formation in freely falling granular streams. <i>Physical Review E</i>. 2011;83(5). doi:<a href=\"https://doi.org/10.1103/PhysRevE.83.051302\">10.1103/PhysRevE.83.051302</a>","chicago":"Waitukaitis, Scott R, Helge Grütjen, John Royer, and Heinrich Jaeger. “Droplet and Cluster Formation in Freely Falling Granular Streams.” <i>Physical Review E</i>. American Physical Society, 2011. <a href=\"https://doi.org/10.1103/PhysRevE.83.051302\">https://doi.org/10.1103/PhysRevE.83.051302</a>.","mla":"Waitukaitis, Scott R., et al. “Droplet and Cluster Formation in Freely Falling Granular Streams.” <i>Physical Review E</i>, vol. 83, no. 5, 051302, American Physical Society, 2011, doi:<a href=\"https://doi.org/10.1103/PhysRevE.83.051302\">10.1103/PhysRevE.83.051302</a>.","apa":"Waitukaitis, S. R., Grütjen, H., Royer, J., &#38; Jaeger, H. (2011). Droplet and cluster formation in freely falling granular streams. <i>Physical Review E</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevE.83.051302\">https://doi.org/10.1103/PhysRevE.83.051302</a>","ieee":"S. R. Waitukaitis, H. Grütjen, J. Royer, and H. Jaeger, “Droplet and cluster formation in freely falling granular streams,” <i>Physical Review E</i>, vol. 83, no. 5. American Physical Society, 2011."},"doi":"10.1103/PhysRevE.83.051302","article_number":"051302"},{"day":"01","oa_version":"None","date_updated":"2024-11-06T12:07:30Z","date_created":"2022-07-27T13:48:11Z","intvolume":"         5","title":"A comprehensive study of features and algorithms for URL-based topic classification","scopus_import":"1","publication_status":"published","fulldoi":"https://doi.org/10.1145/1993053.1993057","publisher":"Association for Computing Machinery","publication":"ACM Transactions on the Web","quality_controlled":"1","type":"journal_article","publication_identifier":{"issn":["1559-1131"],"eissn":["1559-114X"]},"abstract":[{"lang":"eng","text":"Given only the URL of a Web page, can we identify its topic? We study this problem in detail by exploring a large number of different feature sets and algorithms on several datasets. We also show that the inherent overlap between topics and the sparsity of the information in URLs makes this a very challenging problem. Web page classification without a page’s content is desirable when the content is not available at all, when a classification is needed before obtaining the content, or when classification speed is of utmost importance. For our experiments we used five different corpora comprising a total of about 3 million (URL, classification) pairs. We evaluated several techniques for feature generation and classification algorithms. The individual binary classifiers were then combined via boosting into metabinary classifiers. We achieve typical F-measure values between 80 and 85, and a typical precision of around 86. The precision can be pushed further over 90 while maintaining a typical level of recall between 30 and 40."}],"volume":5,"article_processing_charge":"No","status":"public","keyword":["Topic classification","URL","ODP"],"article_number":"15","citation":{"apa":"Baykan, E., Henzinger, M., Marian, L., &#38; Weber, I. (2011). A comprehensive study of features and algorithms for URL-based topic classification. <i>ACM Transactions on the Web</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/1993053.1993057\">https://doi.org/10.1145/1993053.1993057</a>","mla":"Baykan, Eda, et al. “A Comprehensive Study of Features and Algorithms for URL-Based Topic Classification.” <i>ACM Transactions on the Web</i>, vol. 5, no. 3, 15, Association for Computing Machinery, 2011, doi:<a href=\"https://doi.org/10.1145/1993053.1993057\">10.1145/1993053.1993057</a>.","ieee":"E. Baykan, M. Henzinger, L. Marian, and I. Weber, “A comprehensive study of features and algorithms for URL-based topic classification,” <i>ACM Transactions on the Web</i>, vol. 5, no. 3. Association for Computing Machinery, 2011.","ista":"Baykan E, Henzinger M, Marian L, Weber I. 2011. A comprehensive study of features and algorithms for URL-based topic classification. ACM Transactions on the Web. 5(3), 15.","short":"E. Baykan, M. Henzinger, L. Marian, I. Weber, ACM Transactions on the Web 5 (2011).","chicago":"Baykan, Eda, Monika Henzinger, Ludmila Marian, and Ingmar Weber. “A Comprehensive Study of Features and Algorithms for URL-Based Topic Classification.” <i>ACM Transactions on the Web</i>. Association for Computing Machinery, 2011. <a href=\"https://doi.org/10.1145/1993053.1993057\">https://doi.org/10.1145/1993053.1993057</a>.","ama":"Baykan E, Henzinger M, Marian L, Weber I. A comprehensive study of features and algorithms for URL-based topic classification. <i>ACM Transactions on the Web</i>. 2011;5(3). doi:<a href=\"https://doi.org/10.1145/1993053.1993057\">10.1145/1993053.1993057</a>"},"doi":"10.1145/1993053.1993057","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","date_published":"2011-07-01T00:00:00Z","month":"07","author":[{"last_name":"Baykan","first_name":"Eda","full_name":"Baykan, Eda"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger"},{"first_name":"Ludmila","full_name":"Marian, Ludmila","last_name":"Marian"},{"last_name":"Weber","full_name":"Weber, Ingmar","first_name":"Ingmar"}],"year":"2011","issue":"3","extern":"1","language":[{"iso":"eng"}],"_id":"11673"},{"page":"178-183","date_updated":"2024-11-06T12:09:49Z","date_created":"2022-08-08T11:33:03Z","intvolume":"       111","day":"15","oa_version":"None","publication":"Information Processing Letters","quality_controlled":"1","type":"journal_article","publication_identifier":{"issn":["0020-0190"]},"scopus_import":"1","publication_status":"published","fulldoi":"https://doi.org/10.1016/j.ipl.2010.11.022","publisher":"Elsevier","title":"Offline file assignments for online load balancing","citation":{"chicago":"Dütting, Paul, Monika Henzinger, and Ingmar Weber. “Offline File Assignments for Online Load Balancing.” <i>Information Processing Letters</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.ipl.2010.11.022\">https://doi.org/10.1016/j.ipl.2010.11.022</a>.","ama":"Dütting P, Henzinger M, Weber I. Offline file assignments for online load balancing. <i>Information Processing Letters</i>. 2011;111(4):178-183. doi:<a href=\"https://doi.org/10.1016/j.ipl.2010.11.022\">10.1016/j.ipl.2010.11.022</a>","ista":"Dütting P, Henzinger M, Weber I. 2011. Offline file assignments for online load balancing. Information Processing Letters. 111(4), 178–183.","short":"P. Dütting, M. Henzinger, I. Weber, Information Processing Letters 111 (2011) 178–183.","ieee":"P. Dütting, M. Henzinger, and I. Weber, “Offline file assignments for online load balancing,” <i>Information Processing Letters</i>, vol. 111, no. 4. Elsevier, pp. 178–183, 2011.","apa":"Dütting, P., Henzinger, M., &#38; Weber, I. (2011). Offline file assignments for online load balancing. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ipl.2010.11.022\">https://doi.org/10.1016/j.ipl.2010.11.022</a>","mla":"Dütting, Paul, et al. “Offline File Assignments for Online Load Balancing.” <i>Information Processing Letters</i>, vol. 111, no. 4, Elsevier, 2011, pp. 178–83, doi:<a href=\"https://doi.org/10.1016/j.ipl.2010.11.022\">10.1016/j.ipl.2010.11.022</a>."},"doi":"10.1016/j.ipl.2010.11.022","status":"public","abstract":[{"lang":"eng","text":"We study a novel load balancing problem that arises in web search engines. The problem is a combination of an offline assignment problem, where files need to be (copied and) assigned to machines, and an online load balancing problem, where requests ask for specific files and need to be assigned to a corresponding machine, whose load is increased\r\nby this. We present simple deterministic algorithms for this problem and exhibit an interesting trade-off between the available space to make file copies and the obtainable makespan. We also give non-trivial lower bounds for a large class of deterministic algorithms and present a randomized algorithm that beats these bounds with high probability."}],"volume":111,"article_processing_charge":"No","language":[{"iso":"eng"}],"_id":"11760","year":"2011","issue":"4","extern":"1","date_published":"2011-01-15T00:00:00Z","month":"01","author":[{"last_name":"Dütting","full_name":"Dütting, Paul","first_name":"Paul"},{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"last_name":"Weber","full_name":"Weber, Ingmar","first_name":"Ingmar"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original"},{"oa_version":"None","day":"01","date_created":"2022-08-11T11:51:39Z","intvolume":"      6942","date_updated":"2024-11-06T12:13:02Z","page":"192–202","title":"Multi-parameter mechanism design under budget and matroid constraints","publisher":"Springer Nature","fulldoi":"https://doi.org/10.1007/978-3-642-23719-5_17","publication_status":"published","scopus_import":"1","publication_identifier":{"isbn":["9783642237188"],"issn":["1611-3349"]},"type":"conference","publication":"19th Annual European Symposium on Algorithms","quality_controlled":"1","article_processing_charge":"No","volume":6942,"abstract":[{"lang":"eng","text":"The design of truthful auctions that approximate the optimal expected revenue is a central problem in algorithmic mechanism design. 30 years after Myerson’s characterization of Bayesian optimal auctions in single-parameter domains [8], characterizing but also providing efficient mechanisms for multi-parameter domains still remains a very important unsolved problem. Our work improves upon recent results in this area, introducing new techniques for tackling the problem, while also combining and extending recently introduced tools.\r\n\r\nIn particular we give the first approximation algorithms for Bayesian auctions with multiple heterogeneous items when bidders have additive valuations, budget constraints and general matroid feasibility constraints."}],"status":"public","doi":"10.1007/978-3-642-23719-5_17","citation":{"ieee":"M. Henzinger and A. Vidali, “Multi-parameter mechanism design under budget and matroid constraints,” in <i>19th Annual European Symposium on Algorithms</i>, Saarbrücken, Germany, 2011, vol. 6942, pp. 192–202.","mla":"Henzinger, Monika, and Angelina Vidali. “Multi-Parameter Mechanism Design under Budget and Matroid Constraints.” <i>19th Annual European Symposium on Algorithms</i>, vol. 6942, Springer Nature, 2011, pp. 192–202, doi:<a href=\"https://doi.org/10.1007/978-3-642-23719-5_17\">10.1007/978-3-642-23719-5_17</a>.","apa":"Henzinger, M., &#38; Vidali, A. (2011). Multi-parameter mechanism design under budget and matroid constraints. In <i>19th Annual European Symposium on Algorithms</i> (Vol. 6942, pp. 192–202). Saarbrücken, Germany: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-23719-5_17\">https://doi.org/10.1007/978-3-642-23719-5_17</a>","ama":"Henzinger M, Vidali A. Multi-parameter mechanism design under budget and matroid constraints. In: <i>19th Annual European Symposium on Algorithms</i>. Vol 6942. Springer Nature; 2011:192–202. doi:<a href=\"https://doi.org/10.1007/978-3-642-23719-5_17\">10.1007/978-3-642-23719-5_17</a>","chicago":"Henzinger, Monika, and Angelina Vidali. “Multi-Parameter Mechanism Design under Budget and Matroid Constraints.” In <i>19th Annual European Symposium on Algorithms</i>, 6942:192–202. Springer Nature, 2011. <a href=\"https://doi.org/10.1007/978-3-642-23719-5_17\">https://doi.org/10.1007/978-3-642-23719-5_17</a>.","short":"M. Henzinger, A. Vidali, in:, 19th Annual European Symposium on Algorithms, Springer Nature, 2011, pp. 192–202.","ista":"Henzinger M, Vidali A. 2011. Multi-parameter mechanism design under budget and matroid constraints. 19th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LNCS, vol. 6942, 192–202."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"author":[{"orcid":"0000-0002-5008-6530","first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Vidali, Angelina","first_name":"Angelina","last_name":"Vidali"}],"conference":{"name":"ESA: European Symposium on Algorithms","location":"Saarbrücken, Germany","end_date":"2011-09-09","start_date":"2011-09-05"},"month":"09","date_published":"2011-09-01T00:00:00Z","extern":"1","year":"2011","_id":"11796","language":[{"iso":"eng"}]},{"scopus_import":"1","date_published":"2011-04-01T00:00:00Z","month":"04","publisher":"Association for Computing Machinery","author":[{"full_name":"Dütting, Paul","first_name":"Paul","last_name":"Dütting"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"last_name":"Weber","first_name":"Ingmar","full_name":"Weber, Ingmar"}],"fulldoi":"https://doi.org/10.1145/1963405.1963427","publication_status":"published","conference":{"name":"WWW: International Conference on World Wide Web","location":"Hyderabad, India","end_date":"2011-04-01","start_date":"2011-03-28"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"An expressive mechanism for auctions on the web","language":[{"iso":"eng"}],"_id":"11864","type":"conference","quality_controlled":"1","publication":"Proceedings of the 20th international conference on World wide web","year":"2011","extern":"1","publication_identifier":{"isbn":["978-145030632-4"]},"date_updated":"2024-11-06T12:19:04Z","date_created":"2022-08-16T09:05:34Z","status":"public","oa_version":"None","day":"01","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Auctions are widely used on the Web. Applications range from internet advertising to platforms such as eBay. In most of these applications the auctions in use are single/multi-item auctions with unit demand. The main drawback of standard mechanisms for this type of auctions, such as VCG and GSP, is the limited expressiveness that they offer to the bidders. The General Auction Mechanism (GAM) of [1] is taking a first step towards addressing the problem of limited expressiveness by computing a bidder optimal, envy free outcome for linear utility functions with identical slopes and a single discontinuity per bidder-item pair. We show that in many practical situations this does not suffice to adequately model the preferences of the bidders, and we overcome this problem by presenting the first mechanism for piece-wise linear utility functions with non-identical slopes and multiple discontinuities. Our mechanism runs in polynomial time. Like GAM it is incentive compatible for inputs that fulfill a certain non-degeneracy requirement, but our requirement is more general than the requirement of GAM. For discontinuous utility functions that are non-degenerate as well as for continuous utility functions the outcome of our mechanism is a competitive equilibrium. We also show how our mechanism can be used to compute approximately bidder optimal, envy free outcomes for a general class of continuous utility functions via piece-wise linear approximation. Finally, we prove hardness results for even more expressive settings."}],"page":"127 - 136","doi":"10.1145/1963405.1963427","citation":{"ista":"Dütting P, Henzinger M, Weber I. 2011. An expressive mechanism for auctions on the web. Proceedings of the 20th international conference on World wide web. WWW: International Conference on World Wide Web, 127–136.","short":"P. Dütting, M. Henzinger, I. Weber, in:, Proceedings of the 20th International Conference on World Wide Web, Association for Computing Machinery, 2011, pp. 127–136.","chicago":"Dütting, Paul, Monika Henzinger, and Ingmar Weber. “An Expressive Mechanism for Auctions on the Web.” In <i>Proceedings of the 20th International Conference on World Wide Web</i>, 127–36. Association for Computing Machinery, 2011. <a href=\"https://doi.org/10.1145/1963405.1963427\">https://doi.org/10.1145/1963405.1963427</a>.","ama":"Dütting P, Henzinger M, Weber I. An expressive mechanism for auctions on the web. In: <i>Proceedings of the 20th International Conference on World Wide Web</i>. Association for Computing Machinery; 2011:127-136. doi:<a href=\"https://doi.org/10.1145/1963405.1963427\">10.1145/1963405.1963427</a>","apa":"Dütting, P., Henzinger, M., &#38; Weber, I. (2011). An expressive mechanism for auctions on the web. In <i>Proceedings of the 20th international conference on World wide web</i> (pp. 127–136). Hyderabad, India: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/1963405.1963427\">https://doi.org/10.1145/1963405.1963427</a>","mla":"Dütting, Paul, et al. “An Expressive Mechanism for Auctions on the Web.” <i>Proceedings of the 20th International Conference on World Wide Web</i>, Association for Computing Machinery, 2011, pp. 127–36, doi:<a href=\"https://doi.org/10.1145/1963405.1963427\">10.1145/1963405.1963427</a>.","ieee":"P. Dütting, M. Henzinger, and I. Weber, “An expressive mechanism for auctions on the web,” in <i>Proceedings of the 20th international conference on World wide web</i>, Hyderabad, India, 2011, pp. 127–136."}},{"month":"04","date_published":"2011-04-25T00:00:00Z","author":[{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","first_name":"Mikhail","orcid":"0000-0002-6990-7802","full_name":"Mikhail Lemeshko"},{"full_name":"Mustafa, Mustafa K","first_name":"Mustafa","last_name":"Mustafa"},{"first_name":"Sabre","full_name":"Kais, Sabre","last_name":"Kais"},{"full_name":"Friedrich, Břetislav","first_name":"Břetislav","last_name":"Friedrich"}],"publisher":"American Physical Society","fulldoi":"https://doi.org/10.1103/PhysRevA.83.043415","publication_status":"published","title":"Supersymmetric factorization yields exact solutions to the molecular Stark-effect problem for &quot;stretched&quot; states","_id":"2199","issue":"4","type":"journal_article","publication":"Physical Review A - Atomic, Molecular, and Optical Physics","year":"2011","quality_controlled":0,"extern":1,"date_updated":"2021-01-12T06:55:56Z","date_created":"2018-12-11T11:56:17Z","intvolume":"        83","status":"public","oa":1,"acknowledgement":"ARO ","day":"25","volume":83,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1105.5262"}],"abstract":[{"lang":"eng","text":"By invoking supersymmetry, we found a condition under which the Stark-effect problem for a polar and polarizable molecule subject to nonresonant electric fields becomes exactly solvable for the family of stretched states. The analytic expressions for the wave function and eigenenergy and other expectation values allow one to readily reverse-engineer the problem of finding the values of the interaction parameters required for creating quantum states with preordained characteristics. The method also allows the construction of families of isospectral potentials, realizable with combined fields."}],"publist_id":"4776","doi":"10.1103/PhysRevA.83.043415","citation":{"apa":"Lemeshko, M., Mustafa, M., Kais, S., &#38; Friedrich, B. (2011). Supersymmetric factorization yields exact solutions to the molecular Stark-effect problem for &#38;quot;stretched&#38;quot; states. <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.83.043415\">https://doi.org/10.1103/PhysRevA.83.043415</a>","mla":"Lemeshko, Mikhail, et al. “Supersymmetric Factorization Yields Exact Solutions to the Molecular Stark-Effect Problem for &#38;quot;Stretched&#38;quot; States.” <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>, vol. 83, no. 4, American Physical Society, 2011, doi:<a href=\"https://doi.org/10.1103/PhysRevA.83.043415\">10.1103/PhysRevA.83.043415</a>.","ieee":"M. Lemeshko, M. Mustafa, S. Kais, and B. Friedrich, “Supersymmetric factorization yields exact solutions to the molecular Stark-effect problem for &#38;quot;stretched&#38;quot; states,” <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>, vol. 83, no. 4. American Physical Society, 2011.","ista":"Lemeshko M, Mustafa M, Kais S, Friedrich B. 2011. Supersymmetric factorization yields exact solutions to the molecular Stark-effect problem for &#38;quot;stretched&#38;quot; states. Physical Review A - Atomic, Molecular, and Optical Physics. 83(4).","short":"M. Lemeshko, M. Mustafa, S. Kais, B. Friedrich, Physical Review A - Atomic, Molecular, and Optical Physics 83 (2011).","chicago":"Lemeshko, Mikhail, Mustafa Mustafa, Sabre Kais, and Břetislav Friedrich. “Supersymmetric Factorization Yields Exact Solutions to the Molecular Stark-Effect Problem for &#38;quot;Stretched&#38;quot; States.” <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>. American Physical Society, 2011. <a href=\"https://doi.org/10.1103/PhysRevA.83.043415\">https://doi.org/10.1103/PhysRevA.83.043415</a>.","ama":"Lemeshko M, Mustafa M, Kais S, Friedrich B. Supersymmetric factorization yields exact solutions to the molecular Stark-effect problem for &#38;quot;stretched&#38;quot; states. <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>. 2011;83(4). doi:<a href=\"https://doi.org/10.1103/PhysRevA.83.043415\">10.1103/PhysRevA.83.043415</a>"}},{"_id":"2200","language":[{"iso":"eng"}],"extern":"1","type":"journal_article","publication":"New Journal of Physics","year":"2011","publisher":"IOP Publishing Ltd.","author":[{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","first_name":"Mikhail","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail"},{"first_name":"Mustafa","full_name":"Mustafa, Mustafa","last_name":"Mustafa"},{"last_name":"Kais","full_name":"Kais, Sabre","first_name":"Sabre"},{"full_name":"Friedrich, Břetislav","first_name":"Břetislav","last_name":"Friedrich"}],"publication_status":"published","fulldoi":"https://doi.org/10.1088/1367-2630/13/6/063036","date_published":"2011-06-20T00:00:00Z","month":"06","title":"Supersymmetry identifies molecular Stark states whose eigenproperties can be obtained analytically","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1088/1367-2630/13/6/063036","ddc":["530"],"citation":{"ieee":"M. Lemeshko, M. Mustafa, S. Kais, and B. Friedrich, “Supersymmetry identifies molecular Stark states whose eigenproperties can be obtained analytically,” <i>New Journal of Physics</i>, vol. 13. IOP Publishing Ltd., 2011.","apa":"Lemeshko, M., Mustafa, M., Kais, S., &#38; Friedrich, B. (2011). Supersymmetry identifies molecular Stark states whose eigenproperties can be obtained analytically. <i>New Journal of Physics</i>. IOP Publishing Ltd. <a href=\"https://doi.org/10.1088/1367-2630/13/6/063036\">https://doi.org/10.1088/1367-2630/13/6/063036</a>","mla":"Lemeshko, Mikhail, et al. “Supersymmetry Identifies Molecular Stark States Whose Eigenproperties Can Be Obtained Analytically.” <i>New Journal of Physics</i>, vol. 13, IOP Publishing Ltd., 2011, doi:<a href=\"https://doi.org/10.1088/1367-2630/13/6/063036\">10.1088/1367-2630/13/6/063036</a>.","chicago":"Lemeshko, Mikhail, Mustafa Mustafa, Sabre Kais, and Břetislav Friedrich. “Supersymmetry Identifies Molecular Stark States Whose Eigenproperties Can Be Obtained Analytically.” <i>New Journal of Physics</i>. IOP Publishing Ltd., 2011. <a href=\"https://doi.org/10.1088/1367-2630/13/6/063036\">https://doi.org/10.1088/1367-2630/13/6/063036</a>.","ama":"Lemeshko M, Mustafa M, Kais S, Friedrich B. Supersymmetry identifies molecular Stark states whose eigenproperties can be obtained analytically. <i>New Journal of Physics</i>. 2011;13. doi:<a href=\"https://doi.org/10.1088/1367-2630/13/6/063036\">10.1088/1367-2630/13/6/063036</a>","ista":"Lemeshko M, Mustafa M, Kais S, Friedrich B. 2011. Supersymmetry identifies molecular Stark states whose eigenproperties can be obtained analytically. New Journal of Physics. 13.","short":"M. Lemeshko, M. Mustafa, S. Kais, B. Friedrich, New Journal of Physics 13 (2011)."},"publist_id":"4774","date_created":"2018-12-11T11:56:17Z","intvolume":"        13","status":"public","date_updated":"2026-06-18T18:32:53Z","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1106.4402 "}],"volume":13,"abstract":[{"lang":"eng","text":"We made use of supersymmetric (SUSY) quantum mechanics to find the condition under which the Stark effect problem for a polar and polarizable closed-shell diatomic molecule subjected to collinear electrostatic and nonresonant radiative fields becomes exactly solvable. The condition Δω = ω2/4(m+1)2 connects values of the dimensionless parameters ω and Δω that characterize the strengths of the permanent and induced dipole interactions of the molecule with the respective fields. The exact solutions are obtained for the \\J̃ = m, m; ω, Δω) family of 'stretched' states. The field-free and strong-field limits of the combined-fields problem were found to exhibit supersymmetry and shape invariance, which is indeed the reason why they are analytically solvable. By making use of the analytic form of the \\J̃ = m,m; ω, Δω) wavefunctions, we obtained simple formulae for the expectation values of the space-fixed electric dipole moment, the alignment cosine and the angular momentum squared, and derived a 'sum rule' that combines the above expectation values into a formula for the eigenenergy. The analytic expressions for the characteristics of the strongly oriented and aligned states provide direct access to the values of the interaction parameters required for creating such states in the laboratory."}],"oa":1,"oa_version":"None","acknowledgement":"SK thanks the ARO for financial support","day":"20"},{"citation":{"ista":"Killip R, Vişan M. 2011. The defocusing energy-supercritical nonlinear wave equation in three space dimensions. Transactions of the American Mathematical Society. 363(7), 3893–3893.","short":"R. Killip, M. Vişan, Transactions of the American Mathematical Society 363 (2011) 3893–3893.","chicago":"Killip, Rowan, and Monica Vişan. “The Defocusing Energy-Supercritical Nonlinear Wave Equation in Three Space Dimensions.” <i>Transactions of the American Mathematical Society</i>. American Mathematical Society, 2011. <a href=\"https://doi.org/10.1090/s0002-9947-2011-05400-0\">https://doi.org/10.1090/s0002-9947-2011-05400-0</a>.","ama":"Killip R, Vişan M. The defocusing energy-supercritical nonlinear wave equation in three space dimensions. <i>Transactions of the American Mathematical Society</i>. 2011;363(7):3893-3893. doi:<a href=\"https://doi.org/10.1090/s0002-9947-2011-05400-0\">10.1090/s0002-9947-2011-05400-0</a>","apa":"Killip, R., &#38; Vişan, M. (2011). The defocusing energy-supercritical nonlinear wave equation in three space dimensions. <i>Transactions of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/s0002-9947-2011-05400-0\">https://doi.org/10.1090/s0002-9947-2011-05400-0</a>","mla":"Killip, Rowan, and Monica Vişan. “The Defocusing Energy-Supercritical Nonlinear Wave Equation in Three Space Dimensions.” <i>Transactions of the American Mathematical Society</i>, vol. 363, no. 7, American Mathematical Society, 2011, pp. 3893–3893, doi:<a href=\"https://doi.org/10.1090/s0002-9947-2011-05400-0\">10.1090/s0002-9947-2011-05400-0</a>.","ieee":"R. Killip and M. Vişan, “The defocusing energy-supercritical nonlinear wave equation in three space dimensions,” <i>Transactions of the American Mathematical Society</i>, vol. 363, no. 7. American Mathematical Society, pp. 3893–3893, 2011."},"doi":"10.1090/s0002-9947-2011-05400-0","status":"public","arxiv":1,"abstract":[{"text":"We consider the defocusing nonlinear wave equation (mathematical formular) in the energy-supercritical regime p > 4. For even values of the power p, we show that blowup (or failure to scatter) must be accompanied by blowup of the critical Sobolev norm. An equivalent formulation is that solutions with bounded critical Sobolev norm are global and scatter. The impetus to consider this problem comes from recent work of Kenig and Merle who treated the case of spherically-symmetric solutions.","lang":"eng"}],"volume":363,"article_processing_charge":"No","language":[{"iso":"eng"}],"_id":"22040","OA_type":"green","year":"2011","issue":"7","extern":"1","date_published":"2011-01-28T00:00:00Z","month":"01","author":[{"last_name":"Killip","full_name":"Killip, Rowan","first_name":"Rowan"},{"full_name":"Visan, Monica","first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","last_name":"Visan"}],"article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"3893-3893","das_tickbox":"1","date_updated":"2026-06-22T13:18:01Z","external_id":{"arxiv":["1001.1761"]},"intvolume":"       363","date_created":"2026-06-19T07:45:31Z","day":"28","oa_version":"Preprint","oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1001.1761","open_access":"1"}],"publication":"Transactions of the American Mathematical Society","quality_controlled":"1","type":"journal_article","publication_identifier":{"issn":["0002-9947"],"eissn":["1088-6850"]},"scopus_import":"1","OA_place":"repository","fulldoi":"https://doi.org/10.1090/s0002-9947-2011-05400-0","publication_status":"published","publisher":"American Mathematical Society","title":"The defocusing energy-supercritical nonlinear wave equation in three space dimensions"},{"extern":1,"issue":"1","type":"review","year":"2011","quality_controlled":0,"publication":"Cell","_id":"2312","title":"Modeling human disease in humans: The ciliopathies","author":[{"last_name":"Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7673-7178","first_name":"Gaia","full_name":"Gaia Novarino"},{"full_name":"Akizu, Naiara","first_name":"Naiara","last_name":"Akizu"},{"last_name":"Gleeson","full_name":"Gleeson, Joseph G","first_name":"Joseph"}],"publisher":"Cell Press","publication_status":"published","fulldoi":"https://doi.org/10.1016/j.cell.2011.09.014","month":"01","date_published":"2011-01-01T00:00:00Z","doi":"10.1016/j.cell.2011.09.014","citation":{"ama":"Novarino G, Akizu N, Gleeson J. Modeling human disease in humans: The ciliopathies. <i>Cell</i>. 2011;147(1):70-79. doi:<a href=\"https://doi.org/10.1016/j.cell.2011.09.014\">10.1016/j.cell.2011.09.014</a>","chicago":"Novarino, Gaia, Naiara Akizu, and Joseph Gleeson. “Modeling Human Disease in Humans: The Ciliopathies.” <i>Cell</i>. Cell Press, 2011. <a href=\"https://doi.org/10.1016/j.cell.2011.09.014\">https://doi.org/10.1016/j.cell.2011.09.014</a>.","short":"G. Novarino, N. Akizu, J. Gleeson, Cell 147 (2011) 70–79.","ista":"Novarino G, Akizu N, Gleeson J. 2011. Modeling human disease in humans: The ciliopathies. Cell. 147(1), 70–79.","ieee":"G. Novarino, N. Akizu, and J. Gleeson, “Modeling human disease in humans: The ciliopathies,” <i>Cell</i>, vol. 147, no. 1. Cell Press, pp. 70–79, 2011.","mla":"Novarino, Gaia, et al. “Modeling Human Disease in Humans: The Ciliopathies.” <i>Cell</i>, vol. 147, no. 1, Cell Press, 2011, pp. 70–79, doi:<a href=\"https://doi.org/10.1016/j.cell.2011.09.014\">10.1016/j.cell.2011.09.014</a>.","apa":"Novarino, G., Akizu, N., &#38; Gleeson, J. (2011). Modeling human disease in humans: The ciliopathies. <i>Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cell.2011.09.014\">https://doi.org/10.1016/j.cell.2011.09.014</a>"},"publist_id":"4615","page":"70 - 79","volume":147,"abstract":[{"lang":"eng","text":"Soon, the genetic basis of most human Mendelian diseases will be solved. The next challenge will be to leverage this information to uncover basic mechanisms of disease and develop new therapies. To understand how this transformation is already beginning to unfold, we focus on the ciliopathies, a class of multi-organ diseases caused by disruption of the primary cilium. Through a convergence of data involving mutant gene discovery, proteomics, and cell biology, more than a dozen phenotypically distinguishable conditions are now united as ciliopathies. Sitting at the interface between simple and complex genetic conditions, these diseases provide clues to the future direction of human genetics."}],"day":"01","date_created":"2018-12-11T11:56:55Z","intvolume":"       147","status":"public","date_updated":"2019-04-26T07:22:10Z"},{"conference":{"name":"QMath: Mathematical Results in Quantum Physics"},"fulldoi":"https://doi.org/10.1142/9789814350365_0002","publication_status":"published","publisher":"World Scientific Publishing","author":[{"full_name":"Frank, Rupert L","first_name":"Rupert","last_name":"Frank"},{"first_name":"Élliott","full_name":"Lieb, Élliott H","last_name":"Lieb"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521","full_name":"Robert Seiringer"},{"last_name":"Thomas","first_name":"Lawrence","full_name":"Thomas, Lawrence E"}],"date_published":"2011-05-26T00:00:00Z","month":"05","title":"Binding, stability, and non-binding of multi-polaron systems","_id":"2320","extern":1,"year":"2011","quality_controlled":0,"type":"conference","status":"public","date_created":"2018-12-11T11:56:58Z","date_updated":"2021-01-12T06:56:45Z","abstract":[{"text":"The binding of polarons, or its absence, is an old and subtle topic. After defining the model we state some recent theorems of ours. First, the transition from many-body collapse to the existence of a thermodynamic limit for N polarons occurs precisely at U = 2α, where U is the electronic Coulomb repulsion and α is the polaron coupling constant. Second, if U is large enough, there is no multi-polaron binding of any kind. We also discuss the Pekar-Tomasevich approximation to the ground state energy, which is valid for large α. Finally, we derive exact results, not reported before, about the one-dimensional toy model introduced by E. P. Gross.","lang":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1010.0737","open_access":"1"}],"day":"26","oa":1,"page":"21 - 32","citation":{"short":"R. Frank, É. Lieb, R. Seiringer, L. Thomas, in:, World Scientific Publishing, 2011, pp. 21–32.","ista":"Frank R, Lieb É, Seiringer R, Thomas L. 2011. Binding, stability, and non-binding of multi-polaron systems. QMath: Mathematical Results in Quantum Physics, 21–32.","chicago":"Frank, Rupert, Élliott Lieb, Robert Seiringer, and Lawrence Thomas. “Binding, Stability, and Non-Binding of Multi-Polaron Systems,” 21–32. World Scientific Publishing, 2011. <a href=\"https://doi.org/10.1142/9789814350365_0002\">https://doi.org/10.1142/9789814350365_0002</a>.","ama":"Frank R, Lieb É, Seiringer R, Thomas L. Binding, stability, and non-binding of multi-polaron systems. In: World Scientific Publishing; 2011:21-32. doi:<a href=\"https://doi.org/10.1142/9789814350365_0002\">10.1142/9789814350365_0002</a>","apa":"Frank, R., Lieb, É., Seiringer, R., &#38; Thomas, L. (2011). Binding, stability, and non-binding of multi-polaron systems (pp. 21–32). Presented at the QMath: Mathematical Results in Quantum Physics, World Scientific Publishing. <a href=\"https://doi.org/10.1142/9789814350365_0002\">https://doi.org/10.1142/9789814350365_0002</a>","mla":"Frank, Rupert, et al. <i>Binding, Stability, and Non-Binding of Multi-Polaron Systems</i>. World Scientific Publishing, 2011, pp. 21–32, doi:<a href=\"https://doi.org/10.1142/9789814350365_0002\">10.1142/9789814350365_0002</a>.","ieee":"R. Frank, É. Lieb, R. Seiringer, and L. Thomas, “Binding, stability, and non-binding of multi-polaron systems,” presented at the QMath: Mathematical Results in Quantum Physics, 2011, pp. 21–32."},"doi":"10.1142/9789814350365_0002","publist_id":"4607"},{"publist_id":"4606","citation":{"chicago":"Frank, Rupert, Ari Laptev, and Robert Seiringer. “ A Sharp Bound on Eigenvalues of Schrödinger Operators on the Halfline with Complex-Valued Potentials,” 214:39–44. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-7643-9994-8_3\">https://doi.org/10.1007/978-3-7643-9994-8_3</a>.","ama":"Frank R, Laptev A, Seiringer R.  A sharp bound on eigenvalues of Schrödinger operators on the halfline with complex-valued potentials. In: Vol 214. Springer; 2011:39-44. doi:<a href=\"https://doi.org/10.1007/978-3-7643-9994-8_3\">10.1007/978-3-7643-9994-8_3</a>","ista":"Frank R, Laptev A, Seiringer R. 2011.  A sharp bound on eigenvalues of Schrödinger operators on the halfline with complex-valued potentials. OTAMP: Operator Theory, Analysis and Mathematical Physics, Operator Theory: Advances and Applications, vol. 214, 39–44.","short":"R. Frank, A. Laptev, R. Seiringer, in:, Springer, 2011, pp. 39–44.","ieee":"R. Frank, A. Laptev, and R. Seiringer, “ A sharp bound on eigenvalues of Schrödinger operators on the halfline with complex-valued potentials,” presented at the OTAMP: Operator Theory, Analysis and Mathematical Physics, 2011, vol. 214, pp. 39–44.","apa":"Frank, R., Laptev, A., &#38; Seiringer, R. (2011).  A sharp bound on eigenvalues of Schrödinger operators on the halfline with complex-valued potentials (Vol. 214, pp. 39–44). Presented at the OTAMP: Operator Theory, Analysis and Mathematical Physics, Springer. <a href=\"https://doi.org/10.1007/978-3-7643-9994-8_3\">https://doi.org/10.1007/978-3-7643-9994-8_3</a>","mla":"Frank, Rupert, et al. <i> A Sharp Bound on Eigenvalues of Schrödinger Operators on the Halfline with Complex-Valued Potentials</i>. Vol. 214, Springer, 2011, pp. 39–44, doi:<a href=\"https://doi.org/10.1007/978-3-7643-9994-8_3\">10.1007/978-3-7643-9994-8_3</a>."},"doi":"10.1007/978-3-7643-9994-8_3","page":"39 - 44","day":"31","oa":1,"abstract":[{"lang":"eng","text":"We derive a sharp bound on the location of non-positive eigenvalues of Schrödinger operators on the half-line with complex-valued potentials."}],"volume":214,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/0903.2053"}],"date_updated":"2021-01-12T06:56:46Z","status":"public","intvolume":"       214","date_created":"2018-12-11T11:56:59Z","year":"2011","quality_controlled":0,"type":"conference","extern":1,"_id":"2321","title":" A sharp bound on eigenvalues of Schrödinger operators on the halfline with complex-valued potentials","date_published":"2011-03-31T00:00:00Z","month":"03","conference":{"name":"OTAMP: Operator Theory, Analysis and Mathematical Physics"},"fulldoi":"https://doi.org/10.1007/978-3-7643-9994-8_3","publication_status":"published","publisher":"Springer","author":[{"last_name":"Frank","first_name":"Rupert","full_name":"Frank, Rupert L"},{"last_name":"Laptev","full_name":"Laptev, Ari","first_name":"Ari"},{"first_name":"Robert","orcid":"0000-0002-6781-0521","full_name":"Robert Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer"}],"alternative_title":["Operator Theory: Advances and Applications"]},{"date_updated":"2021-01-12T06:56:49Z","status":"public","date_created":"2018-12-11T11:45:21Z","intvolume":"        96","day":"19","acknowledgement":"EP/E053262/1\tEngineering and Physical Sciences Research Council","abstract":[{"text":"For an irreducible polynomial in at most two variables the problem of representing power-free integers is investigated. ","lang":"eng"}],"volume":96,"page":"139 - 150","publist_id":"7670","citation":{"short":"T.D. Browning, Archiv Der Mathematik 96 (2011) 139–150.","ista":"Browning TD. 2011. Power-free values of polynomials. Archiv der Mathematik. 96(2), 139–150.","chicago":"Browning, Timothy D. “Power-Free Values of Polynomials.” <i>Archiv Der Mathematik</i>. Birkhäuser, 2011. <a href=\"https://doi.org/10.1007/s00013-011-0224-7\">https://doi.org/10.1007/s00013-011-0224-7</a>.","ama":"Browning TD. Power-free values of polynomials. <i>Archiv der Mathematik</i>. 2011;96(2):139-150. doi:<a href=\"https://doi.org/10.1007/s00013-011-0224-7\">10.1007/s00013-011-0224-7</a>","apa":"Browning, T. D. (2011). Power-free values of polynomials. <i>Archiv Der Mathematik</i>. Birkhäuser. <a href=\"https://doi.org/10.1007/s00013-011-0224-7\">https://doi.org/10.1007/s00013-011-0224-7</a>","mla":"Browning, Timothy D. “Power-Free Values of Polynomials.” <i>Archiv Der Mathematik</i>, vol. 96, no. 2, Birkhäuser, 2011, pp. 139–50, doi:<a href=\"https://doi.org/10.1007/s00013-011-0224-7\">10.1007/s00013-011-0224-7</a>.","ieee":"T. D. Browning, “Power-free values of polynomials,” <i>Archiv der Mathematik</i>, vol. 96, no. 2. Birkhäuser, pp. 139–150, 2011."},"doi":"10.1007/s00013-011-0224-7","date_published":"2011-02-19T00:00:00Z","month":"02","publication_status":"published","fulldoi":"https://doi.org/10.1007/s00013-011-0224-7","author":[{"last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Timothy Browning","orcid":"0000-0002-8314-0177","first_name":"Timothy D"}],"publisher":"Birkhäuser","title":"Power-free values of polynomials","_id":"233","publication":"Archiv der Mathematik","year":"2011","quality_controlled":0,"issue":"2","type":"journal_article","extern":1},{"_id":"234","extern":1,"type":"journal_article","issue":"3","year":"2011","publication":"Journal de Theorie des Nombres de Bordeaux","quality_controlled":0,"publisher":"Universite de Bordeaux","author":[{"last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177","first_name":"Timothy D","full_name":"Timothy Browning"}],"fulldoi":"https://doi.org/10.5802/jtnb.778","publication_status":"published","date_published":"2011-01-01T00:00:00Z","month":"01","title":"The divisor problem for binary cubic forms","page":"579 - 602","doi":"10.5802/jtnb.778","citation":{"mla":"Browning, Timothy D. “The Divisor Problem for Binary Cubic Forms.” <i>Journal de Theorie Des Nombres de Bordeaux</i>, vol. 23, no. 3, Universite de Bordeaux, 2011, pp. 579–602, doi:<a href=\"https://doi.org/10.5802/jtnb.778\">10.5802/jtnb.778</a>.","apa":"Browning, T. D. (2011). The divisor problem for binary cubic forms. <i>Journal de Theorie Des Nombres de Bordeaux</i>. Universite de Bordeaux. <a href=\"https://doi.org/10.5802/jtnb.778\">https://doi.org/10.5802/jtnb.778</a>","ieee":"T. D. Browning, “The divisor problem for binary cubic forms,” <i>Journal de Theorie des Nombres de Bordeaux</i>, vol. 23, no. 3. Universite de Bordeaux, pp. 579–602, 2011.","ista":"Browning TD. 2011. The divisor problem for binary cubic forms. Journal de Theorie des Nombres de Bordeaux. 23(3), 579–602.","short":"T.D. Browning, Journal de Theorie Des Nombres de Bordeaux 23 (2011) 579–602.","ama":"Browning TD. The divisor problem for binary cubic forms. <i>Journal de Theorie des Nombres de Bordeaux</i>. 2011;23(3):579-602. doi:<a href=\"https://doi.org/10.5802/jtnb.778\">10.5802/jtnb.778</a>","chicago":"Browning, Timothy D. “The Divisor Problem for Binary Cubic Forms.” <i>Journal de Theorie Des Nombres de Bordeaux</i>. Universite de Bordeaux, 2011. <a href=\"https://doi.org/10.5802/jtnb.778\">https://doi.org/10.5802/jtnb.778</a>."},"publist_id":"7671","date_created":"2018-12-11T11:45:21Z","intvolume":"        23","status":"public","date_updated":"2021-01-12T06:56:53Z","volume":23,"abstract":[{"text":"We investigate the average order of the divisor function at values of binary cubic forms that are reducible over Q and discuss some applications.","lang":"eng"}],"day":"01"}]
