Browse by all authors Browse By Author ID - Benjamin Burton

Browse Results (43 results found)

Subscribe to the RSS feed for this result setSubscribe to the RSS feed for this result set

Refine

  Abstract Views File Downloads Thomson Reuters Web of Science Citation Count Scopus Citation Count Altmetric Score
Burton, Benjamin A. (2014) A duplicate pair in the SnapPea census. Experimental Mathematics, 23 2: 170-173. doi:10.1080/10586458.2014.886535 19   0 Cited 0 times in Scopus0 0
Burton, Benjamin A. (2010) A mathematician reflecting on the International Olympiad in Informatics. Australian Mathematical Society Gazette, 37 1: 15-21. 78 2
Burton, Benjamin A. (2013). A new approach to crushing 3-manifold triangulations. In: Proceedings of the Annual Symposium on Computational Geometry. 29th Annual Symposium on Computational Geometry (SoCG 2013), Rio de Janeiro, Brazil, (415-424). 17-20 June 2013. doi:10.1145/2462356.2462409 32   Cited 0 times in Scopus0 0
Burton, Benjamin A. and Ozlen, Melih (2011). A tree traversal algorithm for decision problems in knot theory and 3-manifold topology. In: SCoG '11: Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry. 27th Annual Symposium on Computational Geometry (SoCG 2011), Paris, France, (145-152). 13-15 June 2011. doi:10.1145/1998196.1998219 77 2 0 Cited 0 times in Scopus0 0
Burton, Benjamin A. and Ozlen, Melih (2013) A tree traversal algorithm for decision problems in knot theory and 3-manifold topology. Algorithmica, 65 4: 772-801. doi:10.1007/s00453-012-9645-3 47   1 Cited 2 times in Scopus2 0
Burton, Benjamin A. (2008) Breaking the routine: Events to complement informatics olympiad training. Olympiads in Informatics, 2 5-15. 47  
Burton, Benjamin A. (2012). Complementary vertices and adjacency testing in polytopes. In: Joachim Gudmundsson, Julián Mestre and Taso Viglas, Computing and Combinatorics: 18th Annual International Conference, COCOON 2012, proceedings. 18th Annual International Computing and Combinatorics Conference (COCOON 2012), Sydney, Australia, (507-518). 20-22 August 2012. doi:10.1007/978-3-642-32241-9_43 48   Cited 0 times in Scopus0 0
Burton, Benjamin and Spreer, Jonathan (2013). Computationally proving triangulated 4-manifolds to be diffeomorphic. In: Young Researchers Forum, Collections of abstracts. 29th ACM Symposium on Computational Geometry,, Rio de Janeiro, Brazil, (15-16). 17 - 20 June 2013. 13  
Burton, Benjamin, Paixao, Joao and Spreer, Jonathan (2012). Computational topology and normal surfaces: theoretical and experimental complexity bounds. In: Peter Sanders and Norbert Zeh, Proceedings of the Meeting on Algorithm Engineering & Experiments (ALENEX). Meeting on Algorithm Engineering and Experiments (ALENEX13), New Orleans, United States, (78-87). 7 January 2013. 55 8
Burton, Benjamin A. (2013). Computational topology with regina: algorithms, heuristics and implementations. In Craig D. Hodgson, William H. Jaco, Martin G. Scharlemann and Stephan Tillmann (Ed.), Geometry and topology down under: a conference in honour of Hyam Rubinstein (pp. 195-224) Providence, RI, United States: American Mathematical Society. doi:10.1090/conm/597/11877 57 10 0 0
Burton, Benjamin A., Coward, Alexander and Tillmann, Stephen (2013). Computing closed essential surfaces in knot complements. In: Proceedings of the Annual Symposium on Computational Geometry. 29th Annual Symposium on Computational Geometry (SoCG 2013), Rio de Janeiro, Brazil, (405-414). 17-20 June 2013. doi:10.1145/2462356.2462380 37   Cited 2 times in Scopus2 0
Burton, Benjamin A. and Ozlen, Melih (2012) Computing the crosscap number of a knot using integer programming and normal surfaces. ACM Transactions On Mathematical Software, 39 1: 4.1-4.18. doi:10.1145/2382585.2382589 35   0 Cited 4 times in Scopus4 0
Burton, Benjamin A. (2009) Converting between quadrilateral and standard solution sets in normal surface theory. Algebraic and Geometric Topology, 9 4: 2121-2174. doi:10.2140/agt.2009.9.2121 84 3 8 Cited 9 times in Scopus9 0
Burton, Benjamin A. (2014). Courcelle's theorem for triangulations. In: Jonathan Spreer and Uli Wagner, Collection of Abstracts of the Workshop on Triangulations in Geometry and Topology at CG Week 2014 in Kyoto. Workshop on Triangulations in Geometry and Topology. SoCG 2014: Computational Geometry Week 2014. The 30th Annual Symposium on Computational Geometry, Kyoto, Japan, (4-9). 8-11 June, 2014. 12  
Burton, Benjamin A. and Hiron, Mathias (2008) Creating informatics olympiad tasks: Exploring the black art. Olympiads in Informatics, 2 16-36. 47  
Burton, Benjamin A. (2011). Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations. In: ISSAC 2011: Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation. 36th International Symposium on Symbolic and Algebraic Computation [ISSAC], San Jose, CA, United States, (59-66). 8-11 June 2011. doi:10.1145/1993886.1993901 56 1 Cited 3 times in Scopus3 0
Burton, Benjamin A. (2004) Efficient enumeration of 3-manifold triangulations. The Australian Mathematical Society Gazette, 31 2: 111-117. 49  
Burton, Benjamin A. (2010) Encouraging algorithmic thinking without a computer. Olympiads in Informatics, 4 3-14. 41 1
Burton, Benjamin A. (2014). Enumerating fundamental normal surfaces: algorithms, experiments and invariants. In: Ulrich Meyer and Catherine C. McGeoch, 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX). 16th Workshop on Algorithm Engineering and Experiments (ALENEX14), Portland, United States, (112-124). 5 January 2014. doi:10.1137/1.9781611973198.11 53   0
Burton, Benjamin A. (2007) Enumeration of non-orientable 3-manifolds using face-pairing graphs and union-find. Discrete and Computational Geometry, 38 3: 527-571. doi:10.1007/s00454-007-1307-x 39 2 13 Cited 12 times in Scopus12 0
Burton, Benjamin A. (2004) Face pairing graphs and 3-manifold enumeration. Journal of Knot Theory and Its Ramifications (JKTR), 13 8: 1057-1101. doi:10.1142/S0218216504003627 37   13 Cited 14 times in Scopus14 0
Burton, Benjamin A. and Pettersson, William (2014). Fixed parameter tractable algorithms in combinatorial topology. In: Zhipeng Cai, Alex Zelikovsky and Anu Bourgeois, Computing and Combinatorics - 20th International Conference, COCOON 2014, Proceedings. 20th International Computing and Combinatorics Conference, COCOON 2014, Atlanta, GA United States, (300-311). 2 - 6 August 2014. doi:10.1007/978-3-319-08783-2_26 23   Cited 0 times in Scopus0 0
Pohl, Wolfgang, Burton, Benjamin A., Dagienė, Valentina, Fakcharoenphol, Jittat, Forišek, Michal, Hiron, Mathias, Opmanis, Mārtiņš, Skūpas, Bronius and van der Vegt, Willem (2010) Get involved! The IOI workshop 2010, its goals and results. Olympiads in Informatics, 4 158-169. 42  
Burton, Benjamin A. (2007) Informatics olympiads: Approaching mathematics through code. Mathematics Competitions, 20 2: 29-51. 36  
Burton, Benjamin A. (2008). Informatics Olympiads: Challenges in programming and algorithm design. In: Gillian Dobbie and Bernard Mans, CRPIT - Computer Science 2008. Thirty-First Australasian Computer Science Conference (ACSC 2008), Wollongong, NSW, Australia, (9-13). 22-25 Jan 2008. 58   Cited 0 times in Scopus0
Burton, Benjamin A. (2004) Introducing Regina, the 3-manifold topology software. Experimental Mathematics, 13 3: 267-272. 50   18 Cited 22 times in Scopus22
Burton, Benjamin A. and Hiron, Mathias (2013) Locating Regions in a Sequence Under Density Constraints. SIAM Journal on Computing, 42 3: 1201-1215. doi:10.1137/110830605 16   0 Cited 0 times in Scopus0 0
Burton, Benjamin A. (2011) Maximal admissible faces and asymptotic bounds for the normal surface solution space. Journal of Combinatorial Theory: Series A, 118 4: 1410-1435. doi:10.1016/j.jcta.2010.12.011 57 2 2 Cited 4 times in Scopus4 0
Ozlen, Melih, Burton, Benjamin A. and MacRae, Cameron A. G. (2014) Multi-objective integer programming: an improved recursive algorithm. Journal of Optimization Theory and Applications, 160 2: 470-482. doi:10.1007/s10957-013-0364-y 32   1 Cited 0 times in Scopus0 3
Burton, Benjamin A. (2007) Observations from the 8-tetrahedron nonorientable census. Experimental Mathematics, 16 2: 129-144. doi:10.1080/10586458.2007.10128994 37   1 Cited 1 times in Scopus1 0
Ozlen, Melih, Azizoglu, Meral and Burton, Benjamin A. (2013) Optimising a nonlinear utility function in multi-objective integer programming. Journal of Global Optimization, 56 1: 93-102. doi:10.1007/s10898-012-9921-4 23   1 Cited 1 times in Scopus1 0
Burton, Benjamin A. (2010) Optimizing the double description method for normal surface enumeration. Mathematics of Computation, 79 269: 453-484. doi:10.1090/S0025-5718-09-02282-0 50 1 10 Cited 12 times in Scopus12 1
Burton, Benjamin A. (2012) Pachner moves, generic complexity, and randomising 3-manifold triangulations. Oberwolfach Reports, 9 2: 1412-1414. doi:10.4171/OWR/2012/24 26   0
Burton, Benjamin A., Lewiner, Thomas, Paixao, Joao and Spreer, Jonathan (2013). Parameterized complexity of discrete morse theory. In: Proceedings of the Annual Symposium on Computational Geometry. 29th Annual Symposium on Computational Geometry (SoCG 2013), Rio de Janeiro, Brazil, (127-136). 17-20 June 2013. doi:10.1145/2462356.2462391 74 9 Cited 2 times in Scopus2 0
Burton, Benjamin A. (2010) Quadrilateral-octagon coordinates for almost normal surfaces. Experimental Mathematics, 19 3: 285-315. doi:10.1080/10586458.2010.10390625 79 7 5 Cited 5 times in Scopus5 0
Burton, Benjamin A. (2011) Searching a bitstream in linear time for the longest substring of any given density. Algorithmica, 61 3: 555-579. doi:10.1007/s00453-010-9424-y 59 1 1 Cited 1 times in Scopus1 0
Sundaram, Shrikant, Bertok, Peter and Burton, Benjamin (2005). Secure group communication with distributed generation of private keys for ad-hoc networks. In: R. Sasaki, S. Qing, E. Okamoto and H. Yoshiura, Security and Privacy in the Age of Ubiquitous Computing: International Federation for Information Processing. IFIP TC11 20th IFIP International Information Security Conference, Chiba, Japan, (477-492). 3 May- 1 Jun 2005. doi:10.1007/0-387-25660-1_31 41   0 0
Burton, Benjamin A. (2007) Structures of small closed non-orientable 3-manifold triangulations. Journal of Knot Theory and Its Ramifications, 16 5: 545-574. doi:10.1142/S0218216507005439 32   5 Cited 5 times in Scopus5 0
Burton, Benjamin and Spreer, Jonathan (2013). The complexity of detecting taut angle structures on triangulations. In: Sanjeev Khanna, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. 24th ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), New Orleans, United States, (168-183). 6-9 January 2013. 101 15 Cited 1 times in Scopus1
Burton, Benjamin A. (2010). The complexity of the normal surface solution space. In: Proceedings of the 2010 Annual Symposium on Computational Geometry. 26th ACM Symposium on Computational Geometry [SCG], Snowbird, Utah, U.S.A., (201-209). 13-16 June 2010. doi:10.1145/1810959.1810995 80 10 2 Cited 11 times in Scopus11 0
Burton, Benjamin A. (2011). The Pachner graph and the simplification of 3-sphere triangulations. In: SoCG '11 Proceedings of the 27th annual ACM Symposium on Computational Geometry. 27th ACM Symposium on Computational Geometry [SoCG], Paris, France, (153-162). 13-15 June 2011. doi:10.1145/1998196.1998220 40   2 Cited 1 times in Scopus1 6
Burton, Benjamin A., Rubinstein, J. Hyam and Tillmann, Stephan (2012) The Weber-Seifert dodecahedral space is non-Haken. Transactions of the American Mathematical Society, 364 2: 911-932. doi:10.1090/S0002-9947-2011-05419-X 38 1 5 Cited 7 times in Scopus7 0
Budney, Ryan, Burton, Benjamin A. and Hillman, Jonathan (2012) Triangulating a Cappell-Shaneson knot complement. Mathematical Research Letters, 19 5: 1117-1126. 46 5 0 Cited 0 times in Scopus0