|
2013 Conference Publication Computationally proving triangulated 4-manifolds to be diffeomorphicBurton, Benjamin and Spreer, Jonathan (2013). Computationally proving triangulated 4-manifolds to be diffeomorphic. 29th ACM Symposium on Computational Geometry,, Rio de Janeiro, Brazil, 17 - 20 June 2013. |
|
2013 Conference Publication Computing closed essential surfaces in knot complementsBurton, Benjamin A., Coward, Alexander and Tillmann, Stephen (2013). Computing closed essential surfaces in knot complements. 29th Annual Symposium on Computational Geometry (SoCG 2013), Rio de Janeiro, Brazil, 17-20 June 2013. New York, NY United States: Association for Computing Machinery Inc.. doi: 10.1145/2462356.2462380 |
|
2013 Conference Publication Computing closed essential surfaces in knot complementsBurton, Benjamin A., Coward, Alexander and Tillmann, Stephan (2013). Computing closed essential surfaces in knot complements. SoCG '13: Symposium on Computational Geometry 2013, Rio de Janeiro, Brazil, 17 - 20 June 2013. New York, NY United States: Association for Computing Machinery. doi: 10.1145/2493132.2462380 |
|
2013 Conference Publication A new approach to crushing 3-manifold triangulationsBurton, Benjamin A. (2013). A new approach to crushing 3-manifold triangulations. 29th Annual Symposium on Computational Geometry (SoCG 2013), Rio de Janeiro, Brazil, 17-20 June 2013. New York, NY United States: Association for Computing Machinery Inc.. doi: 10.1145/2462356.2462409 |
|
2012 Conference Publication Complementary vertices and adjacency testing in polytopesBurton, Benjamin A. (2012). Complementary vertices and adjacency testing in polytopes. 18th Annual International Computing and Combinatorics Conference (COCOON 2012), Sydney, Australia, 20-22 August 2012. Heidelberg, Germany: Springer. doi: 10.1007/978-3-642-32241-9_43 |
|
2012 Conference Publication Computational topology and normal surfaces: theoretical and experimental complexity boundsBurton, Benjamin, Paixao, Joao and Spreer, Jonathan (2012). Computational topology and normal surfaces: theoretical and experimental complexity bounds. Meeting on Algorithm Engineering and Experiments (ALENEX13), New Orleans, United States, 7 January 2013. Philadelphia, United States: Society for Industrial and Applied Mathematics. doi: 10.1137/1.9781611972931.7 |
|
2011 Conference Publication Detecting genus in vertex links for the fast enumeration of 3-manifold triangulationsBurton, Benjamin A. (2011). Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations. 36th International Symposium on Symbolic and Algebraic Computation [ISSAC], San Jose, CA, United States, 8-11 June 2011. New York, NY, United States: ACM Press. doi: 10.1145/1993886.1993901 |
|
2011 Conference Publication A tree traversal algorithm for decision problems in knot theory and 3-manifold topologyBurton, Benjamin A. and Ozlen, Melih (2011). A tree traversal algorithm for decision problems in knot theory and 3-manifold topology. 27th Annual Symposium on Computational Geometry (SoCG 2011), Paris, France, 13-15 June 2011. New York, NY, United States: ACM Press. doi: 10.1145/1998196.1998219 |
|
2011 Conference Publication The Pachner graph and the simplification of 3-sphere triangulationsBurton, Benjamin A. (2011). The Pachner graph and the simplification of 3-sphere triangulations. 27th ACM Symposium on Computational Geometry [SoCG], Paris, France, 13-15 June 2011. New York, NY, U.S.A.: ACM. doi: 10.1145/1998196.1998220 |
|
2010 Conference Publication The complexity of the normal surface solution spaceBurton, Benjamin A. (2010). The complexity of the normal surface solution space. 26th ACM Symposium on Computational Geometry [SCG], Snowbird, Utah, U.S.A., 13-16 June 2010. New York , U.S.A.: ACM (Association for Computing Machinery) Press. doi: 10.1145/1810959.1810995 |
|
2010 Conference Publication Encouraging algorithmic thinking without a computerBurton, Benjamin A. (2010). Encouraging algorithmic thinking without a computer. Lithuania: Institute of Mathematics and Informatics. |
|
2010 Conference Publication Get involved! The IOI workshop 2010, its goals and resultsPohl, Wolfgang, Burton, Benjamin A., Dagiene, Valentina, Fakcharoenphol, Jittat, Forišek, Michal, Hiron, Mathias, Opmanis, Martiņš, Skupas, Bronius and Van Der Vegt, Willem (2010). Get involved! The IOI workshop 2010, its goals and results. Vilnius University. |
|
2008 Conference Publication Informatics Olympiads: Challenges in programming and algorithm designBurton, Benjamin A. (2008). Informatics Olympiads: Challenges in programming and algorithm design. Thirty-First Australasian Computer Science Conference (ACSC 2008), Wollongong, NSW, Australia, 22-25 Jan 2008. Sydney, Australia: Australian Computer Society (ACS). |
|
2008 Conference Publication Creating informatics olympiad tasks: Exploring the black artBurton, Benjamin A. and Hiron, Mathias (2008). Creating informatics olympiad tasks: Exploring the black art. International Conference Joint with the 20th International Olympiad in Informatics, IOI 2008, Cairo, Egypt, 16 - 23 August 2008. Vilnius University. |
|
2008 Conference Publication Breaking the routine: Events to complement informatics olympiad trainingBurton, Benjamin A. (2008). Breaking the routine: Events to complement informatics olympiad training. International Conference Joint with the 20th International Olympiad in Informatics, IOI 2008, Cairo, Egypt, 16 - 23 August 2008. Vilnius University. |
|
2005 Conference Publication Secure group communication with distributed generation of private keys for ad-hoc networksSundaram, Shrikant, Bertok, Peter and Burton, Benjamin (2005). Secure group communication with distributed generation of private keys for ad-hoc networks. IFIP TC11 20th IFIP International Information Security Conference, Chiba, Japan, 3 May- 1 Jun 2005. New York, USA: Springer. doi: 10.1007/0-387-25660-1_31 |
