[{"alternative_title":["LNCS"],"year":"1997","doi":"10.1007/3-540-63166-6_34","title":"Partial-order reduction in symbolic state-space exploration","volume":1254,"date_updated":"2022-08-16T14:09:54Z","publist_id":"99","article_processing_charge":"No","_id":"4608","extern":"1","publication_identifier":{"isbn":["9783540631668"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"This research was supported in part by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the AFOSR contract F49620-93-1-0056, by the ARO MURI grant DAAH-04-96-1-0341, by the ARPA grant NAG2-892, and by the Semiconductor Research Corporation contracts DC-324.036 and DC-324.005.","quality_controlled":"1","oa_version":"None","publication_status":"published","citation":{"ieee":"R. Alur, R. Brayton, T. A. Henzinger, S. Qadeer, and S. Rajamani, “Partial-order reduction in symbolic state-space exploration,” in <i>9th International Conference on Computer Aided Verification</i>, Haifa, Israel, 1997, vol. 1254, pp. 340–351.","apa":"Alur, R., Brayton, R., Henzinger, T. A., Qadeer, S., &#38; Rajamani, S. (1997). Partial-order reduction in symbolic state-space exploration. In <i>9th International Conference on Computer Aided Verification</i> (Vol. 1254, pp. 340–351). Haifa, Israel: Springer. <a href=\"https://doi.org/10.1007/3-540-63166-6_34\">https://doi.org/10.1007/3-540-63166-6_34</a>","chicago":"Alur, Rajeev, Robert Brayton, Thomas A Henzinger, Shaz Qadeer, and Sriram Rajamani. “Partial-Order Reduction in Symbolic State-Space Exploration.” In <i>9th International Conference on Computer Aided Verification</i>, 1254:340–51. Springer, 1997. <a href=\"https://doi.org/10.1007/3-540-63166-6_34\">https://doi.org/10.1007/3-540-63166-6_34</a>.","mla":"Alur, Rajeev, et al. “Partial-Order Reduction in Symbolic State-Space Exploration.” <i>9th International Conference on Computer Aided Verification</i>, vol. 1254, Springer, 1997, pp. 340–51, doi:<a href=\"https://doi.org/10.1007/3-540-63166-6_34\">10.1007/3-540-63166-6_34</a>.","ama":"Alur R, Brayton R, Henzinger TA, Qadeer S, Rajamani S. Partial-order reduction in symbolic state-space exploration. In: <i>9th International Conference on Computer Aided Verification</i>. Vol 1254. Springer; 1997:340-351. doi:<a href=\"https://doi.org/10.1007/3-540-63166-6_34\">10.1007/3-540-63166-6_34</a>","ista":"Alur R, Brayton R, Henzinger TA, Qadeer S, Rajamani S. 1997. Partial-order reduction in symbolic state-space exploration. 9th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 1254, 340–351.","short":"R. Alur, R. Brayton, T.A. Henzinger, S. Qadeer, S. Rajamani, in:, 9th International Conference on Computer Aided Verification, Springer, 1997, pp. 340–351."},"abstract":[{"lang":"eng","text":"State space explosion is a fundamental obstacle in formal verification of designs and protocols. Several techniques for combating this problem have emerged in the past few years, among which two are significant: partial-order reductions and symbolic state space search. In asynchronous systems, interleavings of independent concurrent events are equivalent, and only a representative interleaving needs to be explored to verify local properties. Partial-order methods exploit this redundancy and visit only a subset of the reachable states. Symbolic techniques, on the other hand, capture the transition relation of a system and the set of reachable states as boolean functions. In many cases, these functions can be represented compactly using binary decision diagrams (BDDs). Traditionally, the two techniques have been practiced by two different schools—partial-order methods with enumerative depth-first search for the analysis of asynchronous network protocols, and symbolic breadth-first search for the analysis of synchronous hardware designs. We combine both approaches and develop a method for using partial-order reduction techniques in symbolic BDD-based invariant checking. We present theoretical results to prove the correctness of the method, and experimental results to demonstrate its efficacy."}],"author":[{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"},{"first_name":"Robert","last_name":"Brayton","full_name":"Brayton, Robert"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"},{"first_name":"Sriram","last_name":"Rajamani","full_name":"Rajamani, Sriram"}],"conference":{"start_date":"1997-06-22","location":"Haifa, Israel","end_date":"1997-06-25","name":"CAV: Computer Aided Verification"},"date_created":"2018-12-11T12:09:44Z","month":"01","date_published":"1997-01-01T00:00:00Z","publisher":"Springer","scopus_import":"1","language":[{"iso":"eng"}],"publication":"9th International Conference on Computer Aided Verification","page":"340 - 351","day":"01","type":"conference","intvolume":"      1254","status":"public"},{"publication":"Proceedings of the 38th Annual Symposium on Foundations of Computer Science","publist_id":"100","date_updated":"2022-09-05T07:32:05Z","article_processing_charge":"No","page":"100 - 109","_id":"4609","extern":"1","publication_identifier":{"issn":["0004-5411"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"We thank Luca de Alfaro, Kousha Etessami, Salvatore La Torre, P. Madhusudan, Amir Pnueli, Moshe Vardi, Thomas Wilke, and Mihalis Yannakakis for helpful discussions. We also thank Freddy Mang for comments on a draft of this manuscript.","oa_version":"None","quality_controlled":"1","publication_status":"published","day":"01","citation":{"ieee":"R. Alur, T. A. Henzinger, and O. Kupferman, “Alternating-time temporal logic,” in <i>Proceedings of the 38th Annual Symposium on Foundations of Computer Science</i>, Washington, DC, United States, 1997, pp. 100–109.","apa":"Alur, R., Henzinger, T. A., &#38; Kupferman, O. (1997). Alternating-time temporal logic. In <i>Proceedings of the 38th Annual Symposium on Foundations of Computer Science</i> (pp. 100–109). Washington, DC, United States: Association for Computing Machinery (ACM). <a href=\"https://doi.org/10.1145/585265.585270\">https://doi.org/10.1145/585265.585270</a>","chicago":"Alur, Rajeev, Thomas A Henzinger, and Orna Kupferman. “Alternating-Time Temporal Logic.” In <i>Proceedings of the 38th Annual Symposium on Foundations of Computer Science</i>, 100–109. Association for Computing Machinery (ACM), 1997. <a href=\"https://doi.org/10.1145/585265.585270\">https://doi.org/10.1145/585265.585270</a>.","ama":"Alur R, Henzinger TA, Kupferman O. Alternating-time temporal logic. In: <i>Proceedings of the 38th Annual Symposium on Foundations of Computer Science</i>. Association for Computing Machinery (ACM); 1997:100-109. doi:<a href=\"https://doi.org/10.1145/585265.585270\">10.1145/585265.585270</a>","mla":"Alur, Rajeev, et al. “Alternating-Time Temporal Logic.” <i>Proceedings of the 38th Annual Symposium on Foundations of Computer Science</i>, Association for Computing Machinery (ACM), 1997, pp. 100–09, doi:<a href=\"https://doi.org/10.1145/585265.585270\">10.1145/585265.585270</a>.","short":"R. Alur, T.A. Henzinger, O. Kupferman, in:, Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Association for Computing Machinery (ACM), 1997, pp. 100–109.","ista":"Alur R, Henzinger TA, Kupferman O. 1997. Alternating-time temporal logic. Proceedings of the 38th Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science, 100–109."},"type":"conference","abstract":[{"lang":"eng","text":"Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branching-time temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general variety of temporal logic: alternating-time temporal logic offers selective quantification over those paths that are possible outcomes of games, such as the game in which the system and the environment alternate moves. While linear-time and branching-time logics are natural specification languages for closed systems, alternating-time logics are natural specification languages for open systems. For example, by preceding the temporal operator “eventually” with a selective path quantifier, we can specify that in the game between the system and the environment, the system has a strategy to reach a certain state. Also the problems of receptiveness, realizability, and controllability can be formulated as model-checking problems for alternating-time formulas"}],"status":"public","author":[{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Orna","full_name":"Kupferman, Orna","last_name":"Kupferman"}],"conference":{"start_date":"1997-10-19","end_date":"1997-10-22","location":"Washington, DC, United States","name":"FOCS: Foundations of Computer Science"},"date_created":"2018-12-11T12:09:44Z","month":"01","year":"1997","doi":"10.1145/585265.585270","date_published":"1997-01-01T00:00:00Z","publisher":"Association for Computing Machinery (ACM)","scopus_import":"1","title":"Alternating-time temporal logic","language":[{"iso":"eng"}]},{"alternative_title":["LNCS"],"date_created":"2022-08-11T13:35:06Z","conference":{"location":"Bologna, Italy","end_date":"1997-07-11","name":"ICALP: International Colloquium on Automata, Languages, and Programming","start_date":"1997-07-07"},"date_published":"1997-07-01T00:00:00Z","year":"1997","doi":"10.1007/3-540-63165-8_214","month":"07","language":[{"iso":"eng"}],"title":"Maintaining minimum spanning trees in dynamic graphs","scopus_import":"1","publisher":"Springer Nature","article_processing_charge":"No","page":"594–604","date_updated":"2023-02-14T07:49:03Z","volume":1256,"publication":"24th International Colloquium on Automata, Languages and Programming","quality_controlled":"1","oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783540631651"],"eisbn":["9783540691945"]},"extern":"1","_id":"11803","type":"conference","citation":{"apa":"Henzinger, M. H., &#38; King, V. (1997). Maintaining minimum spanning trees in dynamic graphs. In <i>24th International Colloquium on Automata, Languages and Programming</i> (Vol. 1256, pp. 594–604). Bologna, Italy: Springer Nature. <a href=\"https://doi.org/10.1007/3-540-63165-8_214\">https://doi.org/10.1007/3-540-63165-8_214</a>","ieee":"M. H. Henzinger and V. King, “Maintaining minimum spanning trees in dynamic graphs,” in <i>24th International Colloquium on Automata, Languages and Programming</i>, Bologna, Italy, 1997, vol. 1256, pp. 594–604.","chicago":"Henzinger, Monika H, and Valerie King. “Maintaining Minimum Spanning Trees in Dynamic Graphs.” In <i>24th International Colloquium on Automata, Languages and Programming</i>, 1256:594–604. Springer Nature, 1997. <a href=\"https://doi.org/10.1007/3-540-63165-8_214\">https://doi.org/10.1007/3-540-63165-8_214</a>.","mla":"Henzinger, Monika H., and Valerie King. “Maintaining Minimum Spanning Trees in Dynamic Graphs.” <i>24th International Colloquium on Automata, Languages and Programming</i>, vol. 1256, Springer Nature, 1997, pp. 594–604, doi:<a href=\"https://doi.org/10.1007/3-540-63165-8_214\">10.1007/3-540-63165-8_214</a>.","ama":"Henzinger MH, King V. Maintaining minimum spanning trees in dynamic graphs. In: <i>24th International Colloquium on Automata, Languages and Programming</i>. Vol 1256. Springer Nature; 1997:594–604. doi:<a href=\"https://doi.org/10.1007/3-540-63165-8_214\">10.1007/3-540-63165-8_214</a>","short":"M.H. Henzinger, V. King, in:, 24th International Colloquium on Automata, Languages and Programming, Springer Nature, 1997, pp. 594–604.","ista":"Henzinger MH, King V. 1997. Maintaining minimum spanning trees in dynamic graphs. 24th International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 1256, 594–604."},"day":"01","publication_status":"published","author":[{"last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Valerie","last_name":"King","full_name":"King, Valerie"}],"status":"public","intvolume":"      1256","abstract":[{"text":"We present the first fully dynamic algorithm for maintaining a minimum spanning tree in time o(√n) per operation. To be precise, the algorithm uses O(n 1/3 log n) amortized time per update operation. The algorithm is fairly simple and deterministic. An immediate consequence is the first fully dynamic deterministic algorithm for maintaining connectivity and, bipartiteness in amortized time O(n 1/3 log n) per update, with O(1) worst case time per query.","lang":"eng"}]},{"date_created":"2022-08-16T07:07:03Z","month":"12","date_published":"1997-12-01T00:00:00Z","article_type":"original","scopus_import":"1","publisher":"Association for Computing Machinery","language":[{"iso":"eng"}],"publication":"ACM SIGOPS Operating Systems Review","issue":"5","page":"1-14","day":"01","type":"journal_article","intvolume":"        31","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/269005.266637"}],"related_material":{"record":[{"relation":"earlier_version","id":"11849","status":"public"}]},"doi":"10.1145/269005.266637","year":"1997","title":"Continuous profiling: Where have all the cycles gone?","article_processing_charge":"No","date_updated":"2023-02-21T16:30:27Z","oa":1,"volume":31,"publication_identifier":{"issn":["0163-5980"]},"extern":"1","_id":"11849","quality_controlled":"1","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Anderson, Jennifer M., Lance M. Berc, Jeffrey Dean, Sanjay Ghemawat, Monika H Henzinger, Shun-Tak A. Leung, Richard L. Sites, Mark T. Vandevoorde, Carl A. Waldspurger, and William E. Weihl. “Continuous Profiling: Where Have All the Cycles Gone?” <i>ACM SIGOPS Operating Systems Review</i>. Association for Computing Machinery, 1997. <a href=\"https://doi.org/10.1145/269005.266637\">https://doi.org/10.1145/269005.266637</a>.","ieee":"J. M. Anderson <i>et al.</i>, “Continuous profiling: Where have all the cycles gone?,” <i>ACM SIGOPS Operating Systems Review</i>, vol. 31, no. 5. Association for Computing Machinery, pp. 1–14, 1997.","apa":"Anderson, J. M., Berc, L. M., Dean, J., Ghemawat, S., Henzinger, M. H., Leung, S.-T. A., … Weihl, W. E. (1997). Continuous profiling: Where have all the cycles gone? <i>ACM SIGOPS Operating Systems Review</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/269005.266637\">https://doi.org/10.1145/269005.266637</a>","short":"J.M. Anderson, L.M. Berc, J. Dean, S. Ghemawat, M.H. Henzinger, S.-T.A. Leung, R.L. Sites, M.T. Vandevoorde, C.A. Waldspurger, W.E. Weihl, ACM SIGOPS Operating Systems Review 31 (1997) 1–14.","ista":"Anderson JM, Berc LM, Dean J, Ghemawat S, Henzinger MH, Leung S-TA, Sites RL, Vandevoorde MT, Waldspurger CA, Weihl WE. 1997. Continuous profiling: Where have all the cycles gone? ACM SIGOPS Operating Systems Review. 31(5), 1–14.","ama":"Anderson JM, Berc LM, Dean J, et al. Continuous profiling: Where have all the cycles gone? <i>ACM SIGOPS Operating Systems Review</i>. 1997;31(5):1-14. doi:<a href=\"https://doi.org/10.1145/269005.266637\">10.1145/269005.266637</a>","mla":"Anderson, Jennifer M., et al. “Continuous Profiling: Where Have All the Cycles Gone?” <i>ACM SIGOPS Operating Systems Review</i>, vol. 31, no. 5, Association for Computing Machinery, 1997, pp. 1–14, doi:<a href=\"https://doi.org/10.1145/269005.266637\">10.1145/269005.266637</a>."},"publication_status":"published","abstract":[{"lang":"eng","text":"This paper describes the DIGlTAL Continuous Profiling Infrastmcture, a sampling-based profiling system designed to run continuously on production systems. The system supports multiprocessors, works on unmodified executable& and collects profiles for entire systems, including user programs, shared libraries, and the operating system kernel. Samples are collected at a high rate (over 5200 samples/secper333-MHz processor), yet with low overhead (l-3% slowdown for most workloads). Analysis tools supplied with the profiling system use the sample data to produce an accurate accounting, down to the level of pipeline stalls incurred by individual instructions, of where time is being spent. When instructions incur stalls, the tools identify possible reasons, such as cache misses, branch mispredictions, and functional unit contention. The fine-grained instruction-level analysis guides users and automated optimizers to the causes of performance\r\nproblems and provides important insights for fixing them. "}],"author":[{"first_name":"Jennifer M.","last_name":"Anderson","full_name":"Anderson, Jennifer M."},{"full_name":"Berc, Lance M.","last_name":"Berc","first_name":"Lance M."},{"last_name":"Dean","full_name":"Dean, Jeffrey","first_name":"Jeffrey"},{"last_name":"Ghemawat","full_name":"Ghemawat, Sanjay","first_name":"Sanjay"},{"first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Leung, Shun-Tak A.","last_name":"Leung","first_name":"Shun-Tak A."},{"first_name":"Richard L.","last_name":"Sites","full_name":"Sites, Richard L."},{"first_name":"Mark T.","last_name":"Vandevoorde","full_name":"Vandevoorde, Mark T."},{"last_name":"Waldspurger","full_name":"Waldspurger, Carl A.","first_name":"Carl A."},{"first_name":"William E.","last_name":"Weihl","full_name":"Weihl, William E."}]},{"date_created":"2022-08-17T07:21:55Z","doi":"10.1002/(sici)1098-2418(199712)11:4<369::aid-rsa5>3.0.co;2-x","year":"1997","month":"12","article_type":"original","date_published":"1997-12-07T00:00:00Z","scopus_import":"1","title":"Sampling to provide or to bound: With applications to fully dynamic graph algorithms","publisher":"Wiley","language":[{"iso":"eng"}],"publication":"Random Structures and Algorithms","issue":"4","article_processing_charge":"No","page":"369-379","date_updated":"2023-02-17T14:05:02Z","volume":11,"publication_identifier":{"issn":["1042-9832"],"eissn":["1098-2418"]},"extern":"1","_id":"11883","oa_version":"None","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"07","citation":{"ista":"Henzinger MH, Thorup M. 1997. Sampling to provide or to bound: With applications to fully dynamic graph algorithms. Random Structures and Algorithms. 11(4), 369–379.","short":"M.H. Henzinger, M. Thorup, Random Structures and Algorithms 11 (1997) 369–379.","ama":"Henzinger MH, Thorup M. Sampling to provide or to bound: With applications to fully dynamic graph algorithms. <i>Random Structures and Algorithms</i>. 1997;11(4):369-379. doi:<a href=\"https://doi.org/10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x\">10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x</a>","mla":"Henzinger, Monika H., and Mikkel Thorup. “Sampling to Provide or to Bound: With Applications to Fully Dynamic Graph Algorithms.” <i>Random Structures and Algorithms</i>, vol. 11, no. 4, Wiley, 1997, pp. 369–79, doi:<a href=\"https://doi.org/10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x\">10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x</a>.","chicago":"Henzinger, Monika H, and Mikkel Thorup. “Sampling to Provide or to Bound: With Applications to Fully Dynamic Graph Algorithms.” <i>Random Structures and Algorithms</i>. Wiley, 1997. <a href=\"https://doi.org/10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x\">https://doi.org/10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x</a>.","ieee":"M. H. Henzinger and M. Thorup, “Sampling to provide or to bound: With applications to fully dynamic graph algorithms,” <i>Random Structures and Algorithms</i>, vol. 11, no. 4. Wiley, pp. 369–379, 1997.","apa":"Henzinger, M. H., &#38; Thorup, M. (1997). Sampling to provide or to bound: With applications to fully dynamic graph algorithms. <i>Random Structures and Algorithms</i>. Wiley. <a href=\"https://doi.org/10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x\">https://doi.org/10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x</a>"},"publication_status":"published","type":"journal_article","abstract":[{"lang":"eng","text":"In dynamic graph algorithms the following provide-or-bound problem has to be solved quickly: Given a set S containing a subset R and a way of generating random elements from S testing for membership in R, either (i) provide an element of R, or (ii) give a (small) upper bound on the size of R that holds with high probability. We give an optimal algorithm for this problem. This algorithm improves the time per operation for various dynamic graph algorithms by a factor of O(log n). For example, it improves the time per update for fully dynamic connectivity from O(log3n) to O(log2n)."}],"intvolume":"        11","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H"},{"first_name":"Mikkel","last_name":"Thorup","full_name":"Thorup, Mikkel"}],"status":"public"},{"year":"1997","doi":"10.1523/JNEUROSCI.17-01-00204.1997","external_id":{"pmid":["8987749"]},"title":"Functional properties of AMPA and NMDA receptors expressed in identified types of basal ganglia neurons","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6793708/","open_access":"1"}],"publication_status":"published","citation":{"ieee":"T. Götz, U. Kraushaar, J. Geiger, J. Lubke, T. Berger, and P. M. Jonas, “Functional properties of AMPA and NMDA receptors expressed in identified types of basal ganglia neurons,” <i>Journal of Neuroscience</i>, vol. 17, no. 1. Society for Neuroscience, pp. 204–215, 1997.","apa":"Götz, T., Kraushaar, U., Geiger, J., Lubke, J., Berger, T., &#38; Jonas, P. M. (1997). Functional properties of AMPA and NMDA receptors expressed in identified types of basal ganglia neurons. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.17-01-00204.1997\">https://doi.org/10.1523/JNEUROSCI.17-01-00204.1997</a>","chicago":"Götz, Thomas, Udo Kraushaar, Jörg Geiger, Joachim Lubke, Thomas Berger, and Peter M Jonas. “Functional Properties of AMPA and NMDA Receptors Expressed in Identified Types of Basal Ganglia Neurons.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 1997. <a href=\"https://doi.org/10.1523/JNEUROSCI.17-01-00204.1997\">https://doi.org/10.1523/JNEUROSCI.17-01-00204.1997</a>.","mla":"Götz, Thomas, et al. “Functional Properties of AMPA and NMDA Receptors Expressed in Identified Types of Basal Ganglia Neurons.” <i>Journal of Neuroscience</i>, vol. 17, no. 1, Society for Neuroscience, 1997, pp. 204–15, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.17-01-00204.1997\">10.1523/JNEUROSCI.17-01-00204.1997</a>.","ama":"Götz T, Kraushaar U, Geiger J, Lubke J, Berger T, Jonas PM. Functional properties of AMPA and NMDA receptors expressed in identified types of basal ganglia neurons. <i>Journal of Neuroscience</i>. 1997;17(1):204-215. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.17-01-00204.1997\">10.1523/JNEUROSCI.17-01-00204.1997</a>","ista":"Götz T, Kraushaar U, Geiger J, Lubke J, Berger T, Jonas PM. 1997. Functional properties of AMPA and NMDA receptors expressed in identified types of basal ganglia neurons. Journal of Neuroscience. 17(1), 204–215.","short":"T. Götz, U. Kraushaar, J. Geiger, J. Lubke, T. Berger, P.M. Jonas, Journal of Neuroscience 17 (1997) 204–215."},"author":[{"first_name":"Thomas","last_name":"Götz","full_name":"Götz, Thomas"},{"full_name":"Kraushaar, Udo","last_name":"Kraushaar","first_name":"Udo"},{"full_name":"Geiger, Jörg","last_name":"Geiger","first_name":"Jörg"},{"last_name":"Lubke","full_name":"Lubke, Joachim","first_name":"Joachim"},{"last_name":"Berger","full_name":"Berger, Thomas","first_name":"Thomas"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","last_name":"Jonas","orcid":"0000-0001-5001-4804","first_name":"Peter M"}],"abstract":[{"text":"AMPA- and NMDA-type glutamate receptors (AMPARs and NMDARs) mediate excitatory synoptic transmission in the basal ganglia and may contribute to excitotoxic injury. We investigated the functional properties of AMPARs and NMDARs expressed by six main types of basal ganglia neurons in acute rat brain slices (principal neurons and cholinergic interneurons of striatum, GABAergic and dopaminergic neurons of substantia nigra, globus pallidus neurons, and subthalamic nucleus neurons) using fast application of glutamate to nucleated and outside-out membrane patches, AMPARs in different types of basal ganglia neurons were functionally distinct. Those expressed in striatal principal neurons exhibited the slowest gating (desensitization time constant τ = 11.5 msec, 1 mM glutamate, 22°C), whereas those in striatal cholinergic interneurons showed the fastest gating (desensitization time constant τ = 3.6 msec). The lowest Ca2+ permeability of AMPARs was observed in nigral dopaminergic neurons (P(CA)/P(NA) = 0.10), whereas the highest Ca2+ permeability was found in subthalamic nucleus neurons (P(Ca)/P(Na) = 1.17). NMDARs of different types of basal ganglia neurons were less variable in their functional properties; those expressed in nigral dopaminergic neurons exhibited the slowest gating (deactivation time constant of predominant fast component τ1 150 msec, 100 μM glutamate), and those of globus pallidus neurons showed the fastest gating (τ1 = 67 msec). The Mg2+ block of NMDARs was similar; the average chord conductance ratio g(+60mv)/g(+40mV) was 0.18-0.22 in 100 μM external Mg2+. Hence, AMPARs expressed in different types of basal ganglia neurons are markedly diverse, whereas NMDARs are less variable in functional properties that are relevant for excitatory synoptic transmission and neuronal vulnerability.","lang":"eng"}],"volume":17,"date_updated":"2022-08-22T08:48:45Z","oa":1,"publist_id":"2905","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"This work was supported by Deutsche Forschungsgemeinschaft Grant BE1859 to T.B. and SFB505/C5 to P.J. We thank Mrs. B. Plessow-Freudenberg for help with the immunocytochemistry, Dr. M. Ha¨usser for advice concerning the \r\n reparation of midbrain slices, and Drs. J. Bischofberger, G. B. Landwehrmeyer, and M. Martina for critically reading this manuscript.","quality_controlled":"1","oa_version":"Published Version","_id":"3482","pmid":1,"extern":"1","publication_identifier":{"issn":["0270-6474"]},"article_type":"original","date_published":"1997-01-01T00:00:00Z","month":"01","language":[{"iso":"eng"}],"publisher":"Society for Neuroscience","scopus_import":"1","date_created":"2018-12-11T12:03:34Z","type":"journal_article","day":"01","status":"public","intvolume":"        17","page":"204 - 215","issue":"1","publication":"Journal of Neuroscience"},{"day":"15","type":"journal_article","intvolume":"        17","status":"public","issue":"14","publication":"Journal of Neuroscience","page":"5380 - 5394","month":"07","date_published":"1997-07-15T00:00:00Z","article_type":"original","publisher":"Society for Neuroscience","scopus_import":"1","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:03:34Z","publication_status":"published","citation":{"mla":"Ceranik, Katya, et al. “A Novel Type of GABAergic Interneuron Connecting the Input and the Output Regions of the Hippocampus.” <i>Journal of Neuroscience</i>, vol. 17, no. 14, Society for Neuroscience, 1997, pp. 5380–94, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.17-14-05380.1997\">10.1523/JNEUROSCI.17-14-05380.1997</a>.","ama":"Ceranik K, Bender R, Geiger J, et al. A novel type of GABAergic interneuron connecting the input and the output regions of the hippocampus. <i>Journal of Neuroscience</i>. 1997;17(14):5380-5394. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.17-14-05380.1997\">10.1523/JNEUROSCI.17-14-05380.1997</a>","short":"K. Ceranik, R. Bender, J. Geiger, H. Monyer, P.M. Jonas, M. Frotscher, J. Lubke, Journal of Neuroscience 17 (1997) 5380–5394.","ista":"Ceranik K, Bender R, Geiger J, Monyer H, Jonas PM, Frotscher M, Lubke J. 1997. A novel type of GABAergic interneuron connecting the input and the output regions of the hippocampus. Journal of Neuroscience. 17(14), 5380–5394.","ieee":"K. Ceranik <i>et al.</i>, “A novel type of GABAergic interneuron connecting the input and the output regions of the hippocampus.,” <i>Journal of Neuroscience</i>, vol. 17, no. 14. Society for Neuroscience, pp. 5380–5394, 1997.","apa":"Ceranik, K., Bender, R., Geiger, J., Monyer, H., Jonas, P. M., Frotscher, M., &#38; Lubke, J. (1997). A novel type of GABAergic interneuron connecting the input and the output regions of the hippocampus. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.17-14-05380.1997\">https://doi.org/10.1523/JNEUROSCI.17-14-05380.1997</a>","chicago":"Ceranik, Katya, Roland Bender, Jörg Geiger, Hannah Monyer, Peter M Jonas, Michael Frotscher, and Joachim Lubke. “A Novel Type of GABAergic Interneuron Connecting the Input and the Output Regions of the Hippocampus.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 1997. <a href=\"https://doi.org/10.1523/JNEUROSCI.17-14-05380.1997\">https://doi.org/10.1523/JNEUROSCI.17-14-05380.1997</a>."},"abstract":[{"text":"The main excitatory pathway of the hippocampal formation is controlled by a network of morphologically distinct populations of GABAergic interneurons. Here we describe a novel type of GABAergic interneuron located in the outer molecular layer (OML) of the rat dentate gyrus with a long- range forward projection from the dentate gyrus to the subiculum across the hippocampal fissure, OML interneurons were recorded in hippocampal slices by using the whole-cell patch-clamp configuration. During recording, cells were filled with biocytin for subsequent light and electron microscopic analysis. Neurons projecting to the subiculum were distributed throughout the entire OML. They had round or ovoid somata and a multipolar dendritic morphology. Two axonal domains could be distinguished: an extensive, tangential distribution within the OML and a long-range vertical and tangential projection to layer 1 and stratum pyramidale of the subiculum. Symmetric synaptic contacts were established by these interneurons on dendritic shafts in the OML and subiculum. OML interneurons were characterized physiologically by short action potential duration and marked afterhyperpolarization that followed the spike. On sustained current injection, they generated high- frequency (up to 130 Hz, 34°C) trains of action potentials with only little adaptation. In situ hybridization and single-call RT-PCR analysis for GAD67 mRNA confirmed the GABAergic nature of OML interneurons. GABAergic interneurons in the OML projecting to the subiculum connect the input and output regions of the hippocampus. Hence, they could mediate long-range feed- forward inhibition and may participate in an oscillating cross-regional interneuron network that may synchronize the activity of spatially distributed principal neurons in the dentate gyrus and the subiculum.","lang":"eng"}],"author":[{"first_name":"Katya","full_name":"Ceranik, Katya","last_name":"Ceranik"},{"first_name":"Roland","last_name":"Bender","full_name":"Bender, Roland"},{"first_name":"Jörg","last_name":"Geiger","full_name":"Geiger, Jörg"},{"first_name":"Hannah","full_name":"Monyer, Hannah","last_name":"Monyer"},{"first_name":"Peter M","full_name":"Jonas, Peter M","last_name":"Jonas","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Frotscher, Michael","last_name":"Frotscher","first_name":"Michael"},{"last_name":"Lubke","full_name":"Lubke, Joachim","first_name":"Joachim"}],"date_updated":"2022-08-22T08:18:54Z","volume":17,"publist_id":"2904","oa":1,"article_processing_charge":"No","_id":"3483","pmid":1,"extern":"1","publication_identifier":{"issn":["0270-6474"]},"acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (SFB 505/A3 and Leibniz program to M.F., SFB 505/C5 to P.J., and DFG 432/3 to H.M.) We thank Drs. H. Scharfman, M. Häusser, and I. Vida for critically reading an earlier version of this manuscript. We are also grateful to B. Joch, S. Nestel, M. Winter, and U. Amtmann for excellent technical assistance.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"Published Version","quality_controlled":"1","doi":"10.1523/JNEUROSCI.17-14-05380.1997","year":"1997","external_id":{"pmid":["9204922"]},"title":"A novel type of GABAergic interneuron connecting the input and the output regions of the hippocampus.","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6793821/"}]},{"title":"Submillisecond AMPA receptor-mediated signaling at a principal neuron-interneuron synapse","external_id":{"pmid":["9208867 "]},"year":"1997","doi":"10.1016/S0896-6273(00)80339-6","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S0896627300803396?via%3Dihub"}],"author":[{"last_name":"Geiger","full_name":"Geiger, Jörg","first_name":"Jörg"},{"last_name":"Lubke","full_name":"Lubke, Joachim","first_name":"Joachim"},{"last_name":"Roth","full_name":"Roth, Arnd","first_name":"Arnd"},{"first_name":"Michael","last_name":"Frotscher","full_name":"Frotscher, Michael"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","last_name":"Jonas","first_name":"Peter M"}],"abstract":[{"text":"Glutamatergic transmission at a principal neuroninterneuron synapse was investigated by dual whole-cell patch-clamp recording in rat hippocampal slices combined with morphological analysis. Evoked EPSPs with rapid time course (half duration ≃ 4 ms; 34°C) were generated at multiple synaptic contacts established on the interneuron dendrites close to the soma. The underlying postsynaptic conductance change showed a submillisecond rise and decay, due to the precise timing of glutamate release and the rapid deactivation of the postsynaptic AMPA receptors. Simulations based on a compartmental model of the interneuron indicated that the rapid postsynaptic conductance change determines the shape and the somatodendritic integration of EPSPs, thus enabling interneurons to detect synchronous principal neuron activity.","lang":"eng"}],"publication_status":"published","citation":{"ieee":"J. Geiger, J. Lubke, A. Roth, M. Frotscher, and P. M. Jonas, “Submillisecond AMPA receptor-mediated signaling at a principal neuron-interneuron synapse,” <i>Neuron</i>, vol. 18, no. 6. Elsevier, pp. 1009–1023, 1997.","apa":"Geiger, J., Lubke, J., Roth, A., Frotscher, M., &#38; Jonas, P. M. (1997). Submillisecond AMPA receptor-mediated signaling at a principal neuron-interneuron synapse. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0896-6273(00)80339-6\">https://doi.org/10.1016/S0896-6273(00)80339-6</a>","chicago":"Geiger, Jörg, Joachim Lubke, Arnd Roth, Michael Frotscher, and Peter M Jonas. “Submillisecond AMPA Receptor-Mediated Signaling at a Principal Neuron-Interneuron Synapse.” <i>Neuron</i>. Elsevier, 1997. <a href=\"https://doi.org/10.1016/S0896-6273(00)80339-6\">https://doi.org/10.1016/S0896-6273(00)80339-6</a>.","mla":"Geiger, Jörg, et al. “Submillisecond AMPA Receptor-Mediated Signaling at a Principal Neuron-Interneuron Synapse.” <i>Neuron</i>, vol. 18, no. 6, Elsevier, 1997, pp. 1009–23, doi:<a href=\"https://doi.org/10.1016/S0896-6273(00)80339-6\">10.1016/S0896-6273(00)80339-6</a>.","ama":"Geiger J, Lubke J, Roth A, Frotscher M, Jonas PM. Submillisecond AMPA receptor-mediated signaling at a principal neuron-interneuron synapse. <i>Neuron</i>. 1997;18(6):1009-1023. doi:<a href=\"https://doi.org/10.1016/S0896-6273(00)80339-6\">10.1016/S0896-6273(00)80339-6</a>","ista":"Geiger J, Lubke J, Roth A, Frotscher M, Jonas PM. 1997. Submillisecond AMPA receptor-mediated signaling at a principal neuron-interneuron synapse. Neuron. 18(6), 1009–1023.","short":"J. Geiger, J. Lubke, A. Roth, M. Frotscher, P.M. Jonas, Neuron 18 (1997) 1009–1023."},"acknowledgement":"We thank Drs. J. Bischofberger, M. Ha¨usser, and I. Vida for critically T.F. reading the manuscript; S. Nestel, B. Joch, M. Winter, B. Freudenberg, and K. Zipfel for excellent technical assistance; and B. Hillers Hestrin, S. for typing. Supported by the DFG (SFB 505/C5 to P. J. and Leibniz program to M. F.)","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","quality_controlled":"1","_id":"3484","pmid":1,"extern":"1","publication_identifier":{"issn":["0896-6273"]},"publist_id":"2903","volume":18,"date_updated":"2022-08-22T08:41:54Z","oa":1,"article_processing_charge":"No","language":[{"iso":"eng"}],"publisher":"Elsevier","scopus_import":"1","date_published":"1997-06-01T00:00:00Z","article_type":"original","month":"06","date_created":"2018-12-11T12:03:34Z","status":"public","intvolume":"        18","type":"journal_article","day":"01","page":"1009 - 1023","issue":"6","publication":"Neuron"},{"type":"journal_article","day":"15","status":"public","intvolume":"       505","page":"593 - 603","publication":"Journal of Physiology","issue":"3","date_published":"1997-12-15T00:00:00Z","article_type":"original","month":"12","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Wiley-Blackwell","date_created":"2018-12-11T12:03:34Z","citation":{"ama":"Martina M, Jonas PM. Functional differences in Na+ channel gating between fast-spiking interneurones and principal neurones in rat hippocampus. <i>Journal of Physiology</i>. 1997;505(3):593-603. doi:<a href=\"https://doi.org/10.1111/j.1469-7793.1997.593ba.x\">10.1111/j.1469-7793.1997.593ba.x</a>","mla":"Martina, Marco, and Peter M. Jonas. “Functional Differences in Na+ Channel Gating between Fast-Spiking Interneurones and Principal Neurones in Rat Hippocampus.” <i>Journal of Physiology</i>, vol. 505, no. 3, Wiley-Blackwell, 1997, pp. 593–603, doi:<a href=\"https://doi.org/10.1111/j.1469-7793.1997.593ba.x\">10.1111/j.1469-7793.1997.593ba.x</a>.","ista":"Martina M, Jonas PM. 1997. Functional differences in Na+ channel gating between fast-spiking interneurones and principal neurones in rat hippocampus. Journal of Physiology. 505(3), 593–603.","short":"M. Martina, P.M. Jonas, Journal of Physiology 505 (1997) 593–603.","ieee":"M. Martina and P. M. Jonas, “Functional differences in Na+ channel gating between fast-spiking interneurones and principal neurones in rat hippocampus,” <i>Journal of Physiology</i>, vol. 505, no. 3. Wiley-Blackwell, pp. 593–603, 1997.","apa":"Martina, M., &#38; Jonas, P. M. (1997). Functional differences in Na+ channel gating between fast-spiking interneurones and principal neurones in rat hippocampus. <i>Journal of Physiology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1469-7793.1997.593ba.x\">https://doi.org/10.1111/j.1469-7793.1997.593ba.x</a>","chicago":"Martina, Marco, and Peter M Jonas. “Functional Differences in Na+ Channel Gating between Fast-Spiking Interneurones and Principal Neurones in Rat Hippocampus.” <i>Journal of Physiology</i>. Wiley-Blackwell, 1997. <a href=\"https://doi.org/10.1111/j.1469-7793.1997.593ba.x\">https://doi.org/10.1111/j.1469-7793.1997.593ba.x</a>."},"publication_status":"published","author":[{"last_name":"Martina","full_name":"Martina, Marco","first_name":"Marco"},{"full_name":"Jonas, Peter M","last_name":"Jonas","orcid":"0000-0001-5001-4804","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"1. GABAergic interneurones differ from glutamatergic principal neurones in their ability to discharge high-frequency trains of action potentials without adaptation. To examine whether Na+ channel gating contributed to these differences, Na+ currents were recorded in nucleated patches from interneurones (dentate gyrus basket cells, BCs) and principal neurones (CA1 pyramidal cells, PCs) of rat hippocampal slices. 2. The voltage dependence of Na+ channel activation in BCs and PCs was similar. The slope factors of the activation curves, fitted with Boltzmann functions raised to the third power, were 11.5 and 11.8 mV, and the mid-point potentials were -25.1 and -23.9 mV, respectively. 3. Whereas the time course of Na+ channel activation (-30 to +40 mV) was similar, the deactivation kinetics (-100 to -40 mV) were faster in BCs than in PCs (tail current decay time constants, 0.13 and 0.20 ms, respectively, at -40 mV). 4. Na+ channels in BCs and PCs differed in the voltage dependence of inactivation. The slope factors of the steady-state inactivation curves fitted with Boltzmann functions were 6.7 and 10.7 mV, and the mid-point potentials were -58.3 and -62.9 mV, respectively. 5. The onset of Na+ channel inactivation at -55 mV was slower in BC's than in PCs; the inactivation time constants were 18.6 and 9.3 ms, respectively. At more positive potentials the differences in inactivation onset were smaller. 6. The time course of recovery of Na+ channels from inactivation induced by a 30 ms pulse was fast and mono-exponential (τ = 2.0 ms at -120 mV) in BCs, whereas it was slower and biexponential in PCs (τ1 = 2.0 ms and τ2 = 133 ms; amplitude contribution of the slow component, 15%). 7. We conclude that Na+ channels of BCs and PCs differ in gating properties that contribute to the characteristic action potential patterns of the two types of neurones.","lang":"eng"}],"article_processing_charge":"No","volume":505,"publist_id":"2902","date_updated":"2022-08-22T08:25:26Z","oa":1,"oa_version":"Published Version","quality_controlled":"1","acknowledgement":"We thank Drs J. Bischofberger and J. R. P. Geiger for critically reading the manuscript, Mrs B. Plessow-Freudenberg and K. Zipfel for technical assistance, and Mrs B. Hillers for typing. This work was supported by the German Israeli Foundation grant I 0352–073.01/94 to P. J.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_identifier":{"issn":["0022-3751"]},"extern":"1","pmid":1,"_id":"3485","doi":"10.1111/j.1469-7793.1997.593ba.x","year":"1997","external_id":{"pmid":["9457638"]},"title":"Functional differences in Na+ channel gating between fast-spiking interneurones and principal neurones in rat hippocampus","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1160038/","open_access":"1"}]},{"page":"359 - 365","publication":"Journal of Physiology","issue":"Pt 2","type":"journal_article","day":"15","status":"public","intvolume":"       504","date_created":"2018-12-11T12:03:35Z","date_published":"1997-10-15T00:00:00Z","article_type":"original","month":"10","language":[{"iso":"eng"}],"publisher":"Wiley-Blackwell","article_processing_charge":"No","oa":1,"publist_id":"2901","volume":504,"date_updated":"2022-08-19T12:02:21Z","quality_controlled":"1","oa_version":"Published Version","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"We thank Drs J. R. P. Geiger, M. Martina, and D. Schild for critically reading the manuscript, and Mrs B. Plessow-Freudenberg for technical assistance. This work was supported by DFG grant BI 642/1-1 and German Israeli Foundation grant I 0352-073.01/94.","publication_identifier":{"issn":["0022-3751"]},"extern":"1","pmid":1,"_id":"3486","citation":{"chicago":"Bischofberger, Joseph, and Peter M Jonas. “Action Potential Propagation into the Presynaptic Dendrites of Rat Mitral Cells.” <i>Journal of Physiology</i>. Wiley-Blackwell, 1997. <a href=\"https://doi.org/10.1111/j.1469-7793.1997.359be.x\">https://doi.org/10.1111/j.1469-7793.1997.359be.x</a>.","apa":"Bischofberger, J., &#38; Jonas, P. M. (1997). Action potential propagation into the presynaptic dendrites of rat mitral cells. <i>Journal of Physiology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1469-7793.1997.359be.x\">https://doi.org/10.1111/j.1469-7793.1997.359be.x</a>","ieee":"J. Bischofberger and P. M. Jonas, “Action potential propagation into the presynaptic dendrites of rat mitral cells,” <i>Journal of Physiology</i>, vol. 504, no. Pt 2. Wiley-Blackwell, pp. 359–365, 1997.","short":"J. Bischofberger, P.M. Jonas, Journal of Physiology 504 (1997) 359–365.","ista":"Bischofberger J, Jonas PM. 1997. Action potential propagation into the presynaptic dendrites of rat mitral cells. Journal of Physiology. 504(Pt 2), 359–365.","mla":"Bischofberger, Joseph, and Peter M. Jonas. “Action Potential Propagation into the Presynaptic Dendrites of Rat Mitral Cells.” <i>Journal of Physiology</i>, vol. 504, no. Pt 2, Wiley-Blackwell, 1997, pp. 359–65, doi:<a href=\"https://doi.org/10.1111/j.1469-7793.1997.359be.x\">10.1111/j.1469-7793.1997.359be.x</a>.","ama":"Bischofberger J, Jonas PM. Action potential propagation into the presynaptic dendrites of rat mitral cells. <i>Journal of Physiology</i>. 1997;504(Pt 2):359-365. doi:<a href=\"https://doi.org/10.1111/j.1469-7793.1997.359be.x\">10.1111/j.1469-7793.1997.359be.x</a>"},"publication_status":"published","author":[{"last_name":"Bischofberger","full_name":"Bischofberger, Joseph","first_name":"Joseph"},{"orcid":"0000-0001-5001-4804","last_name":"Jonas","full_name":"Jonas, Peter M","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"lang":"eng","text":"1. Dendritic patch-clamp recordings were obtained from mitral cells in rat olfactory bulb slices, up to 350 μm from the soma. Simultaneous dendritic and somatic whole-cell recordings indicated that action potentials (APs) evoked by somatic or dendritic current injection were initiated near the soma. Both the large amplitude (100.7 ± 1.1 mV) and the short duration (1.38 ± 0.07 ms) of the AP were maintained as the AP propagated back into the primary mitral cell dendrites. 2. Outside-out patches isolated from mitral cell dendrites contained voltage-gated Na+ channels (peak conductance density, 90 pS μm-2 at -10 mV). When an AP was used as a somatic voltage-clamp command in the presence of 1 μM tetrodotoxin (TTX), the amplitude of the dendritic potential was attenuated to 48 ± 14 mV. This shows that dendritic Na+ channels support the active back-propagation of APs. 3. Dendritic patches contained voltage-gated K+ channels with high density (conductance density, 513 pS μm-2 at 30 mV. Dendritic K+ currents were reduced to 35% by 1 mM external tetraethylammonium chloride (TEACl). When an AP was used as a somatic voltage clamp command in the presence of TEACl, the dendritic potential was markedly prolonged. This indicates that dendritic K+ channels mediate the fast repolarization of dendritic APs. 4. We conclude that voltage gated Na+ and K+ channels support dendritic APs with large amplitudes and short durations that may trigger fast transmitter release at dendrodendritic synapses in the olfactory bulb."}],"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1159916/","open_access":"1"}],"doi":"10.1111/j.1469-7793.1997.359be.x","year":"1997","title":"Action potential propagation into the presynaptic dendrites of rat mitral cells","external_id":{"pmid":["9365910"]}},{"day":"15","type":"journal_article","intvolume":"        76","status":"public","issue":"4","publication":"Neuroscience","page":"1187 - 1203","month":"01","article_type":"original","date_published":"1997-01-15T00:00:00Z","publisher":"Elsevier","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:03:52Z","publication_status":"published","citation":{"apa":"Bragin, A., Csicsvari, J. L., Penttonen, M., &#38; Buzsáki, G. (1997). Epileptic afterdischarge in the hippocampal-entorhinal system: Current source density and unit studies. <i>Neuroscience</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0306-4522(96)00446-0\">https://doi.org/10.1016/S0306-4522(96)00446-0</a>","ieee":"A. Bragin, J. L. Csicsvari, M. Penttonen, and G. Buzsáki, “Epileptic afterdischarge in the hippocampal-entorhinal system: Current source density and unit studies,” <i>Neuroscience</i>, vol. 76, no. 4. Elsevier, pp. 1187–1203, 1997.","chicago":"Bragin, Anatol, Jozsef L Csicsvari, Markku Penttonen, and György Buzsáki. “Epileptic Afterdischarge in the Hippocampal-Entorhinal System: Current Source Density and Unit Studies.” <i>Neuroscience</i>. Elsevier, 1997. <a href=\"https://doi.org/10.1016/S0306-4522(96)00446-0\">https://doi.org/10.1016/S0306-4522(96)00446-0</a>.","mla":"Bragin, Anatol, et al. “Epileptic Afterdischarge in the Hippocampal-Entorhinal System: Current Source Density and Unit Studies.” <i>Neuroscience</i>, vol. 76, no. 4, Elsevier, 1997, pp. 1187–203, doi:<a href=\"https://doi.org/10.1016/S0306-4522(96)00446-0\">10.1016/S0306-4522(96)00446-0</a>.","ama":"Bragin A, Csicsvari JL, Penttonen M, Buzsáki G. Epileptic afterdischarge in the hippocampal-entorhinal system: Current source density and unit studies. <i>Neuroscience</i>. 1997;76(4):1187-1203. doi:<a href=\"https://doi.org/10.1016/S0306-4522(96)00446-0\">10.1016/S0306-4522(96)00446-0</a>","short":"A. Bragin, J.L. Csicsvari, M. Penttonen, G. Buzsáki, Neuroscience 76 (1997) 1187–1203.","ista":"Bragin A, Csicsvari JL, Penttonen M, Buzsáki G. 1997. Epileptic afterdischarge in the hippocampal-entorhinal system: Current source density and unit studies. Neuroscience. 76(4), 1187–1203."},"abstract":[{"lang":"eng","text":"The contribution of the various hippocampal regions to the maintenance of epileptic activity, induced by stimulation of the perforant path or commissural system, was examined in the awake rat. Combination of multiple-site recordings with silicon probes, current source density analysis and unit recordings allowed for a high spatial resolution of the field events. Following perforant path stimulation, seizures began in the dentate gyrus, followed by events in the CA3-CA1 regions. After commissural stimulation, rhythmic bursts in the CA3-CA1 circuitry preceded the activation of the dentate gyrus. Correlation of events in the different subregions indicated that the sustained rhythmic afterdischarge (2-6 Hz) could not be explained by a cycle-by-cycle excitation of principal cell populations in the hippocampal-entorhinal loop. The primary afterdischarge always terminated in the CA1 region, followed by the dentate gyrus, CA3 region and the entorhinal cortex. The duration and pattern of the hippocampal afterdischarge was essentially unaffected by removal of the entorhinal cortex. The emergence of large population spike bursts coincided with a decreased discharge of interneurons in both CAI and hilar regions. The majority of hilar interneurons displayed a strong amplitude decrement prior to the onset of population spike phase of the afterdischarge. These findings suggest that (i) afterdischarges can independently arise in the CA3-CA1 and entorhinal-dentate gyrus circuitries, (ii) reverberation of excitation in the hippocampal-entorhinal loop is not critical for the maintenance of afterdischarges and (iii) decreased activity of the interneuronal network may release population bursting of principal cells. "}],"author":[{"first_name":"Anatol","full_name":"Bragin, Anatol","last_name":"Bragin"},{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","last_name":"Csicsvari","full_name":"Csicsvari, Jozsef L","orcid":"0000-0002-5193-4036","first_name":"Jozsef L"},{"first_name":"Markku","last_name":"Penttonen","full_name":"Penttonen, Markku"},{"full_name":"Buzsáki, György","last_name":"Buzsáki","first_name":"György"}],"volume":76,"date_updated":"2022-08-19T11:53:06Z","publist_id":"2844","article_processing_charge":"No","pmid":1,"_id":"3541","extern":"1","publication_identifier":{"issn":["0306-4522"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"We thank K. Wise and J. Hetke for providing us the silicon probes, J. J. Chrobak, S. L-W. Leung, G. G. Somjen and R. D. Traub for their comments on the manuscript. This work was supported by NINDS (NS34994; 1P41RR09754; NS33310) and the Whitehall Foundation. M. Penttonen was a visiting scholar at Rutgers University, supported by the Finnish Academy of Sciences and the A. I. Virtanen Institute.","quality_controlled":"1","oa_version":"None","year":"1997","doi":"10.1016/S0306-4522(96)00446-0","title":"Epileptic afterdischarge in the hippocampal-entorhinal system: Current source density and unit studies","external_id":{"pmid":["9027878"]}},{"date_created":"2018-12-11T12:04:20Z","month":"05","article_type":"original","date_published":"1997-05-01T00:00:00Z","publisher":"Genetics Society of America","scopus_import":"1","language":[{"iso":"eng"}],"issue":"1","publication":"Genetics","page":"427 - 441","day":"01","type":"journal_article","intvolume":"       146","status":"public","main_file_link":[{"open_access":"1","url":"https://academic.oup.com/genetics/article/146/1/427/6053913"}],"doi":"10.1093/genetics/146.1.427","year":"1997","external_id":{"pmid":["9136031 "]},"title":"The effective size of a subdivided population","oa":1,"date_updated":"2022-08-19T10:01:10Z","publist_id":"2753","volume":146,"article_processing_charge":"No","_id":"3630","pmid":1,"extern":"1","publication_identifier":{"issn":["0016-6731"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"This paper has benefited greatly from the kind efforts oF ARMANDO CABALLERO, PETER KEIGHTLEY, BEATE NÜRNBERCER and SALLY OTTO in reading and discussing the manuscript. We also thank MONTY SLATKIN and three anonymous reviewers for their helpful comments. One of these reviewers in particular greatly improved this paper. The work reported here was supported by a grant from the Science and Engineering Research Council (U.R) and the Darwin Trust of Edinburgh, as well as by the Natural Sciences and Engineering Research Council (Canada).","quality_controlled":"1","oa_version":"Published Version","publication_status":"published","citation":{"ama":"Whitlock M, Barton NH. The effective size of a subdivided population. <i>Genetics</i>. 1997;146(1):427-441. doi:<a href=\"https://doi.org/10.1093/genetics/146.1.427\">10.1093/genetics/146.1.427</a>","mla":"Whitlock, Michael, and Nicholas H. Barton. “The Effective Size of a Subdivided Population.” <i>Genetics</i>, vol. 146, no. 1, Genetics Society of America, 1997, pp. 427–41, doi:<a href=\"https://doi.org/10.1093/genetics/146.1.427\">10.1093/genetics/146.1.427</a>.","short":"M. Whitlock, N.H. Barton, Genetics 146 (1997) 427–441.","ista":"Whitlock M, Barton NH. 1997. The effective size of a subdivided population. Genetics. 146(1), 427–441.","apa":"Whitlock, M., &#38; Barton, N. H. (1997). The effective size of a subdivided population. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1093/genetics/146.1.427\">https://doi.org/10.1093/genetics/146.1.427</a>","ieee":"M. Whitlock and N. H. Barton, “The effective size of a subdivided population,” <i>Genetics</i>, vol. 146, no. 1. Genetics Society of America, pp. 427–441, 1997.","chicago":"Whitlock, Michael, and Nicholas H Barton. “The Effective Size of a Subdivided Population.” <i>Genetics</i>. Genetics Society of America, 1997. <a href=\"https://doi.org/10.1093/genetics/146.1.427\">https://doi.org/10.1093/genetics/146.1.427</a>."},"abstract":[{"lang":"eng","text":"This paper derives the long-term effective size, Ne, for a general model of population subdivision, allowing for differential deme fitness, variable emigration and immigration rates, extinction, colonization, and correlations across generations in these processes. We show that various long-term measures of Ne are equivalent. The effective size of a metapopulation can be expressed in a variety of ways. At a demographic equilibrium, Ne can be derived from the demography by combining information about the ultimate contribution of each deme to the future genetic make-up of the population and Wright's FST's. The effective size is given by Ne = 1/(1 + var (upsilon) ((1 - FST)/Nin), where n is the number of demes, theta i is the eventual contribution of individuals in deme i to the whole population (scaled such that sigma theta i = n), and &lt; &gt; denotes an average weighted by theta i. This formula is applied to a catastrophic extinction model (where sites are either empty or at carrying capacity) and to a metapopulation model with explicit dynamics, where extinction is caused by demographic stochasticity and by chaos. Contrary to the expectation from the standard island model, the usual effect of population subdivision is to decrease the effective size relative to a panmictic population living on the same resource."}],"author":[{"last_name":"Whitlock","full_name":"Whitlock, Michael","first_name":"Michael"},{"full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}]},{"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","oa_version":"Published Version","_id":"3631","extern":"1","publication_identifier":{"issn":["1010-061X"]},"publist_id":"2752","volume":10,"date_updated":"2022-08-19T09:46:51Z","oa":1,"article_processing_charge":"No","author":[{"full_name":"Kawecki, Tadeusz","last_name":"Kawecki","first_name":"Tadeusz"},{"last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"first_name":"James","last_name":"Fry","full_name":"Fry, James"}],"abstract":[{"text":"In spatially heterogeneous environments, natural selection for maintenance of adaptation to habitats that contribute little to the population's reproduction is weak. In this paper we model a mechanism that can result in loss of fitness in such marginal habitats, and thus lead to specialisation on the main habitat. It involves accumulation of mutations that are deleterious in the marginal habitat but neutral or nearly so in the main habitat (mutations deleterious in the main habitat and neutral in the marginal habitat have a negligible influence). If the contribution of the marginal habitat to total reproduction in the absence of the mutations is less than a threshold value, selection is too weak to counter accumulation of such mutations. A positive feedback then results in loss of fitness in the marginal habitat. This mechanism does not require antagonistic pleiotropy in adaptation to different habitats, although antagonistic pleiotropy facilitates the mutational collapse of fitness in the marginal habitat. We suggest that deleterious mutations with habitat-specific expression may play a role in the evolution of ecological specialisation and promote evolutionary conservatism of ecological niches.","lang":"eng"}],"publication_status":"published","citation":{"mla":"Kawecki, Tadeusz, et al. “Mutational Collapse of Fitness in Marginal Habitats and the Evolution of Ecological Specialisation.” <i>Journal of Evolutionary Biology</i>, vol. 10, no. 3, Wiley-Blackwell, 1997, pp. 407–30, doi:<a href=\"https://doi.org/10.1046/j.1420-9101.1997.10030407.x\">10.1046/j.1420-9101.1997.10030407.x</a>.","ama":"Kawecki T, Barton NH, Fry J. Mutational collapse of fitness in marginal habitats and the evolution of ecological specialisation. <i>Journal of Evolutionary Biology</i>. 1997;10(3):407-430. doi:<a href=\"https://doi.org/10.1046/j.1420-9101.1997.10030407.x\">10.1046/j.1420-9101.1997.10030407.x</a>","ista":"Kawecki T, Barton NH, Fry J. 1997. Mutational collapse of fitness in marginal habitats and the evolution of ecological specialisation. Journal of Evolutionary Biology. 10(3), 407–430.","short":"T. Kawecki, N.H. Barton, J. Fry, Journal of Evolutionary Biology 10 (1997) 407–430.","apa":"Kawecki, T., Barton, N. H., &#38; Fry, J. (1997). Mutational collapse of fitness in marginal habitats and the evolution of ecological specialisation. <i>Journal of Evolutionary Biology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1046/j.1420-9101.1997.10030407.x\">https://doi.org/10.1046/j.1420-9101.1997.10030407.x</a>","ieee":"T. Kawecki, N. H. Barton, and J. Fry, “Mutational collapse of fitness in marginal habitats and the evolution of ecological specialisation,” <i>Journal of Evolutionary Biology</i>, vol. 10, no. 3. Wiley-Blackwell, pp. 407–430, 1997.","chicago":"Kawecki, Tadeusz, Nicholas H Barton, and James Fry. “Mutational Collapse of Fitness in Marginal Habitats and the Evolution of Ecological Specialisation.” <i>Journal of Evolutionary Biology</i>. Wiley-Blackwell, 1997. <a href=\"https://doi.org/10.1046/j.1420-9101.1997.10030407.x\">https://doi.org/10.1046/j.1420-9101.1997.10030407.x</a>."},"main_file_link":[{"url":"https://onlinelibrary.wiley.com/doi/abs/10.1046/j.1420-9101.1997.10030407.x","open_access":"1"}],"title":"Mutational collapse of fitness in marginal habitats and the evolution of ecological specialisation","doi":"10.1046/j.1420-9101.1997.10030407.x","year":"1997","page":"407 - 430","issue":"3","publication":"Journal of Evolutionary Biology","status":"public","intvolume":"        10","type":"journal_article","day":"01","date_created":"2018-12-11T12:04:20Z","language":[{"iso":"eng"}],"publisher":"Wiley-Blackwell","scopus_import":"1","date_published":"1997-05-01T00:00:00Z","article_type":"original","month":"05"},{"main_file_link":[{"url":"https://europepmc.org/article/med/9037044","open_access":"1"}],"title":"The strength of indirect selection on female mating preferences","external_id":{"pmid":["9037044 "]},"doi":"10.1073/pnas.94.4.1282","year":"1997","publication_identifier":{"issn":["0027-8424"]},"extern":"1","_id":"3632","pmid":1,"quality_controlled":"1","oa_version":"Published Version","acknowledgement":"We thank J. J. Bull, M. J. Ryan, M. Wade, B. Walsh, G. C. Williams, and an anonymous reviewer for discussions and suggestions. This research was supported by National Science Foundation Grant DEB94 – 07969, Biotechnology and Biological Sciences Research Council Grants GRyHy09928 and GRyJy76057, and a travel grant from the Burroughs-Wellcome Fund.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","oa":1,"publist_id":"2751","date_updated":"2022-08-19T09:25:21Z","volume":94,"abstract":[{"lang":"eng","text":"An important but controversial class of hypotheses concerning the evolution of female preferences for extreme male mating displays involves 'indirect selection.' Even in the absence of direct fitness effects, preference for males with high overall fitness can spread via a genetic correlation that develops between preference alleles and high fitness genotypes. Here we develop a quantitative expression for the force of indirect selection that (i) applies to any female mating behavior, (ii) is relatively insensitive to the underlying genetics, and (iii) is based on measurable quantities. In conjunction with the limited data now available, it suggests that the evolutionary force generated by indirect selection on preferences is weak in absolute terms. This finding raises the possibility that direct selection on preference genes may often be more important than indirect selection, but more data on the quantities identified by our model and on direct selection are needed to decide the question."}],"author":[{"full_name":"Kirkpatrick, Mark","last_name":"Kirkpatrick","first_name":"Mark"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"}],"citation":{"chicago":"Kirkpatrick, Mark, and Nicholas H Barton. “The Strength of Indirect Selection on Female Mating Preferences.” <i>PNAS</i>. National Academy of Sciences, 1997. <a href=\"https://doi.org/10.1073/pnas.94.4.1282\">https://doi.org/10.1073/pnas.94.4.1282</a>.","apa":"Kirkpatrick, M., &#38; Barton, N. H. (1997). The strength of indirect selection on female mating preferences. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.94.4.1282\">https://doi.org/10.1073/pnas.94.4.1282</a>","ieee":"M. Kirkpatrick and N. H. Barton, “The strength of indirect selection on female mating preferences,” <i>PNAS</i>, vol. 94, no. 4. National Academy of Sciences, pp. 1282–1286, 1997.","short":"M. Kirkpatrick, N.H. Barton, PNAS 94 (1997) 1282–1286.","ista":"Kirkpatrick M, Barton NH. 1997. The strength of indirect selection on female mating preferences. PNAS. 94(4), 1282–1286.","ama":"Kirkpatrick M, Barton NH. The strength of indirect selection on female mating preferences. <i>PNAS</i>. 1997;94(4):1282-1286. doi:<a href=\"https://doi.org/10.1073/pnas.94.4.1282\">10.1073/pnas.94.4.1282</a>","mla":"Kirkpatrick, Mark, and Nicholas H. Barton. “The Strength of Indirect Selection on Female Mating Preferences.” <i>PNAS</i>, vol. 94, no. 4, National Academy of Sciences, 1997, pp. 1282–86, doi:<a href=\"https://doi.org/10.1073/pnas.94.4.1282\">10.1073/pnas.94.4.1282</a>."},"publication_status":"published","date_created":"2018-12-11T12:04:21Z","scopus_import":"1","publisher":"National Academy of Sciences","language":[{"iso":"eng"}],"month":"02","date_published":"1997-02-18T00:00:00Z","article_type":"original","publication":"PNAS","issue":"4","page":"1282 - 1286","intvolume":"        94","status":"public","day":"18","type":"journal_article"},{"title":"Evolution of a species' range","external_id":{"pmid":["18811273"]},"doi":"10.1086/286054","year":"1997","author":[{"full_name":"Kirkpatrick, Mark","last_name":"Kirkpatrick","first_name":"Mark"},{"last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"lang":"eng","text":"Gene flow from the center of a species' range can stymie adaptation at the periphery and prevent the range from expanding outward. We study this process using simple models that track both demography and the evolution of a quantitative trait in a population that is continuously distributed in space. Stabilizing selection acts on the trait and favors an optimum phenotype that changes linearly across the habitat. One of three outcomes is possible: the species will become extinct, expand to fill all of the available habitat, or be confined to a limited range in which it is significantly adapted to allow population growth. When the environment changes rapidly in space, increased migration inhibits local adaptation and so decreases the species' total population size. Gene flow can cause enough maladaptation that the peripheral half of a species' range acts as an demographic sink. The trait's genetic variance has little effect on species persistence or the size of the range when gene flow is sufficiently strong to keep population densities far below the carrying capacity throughout the range, but it can increase the range width and population size of an abundant species. Under some conditions, a small parameter change can dramatically shift the balance between gene flow and local adaptation, allowing a species with a limited range to suddenly expand to fill all the available habitat."}],"publication_status":"published","citation":{"ama":"Kirkpatrick M, Barton NH. Evolution of a species’ range. <i>American Naturalist</i>. 1997;150(1):1-23. doi:<a href=\"https://doi.org/10.1086/286054\">10.1086/286054</a>","mla":"Kirkpatrick, Mark, and Nicholas H. Barton. “Evolution of a Species’ Range.” <i>American Naturalist</i>, vol. 150, no. 1, University of Chicago Press, 1997, pp. 1–23, doi:<a href=\"https://doi.org/10.1086/286054\">10.1086/286054</a>.","ista":"Kirkpatrick M, Barton NH. 1997. Evolution of a species’ range. American Naturalist. 150(1), 1–23.","short":"M. Kirkpatrick, N.H. Barton, American Naturalist 150 (1997) 1–23.","apa":"Kirkpatrick, M., &#38; Barton, N. H. (1997). Evolution of a species’ range. <i>American Naturalist</i>. University of Chicago Press. <a href=\"https://doi.org/10.1086/286054\">https://doi.org/10.1086/286054</a>","ieee":"M. Kirkpatrick and N. H. Barton, “Evolution of a species’ range,” <i>American Naturalist</i>, vol. 150, no. 1. University of Chicago Press, pp. 1–23, 1997.","chicago":"Kirkpatrick, Mark, and Nicholas H Barton. “Evolution of a Species’ Range.” <i>American Naturalist</i>. University of Chicago Press, 1997. <a href=\"https://doi.org/10.1086/286054\">https://doi.org/10.1086/286054</a>."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","quality_controlled":"1","pmid":1,"_id":"3633","extern":"1","publication_identifier":{"issn":["0003-0147"]},"publist_id":"2750","date_updated":"2022-08-19T08:38:36Z","volume":150,"article_processing_charge":"No","language":[{"iso":"eng"}],"publisher":"University of Chicago Press","scopus_import":"1","date_published":"1997-07-01T00:00:00Z","article_type":"original","month":"07","date_created":"2018-12-11T12:04:21Z","status":"public","intvolume":"       150","type":"journal_article","day":"01","page":"1 - 23","issue":"1","publication":"American Naturalist"},{"intvolume":"         7","status":"public","day":"01","type":"journal_article","publication":"International Journal of Computational Geometry & Applications","issue":"4","page":"365 - 378","scopus_import":"1","publisher":"World Scientific Publishing","language":[{"iso":"eng"}],"month":"01","date_published":"1997-01-01T00:00:00Z","article_type":"original","date_created":"2018-12-11T12:06:28Z","abstract":[{"text":"Given a subspace X subset of or equal to R-d and a finite set S subset of or equal to R-d, we introduce the Delaunay complex, D-X, restricted by X. Its simplices are spanned by subsets T subset of or equal to S for which the common intersection of Voronoi cells meets X in a non-empty set. By the nerve theorem, boolean OR D-X and X are homotopy equivalent if all such sets are contractible. This paper proves a sufficient condition for boolean OR D-X and X be homeomorphic.","lang":"eng"}],"author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nimish","last_name":"Shah","full_name":"Shah, Nimish"}],"citation":{"ista":"Edelsbrunner H, Shah N. 1997. Triangulating topological spaces. International Journal of Computational Geometry &#38; Applications. 7(4), 365–378.","short":"H. Edelsbrunner, N. Shah, International Journal of Computational Geometry &#38; Applications 7 (1997) 365–378.","mla":"Edelsbrunner, Herbert, and Nimish Shah. “Triangulating Topological Spaces.” <i>International Journal of Computational Geometry &#38; Applications</i>, vol. 7, no. 4, World Scientific Publishing, 1997, pp. 365–78, doi:<a href=\"https://doi.org/10.1142/S0218195997000223\">10.1142/S0218195997000223</a>.","ama":"Edelsbrunner H, Shah N. Triangulating topological spaces. <i>International Journal of Computational Geometry &#38; Applications</i>. 1997;7(4):365-378. doi:<a href=\"https://doi.org/10.1142/S0218195997000223\">10.1142/S0218195997000223</a>","chicago":"Edelsbrunner, Herbert, and Nimish Shah. “Triangulating Topological Spaces.” <i>International Journal of Computational Geometry &#38; Applications</i>. World Scientific Publishing, 1997. <a href=\"https://doi.org/10.1142/S0218195997000223\">https://doi.org/10.1142/S0218195997000223</a>.","apa":"Edelsbrunner, H., &#38; Shah, N. (1997). Triangulating topological spaces. <i>International Journal of Computational Geometry &#38; Applications</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0218195997000223\">https://doi.org/10.1142/S0218195997000223</a>","ieee":"H. Edelsbrunner and N. Shah, “Triangulating topological spaces,” <i>International Journal of Computational Geometry &#38; Applications</i>, vol. 7, no. 4. World Scientific Publishing, pp. 365–378, 1997."},"publication_status":"published","publication_identifier":{"issn":["0925-7721"]},"extern":"1","_id":"4018","quality_controlled":"1","oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"Partially supported by the National Science Foundation, under grant ASC-200301 and the Alan T. Waterman award, grant CCR-9118874.","article_processing_charge":"No","date_updated":"2022-08-19T08:32:23Z","volume":7,"publist_id":"2106","title":"Triangulating topological spaces","year":"1997","doi":"10.1142/S0218195997000223"},{"main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/S0925772196000065","open_access":"1"}],"year":"1997","doi":"10.1016/S0925-7721(96)00006-5","title":"A combinatorial approach to cartograms","article_processing_charge":"No","date_updated":"2022-08-19T08:12:03Z","volume":7,"publist_id":"2105","oa":1,"publication_identifier":{"issn":["0925-7721"]},"extern":"1","_id":"4021","oa_version":"Published Version","acknowledgement":"The authors thank Jack Snoeyink for bringing the cartogram problem to their attention, and Michael McAllister for providing pointers to the literature on cartograms. ","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"ista":"Edelsbrunner H, Waupotitsch R. 1997. A combinatorial approach to cartograms. Computational Geometry: Theory and Applications. 7(5–6), 343–360.","short":"H. Edelsbrunner, R. Waupotitsch, Computational Geometry: Theory and Applications 7 (1997) 343–360.","mla":"Edelsbrunner, Herbert, and Roman Waupotitsch. “A Combinatorial Approach to Cartograms.” <i>Computational Geometry: Theory and Applications</i>, vol. 7, no. 5–6, Elsevier, 1997, pp. 343–60, doi:<a href=\"https://doi.org/10.1016/S0925-7721(96)00006-5\">10.1016/S0925-7721(96)00006-5</a>.","ama":"Edelsbrunner H, Waupotitsch R. A combinatorial approach to cartograms. <i>Computational Geometry: Theory and Applications</i>. 1997;7(5-6):343-360. doi:<a href=\"https://doi.org/10.1016/S0925-7721(96)00006-5\">10.1016/S0925-7721(96)00006-5</a>","chicago":"Edelsbrunner, Herbert, and Roman Waupotitsch. “A Combinatorial Approach to Cartograms.” <i>Computational Geometry: Theory and Applications</i>. Elsevier, 1997. <a href=\"https://doi.org/10.1016/S0925-7721(96)00006-5\">https://doi.org/10.1016/S0925-7721(96)00006-5</a>.","ieee":"H. Edelsbrunner and R. Waupotitsch, “A combinatorial approach to cartograms,” <i>Computational Geometry: Theory and Applications</i>, vol. 7, no. 5–6. Elsevier, pp. 343–360, 1997.","apa":"Edelsbrunner, H., &#38; Waupotitsch, R. (1997). A combinatorial approach to cartograms. <i>Computational Geometry: Theory and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0925-7721(96)00006-5\">https://doi.org/10.1016/S0925-7721(96)00006-5</a>"},"publication_status":"published","abstract":[{"lang":"eng","text":"A homeomorphism from R-2 to itself distorts metric quantities, such as distance and area. We describe an algorithm that constructs homeomorphisms with prescribed area distortion. Such homeomorphisms can be used to generate cartograms, which are geographic maps purposely distorted so their area distributions reflects a variable different from area, as for example population density. The algorithm generates the homeomorphism through a sequence of local piecewise linear homeomorphic changes. Sample results produced by the preliminary implementation of the method are included."}],"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"first_name":"Roman","full_name":"Waupotitsch, Roman","last_name":"Waupotitsch"}],"date_created":"2018-12-11T12:06:29Z","month":"04","date_published":"1997-04-01T00:00:00Z","article_type":"original","publisher":"Elsevier","language":[{"iso":"eng"}],"publication":"Computational Geometry: Theory and Applications","issue":"5-6","page":"343 - 360","popular_science":"1","day":"01","type":"journal_article","intvolume":"         7","status":"public"},{"date_created":"2018-12-11T12:06:29Z","language":[{"iso":"eng"}],"publisher":"Springer","scopus_import":"1","article_type":"original","date_published":"1997-04-01T00:00:00Z","month":"04","page":"243 - 255","issue":"3","publication":"Discrete & Computational Geometry","status":"public","intvolume":"        17","type":"journal_article","day":"01","title":"Cutting dense point sets in half","doi":"10.1007/PL00009291","year":"1997","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"Partially supported by the National Science Foundation, under Grant ASC-9200301 and the Alan T. Waterman award, Grant CCR-9118874.","oa_version":"None","quality_controlled":"1","_id":"4022","extern":"1","publication_identifier":{"issn":["0179-5376"]},"publist_id":"2103","date_updated":"2022-08-18T14:08:38Z","volume":17,"article_processing_charge":"No","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Valtr","full_name":"Valtr, Pavel","first_name":"Pavel"},{"last_name":"Welzl","full_name":"Welzl, Emo","first_name":"Emo"}],"abstract":[{"text":"A halving hyperplane of a set S of n points in R(d) contains d affinely independent points of S so that equally many of the points off the hyperplane lie in each of the two half-spaces. We prove bounds on the number of halving hyperplanes under the condition that the ratio of largest over smallest distance between any two points is at most delta n(1/d), delta some constant. Such a set S is called dense. In d = 2 dimensions the number of halving lines for a dense set can be as much as Omega(n log n), and it cannot exceed O (n(5/4)/log* n). The upper bound improves over the current best bound of O (n(3/2)/log* n) which holds more generally without any density assumption. In d = 3 dimensions we show that O (n(7/3)) is an upper bound on the number of halving planes for a dense set, The proof is based on a metric argument that can be extended to d greater than or equal to 4 dimensions, where it leads to O (n(d-2/d)) as an upper bound for the number of halving hyperplanes.","lang":"eng"}],"publication_status":"published","citation":{"ieee":"H. Edelsbrunner, P. Valtr, and E. Welzl, “Cutting dense point sets in half,” <i>Discrete &#38; Computational Geometry</i>, vol. 17, no. 3. Springer, pp. 243–255, 1997.","apa":"Edelsbrunner, H., Valtr, P., &#38; Welzl, E. (1997). Cutting dense point sets in half. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/PL00009291\">https://doi.org/10.1007/PL00009291</a>","chicago":"Edelsbrunner, Herbert, Pavel Valtr, and Emo Welzl. “Cutting Dense Point Sets in Half.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1997. <a href=\"https://doi.org/10.1007/PL00009291\">https://doi.org/10.1007/PL00009291</a>.","ama":"Edelsbrunner H, Valtr P, Welzl E. Cutting dense point sets in half. <i>Discrete &#38; Computational Geometry</i>. 1997;17(3):243-255. doi:<a href=\"https://doi.org/10.1007/PL00009291\">10.1007/PL00009291</a>","mla":"Edelsbrunner, Herbert, et al. “Cutting Dense Point Sets in Half.” <i>Discrete &#38; Computational Geometry</i>, vol. 17, no. 3, Springer, 1997, pp. 243–55, doi:<a href=\"https://doi.org/10.1007/PL00009291\">10.1007/PL00009291</a>.","ista":"Edelsbrunner H, Valtr P, Welzl E. 1997. Cutting dense point sets in half. Discrete &#38; Computational Geometry. 17(3), 243–255.","short":"H. Edelsbrunner, P. Valtr, E. Welzl, Discrete &#38; Computational Geometry 17 (1997) 243–255."}},{"day":"01","type":"journal_article","intvolume":"        17","status":"public","publication":"Discrete & Computational Geometry","issue":"3","page":"287 - 306","month":"04","date_published":"1997-04-01T00:00:00Z","article_type":"original","scopus_import":"1","publisher":"Springer","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:06:30Z","citation":{"mla":"Edelsbrunner, Herbert, and Edgar Ramos. “Inclusion-Exclusion Complexes for Pseudodisk Collections.” <i>Discrete &#38; Computational Geometry</i>, vol. 17, no. 3, Springer, 1997, pp. 287–306, doi:<a href=\"https://doi.org/10.1007/PL00009295\">10.1007/PL00009295</a>.","ama":"Edelsbrunner H, Ramos E. Inclusion-exclusion complexes for pseudodisk collections. <i>Discrete &#38; Computational Geometry</i>. 1997;17(3):287-306. doi:<a href=\"https://doi.org/10.1007/PL00009295\">10.1007/PL00009295</a>","ista":"Edelsbrunner H, Ramos E. 1997. Inclusion-exclusion complexes for pseudodisk collections. Discrete &#38; Computational Geometry. 17(3), 287–306.","short":"H. Edelsbrunner, E. Ramos, Discrete &#38; Computational Geometry 17 (1997) 287–306.","apa":"Edelsbrunner, H., &#38; Ramos, E. (1997). Inclusion-exclusion complexes for pseudodisk collections. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/PL00009295\">https://doi.org/10.1007/PL00009295</a>","ieee":"H. Edelsbrunner and E. Ramos, “Inclusion-exclusion complexes for pseudodisk collections,” <i>Discrete &#38; Computational Geometry</i>, vol. 17, no. 3. Springer, pp. 287–306, 1997.","chicago":"Edelsbrunner, Herbert, and Edgar Ramos. “Inclusion-Exclusion Complexes for Pseudodisk Collections.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1997. <a href=\"https://doi.org/10.1007/PL00009295\">https://doi.org/10.1007/PL00009295</a>."},"publication_status":"published","abstract":[{"text":"Let B be a finite pseudodisk collection in the plane. By the principle of inclusion-exclusion, the area or any other measure of the union is [GRAPHICS] We show the existence of a two-dimensional abstract simplicial complex, X subset of or equal to 2(B), so the above relation holds even if X is substituted for 2(B). In addition, X can be embedded in R(2) SO its underlying space is homotopy equivalent to int Boolean OR B, and the frontier of X is isomorphic to the nerve of the set of boundary contributions.","lang":"eng"}],"author":[{"first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ramos, Edgar","last_name":"Ramos","first_name":"Edgar"}],"article_processing_charge":"No","volume":17,"date_updated":"2022-08-18T14:39:39Z","publist_id":"2104","extern":"1","publication_identifier":{"issn":["0179-5376"]},"_id":"4023","quality_controlled":"1","oa_version":"None","acknowledgement":"Supported by the National Science Foundation, under Grant ASC-9200301 and the Alan T. Waterman Award CCR-9118874.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","year":"1997","doi":"10.1007/PL00009295","title":"Inclusion-exclusion complexes for pseudodisk collections"},{"doi":"10.1016/S0896-6273(01)80045-3","year":"1997","title":"Floating head and masterblind regulate neuronal patterning in the roof of the forebrain","external_id":{"pmid":["9010204"]},"main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S0896627301800453?via%3Dihub"}],"citation":{"ieee":"I. Masai, C.-P. J. Heisenberg, K. A. Barth, R. Macdonald, S. Adamek, and S. Wilson, “Floating head and masterblind regulate neuronal patterning in the roof of the forebrain,” <i>Neuron</i>, vol. 18, no. 1. Elsevier, pp. 43–57, 1997.","apa":"Masai, I., Heisenberg, C.-P. J., Barth, K. A., Macdonald, R., Adamek, S., &#38; Wilson, S. (1997). Floating head and masterblind regulate neuronal patterning in the roof of the forebrain. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0896-6273(01)80045-3\">https://doi.org/10.1016/S0896-6273(01)80045-3</a>","chicago":"Masai, Ichiro, Carl-Philipp J Heisenberg, K Anukampa Barth, Rachel Macdonald, Sylwia Adamek, and Stephen Wilson. “Floating Head and Masterblind Regulate Neuronal Patterning in the Roof of the Forebrain.” <i>Neuron</i>. Elsevier, 1997. <a href=\"https://doi.org/10.1016/S0896-6273(01)80045-3\">https://doi.org/10.1016/S0896-6273(01)80045-3</a>.","mla":"Masai, Ichiro, et al. “Floating Head and Masterblind Regulate Neuronal Patterning in the Roof of the Forebrain.” <i>Neuron</i>, vol. 18, no. 1, Elsevier, 1997, pp. 43–57, doi:<a href=\"https://doi.org/10.1016/S0896-6273(01)80045-3\">10.1016/S0896-6273(01)80045-3</a>.","ama":"Masai I, Heisenberg C-PJ, Barth KA, Macdonald R, Adamek S, Wilson S. Floating head and masterblind regulate neuronal patterning in the roof of the forebrain. <i>Neuron</i>. 1997;18(1):43-57. doi:<a href=\"https://doi.org/10.1016/S0896-6273(01)80045-3\">10.1016/S0896-6273(01)80045-3</a>","ista":"Masai I, Heisenberg C-PJ, Barth KA, Macdonald R, Adamek S, Wilson S. 1997. Floating head and masterblind regulate neuronal patterning in the roof of the forebrain. Neuron. 18(1), 43–57.","short":"I. Masai, C.-P.J. Heisenberg, K.A. Barth, R. Macdonald, S. Adamek, S. Wilson, Neuron 18 (1997) 43–57."},"publication_status":"published","author":[{"first_name":"Ichiro","full_name":"Masai, Ichiro","last_name":"Masai"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J"},{"first_name":"K Anukampa","last_name":"Barth","full_name":"Barth, K Anukampa"},{"first_name":"Rachel","full_name":"Macdonald, Rachel","last_name":"Macdonald"},{"last_name":"Adamek","full_name":"Adamek, Sylwia","first_name":"Sylwia"},{"first_name":"Stephen","full_name":"Wilson, Stephen","last_name":"Wilson"}],"abstract":[{"lang":"eng","text":"The epiphysial region of the dorsal diencephalon is the first site at which neurogenesis occurs in the roof of the zebrafish forebrain. We show that the homeobox containing gene floating head (flh) is required for neurogenesis to proceed in the epiphysis. In flh(-) embryos, the first few epiphysial neurons are generated, but beyond the 18 somite stage, neuronal production ceases. In contrast, in masterblind(-) (mbl(-)) embryos, epiphysial neurons are generated throughout the dorsal forebrain. We show that mbl is required to prevent the expression of flh in dorsal forebrain cells rostral to the epiphysis. Furthermore, epiphysial neurons are not ectopically induced in mbl(-)/flh(-) embryos, demonstrating that the epiphysial phenotype of mbl(-) embryos is mediated by ectopic Flh activity. We propose a role for Flh in linking the signaling pathways that regulate regional patterning to the signaling pathways that regulate neurogenesis."}],"article_processing_charge":"No","publist_id":"1946","volume":18,"oa":1,"date_updated":"2022-08-18T14:02:49Z","oa_version":"Published Version","quality_controlled":"1","acknowledgement":"We thank Igor DaMd. Tom Jessell, David Kimelman. Vladimir Koah, Karen Larison. Ingvild Mikkola, Laurie Molday. and Eric Weinberg for probes and antibod-ies: Alex Schist and Juliet Williams for help with the TUNEL tech-nique; Dominic Delaney for analysis of the fih neural plate: Brian Gashing and Geraldine Millard for fish care; Christian Nusslein Volhard for her support: and Corinne Houart. Nigel Holder, and other members of the DBRC for comments on the manuscript. Electron microscopy of the developing epiphysis cited in this study was carried out with the help of Celeste Malinoski. funded by a grant (EY-00168)awarded to Stephen S. Easter. This study was supported by grants from Welcome Trust to S. W. and Human Frontier Science Program to I. M. S.W. is a Wellcome Trust Senior Research Fellow. ","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","publication_identifier":{"issn":["0896-6273"]},"pmid":1,"_id":"4174","article_type":"original","date_published":"1997-01-01T00:00:00Z","month":"01","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Elsevier","date_created":"2018-12-11T12:07:24Z","type":"journal_article","day":"01","status":"public","intvolume":"        18","page":"43 - 57","publication":"Neuron","issue":"1"}]