TY - JOUR A1 - Schmaltz, Christian A1 - Pokutta, Sebastian A1 - Heidorn, Thomas A1 - Andrae, Silvio T1 - How to make regulators and shareholders happy under Basel III JF - Journal of Banking and Finance Y1 - 2014 UR - http://ssrn.com/abstract=2179490 N1 - Additional Note: 10.1016/j.jbankfin.2014.05.031 N1 - URL of the PDF: http://dx.doi.org/10.1016/j.jbankfin.2014.05.031 SP - 311 EP - 325 ER - TY - JOUR A1 - Braun, Gábor A1 - Pokutta, Sebastian T1 - A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set JF - Operations Research Letters Y1 - 2014 N1 - Additional Note: 10.1016/j.orl.2014.05.004 VL - 42 SP - 307 EP - 310 ER - TY - JOUR A1 - Dey, Santanu Sabush A1 - Pokutta, Sebastian T1 - Design and verify: a new scheme for generating cutting-planes JF - Mathematical Programming A Y1 - 2014 UR - http://www.optimization-online.org/DB_HTML/2011/04/3002.html N1 - Additional Note: DOI: 10.1007/978-3-642-20807-2_12 VL - 145 SP - 199 EP - 222 ER - TY - JOUR A1 - Pokutta, Sebastian A1 - Strüngmann, L. T1 - The Chase radical and reduced products JF - Journal of Pure and Applied Algebra Y1 - 2007 N1 - Additional Note: doi:10.1016/j.jpaa.2007.02.007 N1 - URL of the PDF: http://dx.doi.org/10.1016/j.jpaa.2007.02.007 VL - 211 SP - 532 EP - 540 ER - TY - JOUR A1 - Droste, M. A1 - Göbel, R. A1 - Pokutta, Sebastian T1 - Absolute graphs with prescribed endomorphism monoid JF - Semigroup Forum Y1 - 2008 N1 - URL of the PDF: http://dx.doi.org/doi:10.1007/s00233-007-9029-1 VL - 76 SP - 256 EP - 267 ER - TY - JOUR A1 - Göbel, R. A1 - Pokutta, Sebastian T1 - Construction of dual modules using Martin’s axiom JF - Journal of Algebra Y1 - 2008 N1 - Additional Note: doi:10.1016/j.jalgebra.2008.06.017 N1 - URL of the PDF: https://www.sciencedirect.com/science/article/pii/S0021869308003153 VL - 320 SP - 2388 EP - 2404 ER - TY - JOUR A1 - Heldt, D. A1 - Kreuzer, M. A1 - Pokutta, Sebastian A1 - Poulisse, H. T1 - Approximate Computation of zero-dimensional polynomial ideals JF - Journal of Symbolic Computation Y1 - 2009 N1 - Additional Note: doi:10.1016/j.jsc.2008.11.010 N1 - URL of the PDF: http://dx.doi.org/10.1016/j.jsc.2008.11.010 VL - 44 SP - 1566 EP - 1591 ER - TY - JOUR A1 - Pokutta, Sebastian A1 - Stauffer, G. T1 - France Telecom Workforce Scheduling Problem: a challenge JF - RAIRO-Operations Research Y1 - 2009 N1 - Additional Note: DOI: 10.1051/ro/2009025 N1 - URL of the PDF: http://dx.doi.org/10.1051/ro/2009025 IS - 43 SP - 375 EP - 386 ER - TY - JOUR A1 - Braun, Gábor A1 - Pokutta, Sebastian T1 - Random half-integral polytopes JF - Operations Research Letters Y1 - 2011 UR - http://www.optimization-online.org/DB_HTML/2010/11/2813.html N1 - Additional Note: doi:10.1016/j.orl.2011.03.003 VL - 39 IS - 3 SP - 204 EP - 207 ER - TY - JOUR A1 - Haus, Utz-Uwe A1 - Hemmecke, R. A1 - Pokutta, Sebastian T1 - Reconstructing biochemical cluster networks JF - Journal of Mathematical Chemistry Y1 - 2011 N1 - URL of the PDF: http://dx.doi.org/10.1007/s10910-011-9892-6 VL - 49 IS - 10 SP - 2441 EP - 2456 ER - TY - JOUR A1 - Letchford, A.N. A1 - Pokutta, Sebastian A1 - Schulz, A.S. T1 - On the membership problem for the 0,1/2-closure JF - Operations Research Letters Y1 - 2011 UR - http://www.box.net/shared/zxx88q38l3 N1 - Additional Note: doi:10.1016/j.orl.2011.07.003 N1 - URL of the PDF: http://dx.doi.org/10.1016/j.orl.2011.07.003 VL - 39 IS - 5 SP - 301 EP - 304 ER - TY - JOUR A1 - Pokutta, Sebastian A1 - Schulz, A.S. T1 - Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvátal rank JF - Operations Research Letters Y1 - 2011 UR - http://www.optimization-online.org/DB_HTML/2010/12/2850.html N1 - Additional Note: doi:10.1016/j.orl.2011.09.004 N1 - URL of the PDF: http://dx.doi.org/10.1016/j.orl.2011.09.004 VL - 39 IS - 6 SP - 457 EP - 460 ER - TY - JOUR A1 - Drewes, S. A1 - Pokutta, Sebastian T1 - Computing discrete expected utility maximizing portfolios JF - Journal of Investing Y1 - 2014 UR - http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1662729 VL - 23 IS - 4 SP - 121 EP - 132 ER - TY - JOUR A1 - Drewes, S. A1 - Pokutta, Sebastian T1 - Symmetry-exploiting cuts for a class of mixed-0/1 second order cone programs JF - Discrete Optimization Y1 - 2014 UR - http://www.optimization-online.org/DB_HTML/2010/06/2652.html N1 - Additional Note: doi:10.1016/j.disopt.2014.04.002 VL - 13 SP - 23 EP - 35 ER - TY - JOUR A1 - Martin, Alexander A1 - Müller, J. A1 - Pokutta, Sebastian T1 - Strict linear prices in non-convex European day-ahead electricity markets JF - Optimization Methods and Software Y1 - 2014 UR - http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1660528 N1 - Additional Note: 10.1080/10556788.2013.823544 N1 - URL of the PDF: http://dx.doi.org/10.1080/10556788.2013.823544 VL - 29 IS - 1 SP - 189 EP - 221 ER - TY - JOUR A1 - Briët, Jop A1 - Dadush, Daniel A1 - Pokutta, Sebastian T1 - On the existence of 0/1 polytopes with high semidefinite extension complexity JF - Mathematical Programming B Y1 - 2015 VL - 153 IS - 1 SP - 179 EP - 199 ER - TY - JOUR A1 - Braun, Gábor A1 - Fiorini, Samuel A1 - Pokutta, Sebastian A1 - Steurer, D. T1 - Approximation Limits of Linear Programs (Beyond Hierarchies) JF - Mathematics of Operations Research Y1 - 2015 VL - 40 IS - 3 SP - 179 EP - 199 ER - TY - JOUR A1 - Braun, Gábor A1 - Pokutta, Sebastian T1 - The matching polytope does not admit fully-polynomial size relaxation schemes JF - IEEE Transactions on Information Theory Y1 - 2015 N1 - Additional Note: doi:10.1109/TIT.2015.2465864 N1 - URL of the PDF: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7182355 VL - 61 IS - 10 SP - 1 EP - 11 ER - TY - JOUR A1 - Braun, Gábor A1 - Pokutta, Sebastian A1 - Xie, Y. T1 - Info-Greedy Sequential Adaptive Compressed Sensing JF - IEEE Journal of Selected Topics in Signal Processing Y1 - 2015 VL - 9 IS - 4 SP - 601 EP - 611 ER - TY - JOUR A1 - Fiorini, Samuel A1 - Massar, S. A1 - Pokutta, Sebastian A1 - Tiwary, H.R. A1 - de Wolf, R. T1 - Exponential Lower Bounds for Polytopes in Combinatorial Optimization JF - Journal of the ACM Y1 - 2015 N1 - URL of the PDF: https://doi.org/10.1145/2716307 VL - 62 IS - 2 SP - 1 EP - 17 ER - TY - JOUR A1 - Braun, Gábor A1 - Fiorini, Samuel A1 - Pokutta, Sebastian T1 - Average case polyhedral complexity of the maximum stable set problem JF - Mathematical Programming A Y1 - 2016 N1 - Additional Note: http://www.dagstuhl.de/dagpub/978-3-939897-74-3 N1 - URL of the PDF: https://rdcu.be/7uOy VL - 160 IS - 1 SP - 407 EP - 431 ER - TY - JOUR A1 - Braun, Gábor A1 - Pokutta, Sebastian T1 - A polyhedral characterization of Border Bases JF - SIAM Journal on Discrete Mathematics Y1 - 2016 VL - 30 IS - 1 SP - 239 EP - 265 ER - TY - CHAP A1 - Pokutta, Sebastian A1 - Schmaltz, Christian T1 - Optimal Planning under Basel III Regulations T2 - Proceedings of 24th Australasian Finance and Banking Conference Y1 - 2011 UR - http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1914800 ER - TY - CHAP A1 - Braun, Gábor A1 - Fiorini, Samuel A1 - Pokutta, Sebastian A1 - Steurer, D. T1 - Approximation Limits of Linear Programs (Beyond Hierarchies) T2 - Proceedings of FOCS Y1 - 2012 ER - TY - CHAP A1 - Braun, Gábor A1 - Pokutta, Sebastian T1 - An algebraic view on symmetric extended formulations T2 - Proceedings of ISCO, Lecture Notes in Computer Science Y1 - 2012 VL - 7422 IS - 141--152 ER - TY - CHAP A1 - Fiorini, Samuel A1 - Massar, S. A1 - Pokutta, Sebastian A1 - Tiwary, H.R. A1 - de Wolf, R. T1 - Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds T2 - Proceedings of STOC Y1 - 2012 ER - TY - CHAP A1 - Schmaltz, Christian A1 - Pokutta, Sebastian A1 - Heidorn, Thomas A1 - Andrae, Silvio T1 - How to make regulators and shareholders happy under Basel III T2 - Proceedings of the 26th Australasian Finance and Banking Conference Y1 - 2013 UR - http://ssrn.com/abstract=2179490 N1 - Additional Note: 10.1016/j.jbankfin.2014.05.031 ER - TY - CHAP A1 - Briët, Jop A1 - Dadush, Daniel A1 - Pokutta, Sebastian T1 - On the existence of 0/1 polytopes with high semidefinite extension complexity T2 - Proceedings of ESA Y1 - 2013 ER - TY - CHAP A1 - Braun, Gabor A1 - Pokutta, Sebastian T1 - Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium T2 - Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium Y1 - 2013 UR - http://eccc.hpi-web.de/report/2013/056 SP - 688 EP - 697 ER - TY - CHAP A1 - Braun, Gábor A1 - Fiorini, Samuel A1 - Pokutta, Sebastian T1 - Average case polyhedral complexity of the maximum stable set problem T2 - Proceedings of RANDOM Y1 - 2014 N1 - Additional Note: http://www.dagstuhl.de/dagpub/978-3-939897-74-3 N1 - URL of the PDF: http://www.dagstuhl.de/dagpub/978-3-939897-74-3 ER - TY - CHAP A1 - Braun, Gábor A1 - Pokutta, Sebastian A1 - Xie, Y. T1 - Info-Greedy Sequential Adaptive Compressed Sensing T2 - Proceedings of 52nd Annual Allerton Conference on Communication, Control, and Computing Y1 - 2014 ER - TY - CHAP A1 - Bazzi, Abbas A1 - Fiorini, Samuel A1 - Pokutta, Sebastian A1 - Svensson, Ola T1 - Small linear programs cannot approximate Vertex Cover within a factor of 2 - epsilon T2 - Proceedings of FOCS Y1 - 2015 N1 - URL of the Slides: https://app.box.com/s/00aqupo722bbpmdcyzwt8xmfqzyu14iy ER - TY - CHAP A1 - Soboll, T. A1 - Golas, Ulrike ED - Filipe, J. ED - Fred, A. T1 - A Local-Global Model for Multiagent Systems - Sheaves on the Category MAS T2 - Proceedings of ICAART 2012 Y1 - 2012 VL - 2 SP - 331 EP - 334 PB - SciTePress ER - TY - JOUR A1 - Golas, Ulrike A1 - Lambers, L. A1 - Ehrig, Hartmut A1 - Orejas, Fernando T1 - Attributed Graph Transformation with Inheritance JF - Theoretical Computer Science Y1 - 2012 U6 - https://doi.org/10.1016/j.tcs.2012.01.032 VL - 424 SP - 46 EP - 68 ER - TY - CHAP A1 - Flik, T. A1 - Reinefeld, Alexander ED - Czichos, Horst ED - Hennecke, Manfred T1 - Rechnerorganisation T2 - Hütte – Das Ingenieurwissen Y1 - 2012 SP - J6 EP - J124 PB - Springer-Verlag Berlin ET - 34 ER - TY - CHAP A1 - Golas, Ulrike ED - Ehrig, Hartmut ED - Engels, G. ED - Kreowski, H.-J. ED - Rozenberg, G. T1 - A General Attribution Concept for Models in M-Adhesive Transformation Systems T2 - Proceedings of ICGT 2012 Y1 - 2012 U6 - https://doi.org/10.1007/978-3-642-33654-6_13 VL - 7562 SP - 187 EP - 202 PB - Springer ER - TY - CHAP A1 - Golas, Ulrike A1 - Lambers, L. A1 - Ehrig, Hartmut A1 - Giese, H. ED - Ehrig, Hartmut ED - Engels, G. ED - Kreowski, H.-J. ED - Rozenberg, G. T1 - Towards Bridging the Gap between Formal Foundations and Current Practice for Triple Graph Grammars - Flexible Relations between Source and Target Elements T2 - Proceedings of ICGT 2012 Y1 - 2012 U6 - https://doi.org/10.1007/978-3-642-33654-6_10 VL - 7562 SP - 141 EP - 155 PB - Springer ER - TY - CHAP A1 - Heckel, R. A1 - Ehrig, Hartmut A1 - Golas, Ulrike A1 - Hermann, Frank ED - Ehrig, Hartmut ED - Engels, G. ED - Kreowski, H.-J. ED - Rozenberg, G. T1 - Parallelism and Concurrency of Stochastic Graph Transformations T2 - Proceedings of ICGT 2012 Y1 - 2012 U6 - https://doi.org/10.1007/978-3-642-33654-6_7 VL - 7562 SP - 96 EP - 110 PB - Springer ER - TY - JOUR A1 - Ehrig, Hartmut A1 - Golas, Ulrike A1 - Habel, A. A1 - Lambers, L. A1 - Orejas, Fernando T1 - M-Adhesive Transformation Systems with Nested Application Conditions. Part 2 JF - Fundamenta Informaticae Y1 - 2012 U6 - https://doi.org/10.3233/FI-2012-705 VL - 118 IS - 1-2 SP - 35 EP - 63 ER - TY - GEN ED - Golas, Ulrike ED - Soboll, T. T1 - Proceedings of ACCAT 2012 T2 - Electronic Proceedings in Theoretical Computer Science 93 Y1 - 2012 U6 - https://doi.org/10.4204/EPTCS.93 ER - TY - CHAP A1 - Schäfer, Patrick A1 - Högqvist, Mikael T1 - SFA : a symbolic fourier approximation and index for similarity search in high dimensional datasets T2 - Proceedings of the 15th International Conference on Extending Database Technology Y1 - 2012 UR - http://doi.acm.org/10.1145/2247596.2247656 U6 - https://doi.org/10.1145/2247596.2247656 SP - 516 EP - 527 PB - ACM CY - New York, NY, USA ER - TY - CHAP A1 - Orejas, Fernando A1 - Boronat, Artur A1 - Golas, Ulrike A1 - Mylonakis, Nikos ED - Pfenning, Frank T1 - Checking Bisimilarity for Attributed Graph Transformation T2 - Foundations of Software Science and Computation Structures. Proceedings of FOSSACS 2013 Y1 - 2013 U6 - https://doi.org/10.1007/978-3-642-37075-5_8 VL - 7794 SP - 113 EP - 128 PB - Springer ER - TY - CHAP A1 - Schäfer, Patrick A1 - Dreßler, Sebastian T1 - Shooting Audio Recordings of Insects with SFA T2 - AmiBio Workshop, Bonn, Germany Y1 - 2013 ER - TY - THES A1 - Reinbacher, Uwe T1 - Implementierung und Evaluierung eines FPGA-basierten statischen Paketfilters Y1 - 2013 ER - TY - CHAP A1 - Ritter, Zully A1 - Baumann, Wolfgang A1 - Felsenberg, Dieter T1 - In vivo tibial compressive stiffness variations after HR-pQCT measurements of 60 days immobility during the Berlin bed rest study II using μfinite element analysis T2 - 6th World Congress of Biomechanics (WCB 2010), August 1-6, 2010 Singapore: In Conjunction with 14th International Conference on Biomedical Engineering (ICBME) and 5th Asia Pacific Conference on Biomechanics (APBiomech) KW - finite-element analysis KW - bone structure KW - compressive stiffness KW - bed rest KW - HR-pQCT measurement Y1 - 2010 U6 - https://doi.org/10.1007/978-3-642-14515-5_209 VL - 31 SP - 823 EP - 826 ER - TY - GEN A1 - Baum, Daniel A1 - Lindow, Norbert A1 - Hege, Hans-Christian A1 - Lepper, Verena A1 - Siopi, Tzulia A1 - Kutz, Frank A1 - Mahlow, Kristin A1 - Mahnke, Heinz-Eberhard T1 - Revealing hidden text in rolled and folded papyri N2 - Ancient Egyptian papyri are often folded, rolled up or kept as small packages, sometimes even sealed. Physically unrolling or unfolding these packages might severely damage them. We demonstrate a way to get access to the hidden script without physical unfolding by employing computed tomography and mathematical algorithms for virtual unrolling and unfolding. Our algorithmic approaches are combined with manual interaction. This provides the necessary flexibility to enable the unfolding of even complicated and partly damaged papyrus packages. In addition, it allows us to cope with challenges posed by the structure of ancient papyrus, which is rather irregular, compared to other writing substrates like metallic foils or parchment. Unfolding of packages is done in two stages. In the first stage, we virtually invert the physical folding process step by step until the partially unfolded package is topologically equivalent to a scroll or a papyrus sheet folded only along one fold line. To minimize distortions at this stage, we apply the method of moving least squares. In the second stage, the papyrus is simply flattened, which requires the definition of a medial surface. We have applied our software framework to several papyri. In this work, we present the results of applying our approaches to mockup papyri that were either rolled or folded along perpendicular fold lines. In the case of the folded papyrus, our approach represents the first attempt to address the unfolding of such complicated folds. T3 - ZIB-Report - 17-02 KW - unfolding, papyri, computed tomography Y1 - 2017 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-61826 SN - 1438-0064 ER - TY - JOUR A1 - Lange, Alexander T1 - Reconstruction of disease transmission rates: applications to measles, dengue, and influenza JF - Journal of Theoretical Biology Y1 - 2016 U6 - https://doi.org/10.1016/j.jtbi.2016.04.017 VL - 400 SP - 138 EP - 153 ER - TY - JOUR A1 - Bauer, Gernot A1 - Gribova, Nadezhda A1 - Lange, Alexander A1 - Holm, Christian A1 - Gross, Joachim T1 - Three-body effects in triplets of capped gold nanocrystals JF - Molecular Physics Y1 - 2017 U6 - https://doi.org/10.1080/00268976.2016.1213909 VL - 115 SP - 1031 EP - 1040 ER - TY - GEN A1 - Schiela, Anton T1 - A cubic regularization algorithm for nonconvex optimization in function space (in preparation) N2 - We propose a cubic regularization algorithm that is constructed to deal with nonconvex minimization problems in function space. It allows for a flexible choice of the regularization term and thus accounts for the fact that in such problems one often has to deal with more than one norm. Global and local convergence results are established in a general framework. Moreover, several variants of step computations are compared. In the context of nonlinear elasticity it turns out the a cg method applied to an augmented Hessian is more robust than truncated cg. T3 - ZIB-Report - 12-16 KW - nonconvex optimization KW - optimization in function space KW - nonlinear elasticity Y1 - 2012 SN - 1438-0064 ER - TY - GEN A1 - Lie, Han Cheng A1 - Sullivan, T. J. T1 - Cameron--Martin theorems for sequences of Cauchy-distributed random variables N2 - Given a sequence of Cauchy-distributed random variables defined by a sequence of location parameters and a sequence of scale parameters, we consider another sequence of random variables that is obtained by perturbing the location or scale parameter sequences. Using a result of Kakutani on equivalence of infinite product measures, we provide sufficient conditions for the equivalence of laws of the two sequences. T3 - ZIB-Report - 16-40 Y1 - 2016 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-60230 SN - 1438-0064 ER - TY - GEN A1 - Sullivan, T. J. T1 - Well-posed Bayesian inverse problems and heavy-tailed stable Banach space priors N2 - This article extends the framework of Bayesian inverse problems in infinite-dimensional parameter spaces, as advocated by Stuart (Acta Numer. 19:451–559, 2010) and others, to the case of a heavy-tailed prior measure in the family of stable distributions, such as an infinite-dimensional Cauchy distribution, for which polynomial moments are infinite or undefined. It is shown that analogues of the Karhunen–Loève expansion for square-integrable random variables can be used to sample such measures. Furthermore, under weaker regularity assumptions than those used to date, the Bayesian posterior measure is shown to depend Lipschitz continuously in the Hellinger metric upon perturbations of the misfit function and observed data. T3 - ZIB-Report - 16-30 KW - Bayesian inverse problems KW - heavy-tailed distribution KW - Karhunen–Loève expansion KW - stable distribution KW - uncertainty quantification KW - well-posedness Y1 - 2016 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-59422 SN - 1438-0064 ER - TY - GEN A1 - Costa, Marta A1 - Manton, James D. A1 - Ostrovsky, Aaron D. A1 - Prohaska, Steffen A1 - Jefferis, Gregory S.X.E. T1 - NBLAST: Rapid, sensitive comparison of neuronal structure and construction of neuron family databases N2 - Neural circuit mapping is generating datasets of 10,000s of labeled neurons. New computational tools are needed to search and organize these data. We present NBLAST, a sensitive and rapid algorithm, for measuring pairwise neuronal similarity. NBLAST considers both position and local geometry, decomposing neurons into short segments; matched segments are scored using a probabilistic scoring matrix defined by statistics of matches and non-matches. We validated NBLAST on a published dataset of 16,129 single Drosophila neurons. NBLAST can distinguish neuronal types down to the finest level (single identified neurons) without a priori information. Cluster analysis of extensively studied neuronal classes identified new types and unreported topographical features. Fully automated clustering organized the validation dataset into 1052 clusters, many of which map onto previously described neuronal types. NBLAST supports additional query types including searching neurons against transgene expression patterns. Finally we show that NBLAST is effective with data from other invertebrates and zebrafish. T3 - ZIB-Report - 16-34 KW - neuroinformatics KW - NBLAST KW - neuron similarity KW - cell type KW - clustering Y1 - 2016 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-59672 SN - 1438-0064 ER - TY - JOUR A1 - Costa, Marta A1 - Manton, James D. A1 - Ostrovsky, Aaron D. A1 - Prohaska, Steffen A1 - Jefferis, Gregory S.X.E. T1 - NBLAST: Rapid, Sensitive Comparison of Neuronal Structure and Construction of Neuron Family Databases JF - Neuron N2 - Neural circuit mapping is generating datasets of tens of thousands of labeled neurons. New computational tools are needed to search and organize these data. We present NBLAST, a sensitive and rapid algorithm, for measuring pairwise neuronal similarity. NBLAST considers both position and local geometry, decomposing neurons into short segments; matched segments are scored using a probabilistic scoring matrix defined by statistics of matches and non-matches. We validated NBLAST on a published dataset of 16,129 single Drosophila neurons. NBLAST can distinguish neuronal types down to the finest level (single identified neurons) without a priori information. Cluster analysis of extensively studied neuronal classes identified new types and unreported topographical features. Fully automated clustering organized the validation dataset into 1,052 clusters, many of which map onto previously described neuronal types. NBLAST supports additional query types, including searching neurons against transgene expression patterns. Finally, we show that NBLAST is effective with data from other invertebrates and zebrafish. Y1 - 2016 U6 - https://doi.org/10.1016/j.neuron.2016.06.012 VL - 91 IS - 2 SP - 293 EP - 311 ER -