David Bremner - RankMe

81 papers A 3B 5C 2Journal 44Unranked 27

Year	Rank	Type	Title / Venue / Authors
2026	C	`conf`	Smaller Linear Programs from Algorithms via Constraint Sharing. ICORES Shermin Khosravi, David Bremner
2025	J	`jnl`	Efficient Compilation of Algorithms into Compact Linear Programs. CoRR Shermin Khosravi, David Bremner
2025	J	`jnl`	OOPredictor: Predicting Object-Oriented Accesses using Static Analysis. CoRR Hassan Arafat, David Bremner, Kenneth B. Kent, Julian Wang
2025	J	`jnl`	Optimizations for Dynamic Collections. J. Object Technol. Joannah Nanjekye, David Bremner, Aleksandar Micic
2024	—	`conf`	Stalls in Java Applications on X86 Platforms. VALUETOOLS Zhuoran Li, Hassan Arafat, David Bremner, Kenneth B. Kent, Julian Wang
2023	—	`conf`	Towards Reliable Memory Management for Python Native Extensions. ICOOOLPS@ECOOP Joannah Nanjekye, David Bremner, Aleksandar Micic
2022	J	`jnl`	Sparktope: linear programs from algorithms. Optim. Methods Softw. David Avis, David Bremner
2022	—	`conf`	The Garbage Collection Cost For Meta-Tracing JIT-based Dynamic Languages. CASCON Joannah Nanjekye, David Bremner, Aleksandar Micic
2021	—	`conf`	Eclipse OMR garbage collection for tracing JIT-based virtual machines. CASCON Joannah Nanjekye, David Bremner, Aleksandar Micic
2020	—	`conf`	4th workshop on advances in open runtimes and cloud performance technologies. CASCON Daryl Maier, Vijay Sundaresan, David Bremner
2020	J	`jnl`	Achieve privacy-preserving simplicial depth query over collaborative cloud servers. Peer-to-Peer Netw. Appl. Hassan Mahdikhani, Rasoul Shahsavarifar, Rongxing Lu, David Bremner
2020	J	`jnl`	Outer approximations of core points for integer programming. CoRR David Bremner, Naghmeh Shahverdi
2020	J	`jnl`	Sparktope: linear programs from algorithms. CoRR David Avis, David Bremner
2019	J	`jnl`	Polynomial size linear programs for problems in P. Discret. Appl. Math. David Avis, David Bremner, Hans Raj Tiwary, Osamu Watanabe
2018	—	`conf`	Approximate Data Depth Revisited. CCCG David Bremner, Rasoul Shahsavarifar
2018	J	`jnl`	Approximate Data Depth Revisited. CoRR Rasoul Shahsavarifar, David Bremner
2018	J	`jnl`	Computing the Planar β-skeleton Depth. CoRR Rasoul Shahsavarifar, David Bremner
2018	J	`jnl`	Monotone Simultaneous Paths Embeddings in ℝ Discret. Math. Theor. Comput. Sci. David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Guillaume Moroz, Sue Whitesides, Stephen K. Wismath
2017	J	`jnl`	An Optimal Algorithm for Computing the Spherical Depth of Points in the Plane. CoRR David Bremner, Rasoul Shahsavarifar
2017	—	`conf`	Fusing method handle graphs for efficient dynamic JVM language implementations. VMIL@SPLASH Shijie Xu, David Bremner, Daniel Heidinga
2017	—	`conf`	On the Planar Spherical Depth and Lens Depth. CCCG David Bremner, Rasoul Shahsavarifar
2017	J	`jnl`	Toward cost-effective replica placements in cloud storage systems with QoS-awareness. Softw. Pract. Exp. Lingfang Zeng, Shijie Xu, Yang Wang, Kenneth B. Kent, David Bremner, Cheng-Zhong Xu
2016	—	`conf`	MHDeS: deduplicating method handle graphs for efficient dynamic JVM language implementations. ICOOOLPS@ECOOP Shijie Xu, David Bremner, Daniel Heidinga
2016	J	`jnl`	Monotone Simultaneous Embeddings of Paths in R^d. CoRR David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath
2016	A	`conf`	Monotone Simultaneous Embeddings of Paths in d Dimensions. GD David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath
2015	—	`conf`	A Java util concurrent park contention tool. PMAM@PPoPP Panagiotis Patros, Eric Aubanel, David Bremner, Michael Dawson
2015	—	`conf`	Metis: a smart memory allocator using historical reclamation information. ICOOOLPS@ECOOP Shijie Xu, Qi Guo, Gerhard W. Dueck, David Bremner, Yang Wang
2015	—	`conf`	Mining Method Handle Graphs for Efficient Dynamic JVM Languages. PPPJ Shijie Xu, David Bremner, Daniel Heidinga
2014	J	`jnl`	Computing symmetry groups of polyhedra. LMS J. Comput. Math. David Bremner, Mathieu Dutour Sikiric, Dmitrii V. Pasechnik, Thomas Rehn, Achill Schürmann
2014	J	`jnl`	Editorial. Comput. Geom. Greg Aloupis, David Bremner
2014	C	`conf`	Monetary-and-QoS Aware Replica Placements in Cloud-Based Storage Systems. CloudCom Lingfang Zeng, Shijie Xu, Yang Wang, Xiang Cui, Tan Wee Kiat, David Bremner, Kenneth B. Kent
2014	J	`jnl`	Necklaces, Convolutions, and X+Y. Algorithmica David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian
2014	J	`jnl`	Polynomial size linear programs for non-bipartite matching problems and other problems in P. CoRR David Avis, David Bremner, Hans Raj Tiwary, Osamu Watanabe
2013	B	`conf`	A Dynamic Moldable Job Scheduling Based Parallel SAT Solver. ICPP Sajjad Asghar, Eric Aubanel, David Bremner
2013	J	`jnl`	Editorial. Comput. Geom. David Bremner, Antoine Deza, Hiroshi Imai, Sonoko Moriyama
2013	J	`jnl`	More bounds on the diameters of convex polytopes. Optim. Methods Softw. David Bremner, Antoine Deza, William Hua, Lars Schewe
2012	—	`conf`	Basis Enumeration of Hyperplane Arrangements Up to Symmetries. CCCG Aaron Moss, David Bremner
2012	J	`jnl`	Matroid Enumeration for Incidence Geometry. Discret. Comput. Geom. Yoshitake Matsumoto, Sonoko Moriyama, Hiroshi Imai, David Bremner
2012	J	`jnl`	Necklaces, Convolutions, and X+Y CoRR David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian
2012	A	`conf`	On Representing Graphs by Touching Cuboids. GD David Bremner, William S. Evans, Fabrizio Frati, Laurie J. Heyer, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, David Rappaport, Sue Whitesides
2011	J	`jnl`	Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets. Exp. Math. David Bremner, Lars Schewe
2011	—	`conf`	Pushing the boundaries of polytopal realizability. CCCG David Bremner, Antoine Deza, William Hua, Lars Schewe
2009	J	`jnl`	A Branch and Cut Algorithm for the Halfspace Depth Problem CoRR David Bremner, Dan Chen
2009	J	`jnl`	Symmetric matroid polytopes and their generation. Eur. J. Comb. Jürgen Bokowski, David Bremner, Gábor Gévay
2008	—	`conf`	A note on alpha-drawable k-trees. CCCG Svetlana Stolpner, Jonathan Lenchner, Giuseppe Liotta, David Bremner, Christophe Paul, Marc Pouget, Stephen K. Wismath
2008	J	`jnl`	Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms. J. Comb. Optim. David Bremner, Antoine Deza, Michael Soltys
2008	J	`jnl`	Output-sensitive algorithms for Tukey depth and related problems. Stat. Comput. David Bremner, Dan Chen, John Iacono, Stefan Langerman, Pat Morin
2007	J	`jnl`	Polyhedral representation conversion up to symmetries CoRR David Bremner, Mathieu Dutour Sikiric, Achill Schürmann
2006	—	`conf`	Computing the Tool Path of an Externally Monotone Polygon in Linear Time. CCCG Prosenjit Bose, David Bremner, Diane L. Souvaine
2006	A	`conf`	Necklaces, Convolutions, and ESA David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian
2005	J	`jnl`	Games on triangulations. Theor. Comput. Sci. Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia
2005	J	`jnl`	Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. Discret. Comput. Geom. David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint
2004	—	`conf`	Experimental lower bounds for three simplex chirality measures in low dimension. CCCG David Bremner, David E. Gay
2004	J	`jnl`	Small Strictly Convex Quadrilateral Meshes of Point Sets. Algorithmica David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristán
2003	J	`jnl`	Long proteins with unique optimal foldings in the H-P model. Comput. Geom. Oswin Aichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristán, Michael A. Soss
2003	B	`conf`	Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. WADS David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint
2003	—	`conf`	Primal-dual algorithms for data depth. Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications David Bremner, Komei Fukuda, Vera Rosta
2003	—	`conf`	Sufficiently Fat Polyhedra are Not 2-Castable. CCCG Alexander Golynski, David Bremner
2002	J	`jnl`	Long Proteins with Unique Optimal Foldings in the H-P Model CoRR Oswin Aichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristán, Michael A. Soss
2002	—	`conf`	Playing with Triangulations. JCDCG Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia
2002	J	`jnl`	Small Strictly Convex Quadrilateral Meshes of Point Sets CoRR David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristán
2002	J	`jnl`	Sufficiently Fat Polyhedra are not 2-castable CoRR David Bremner, Alexander Golynski
2001	J	`jnl`	Selected papers from the 12th Annual Canadian Conference on Computational Geometry - Editorial. Comput. Geom. David Bremner
2001	B	`conf`	Small Convex Quadrangulations of Point Sets. ISAAC David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristán
2000	J	`jnl`	Point Visibility Graphs and O-Convex Cover. Int. J. Comput. Geom. Appl. David Bremner, Thomas C. Shermer
1999	J	`jnl`	Incremental Convex Hull Algorithms Are Not Output Sensitive. Discret. Comput. Geom. David Bremner
1999	J	`jnl`	Inner Diagonals of Convex Polytopes. J. Comb. Theory A David Bremner, Victor Klee
1999	—	`conf`	Inner diagonals of convex polytopes. CCCG David Bremner, Victor Klee
1998	J	`jnl`	Computing constrained minimum-width annuli of point sets. Comput. Aided Des. Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong
1998	J	`jnl`	Primal - Dual Methods for Vertex and Facet Enumeration. Discret. Comput. Geom. David Bremner, Komei Fukuda, Ambros Marzetta
1998	—	`conf`	Recovering lines with fixed linear probes. CCCG Mark de Berg, Prosenjit Bose, David Bremner, William S. Evans, Lata Narayanan
1997	B	`conf`	Computing Constrained Minimum-Width Annuli of Point Sets. WADS Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong
1997	J	`jnl`	Determining the Castability of Simple Polyhedra. Algorithmica Prosenjit Bose, David Bremner, Marc J. van Kreveld
1997	J	`jnl`	How Good Are Convex Hull Algorithms?. Comput. Geom. David Avis, David Bremner, Raimund Seidel
1997	—	`conf`	Primal-Dual Methods for Vertex and Facet Enumeration (Preliminary Version). SCG David Bremner, Komei Fukuda, Ambros Marzetta
1996	J	`jnl`	All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers. Comput. Geom. Prosenjit Bose, David Bremner, Godfried T. Toussaint
1996	B	`conf`	Incremental Convex Hull Algorithms Are Not Output Sensitive. ISAAC David Bremner
1995	—	`conf`	How Good are Convex Hull Algorithms? SCG David Avis, David Bremner
1994	—	`conf`	All Convex Polyhedra can be Clamped with Parallel Jaw Grippers. CCCG Prosenjit Bose, David Bremner, Godfried T. Toussaint
1994	—	`conf`	Determining the Castability of Simple Polyhedra. SCG Prosenjit Bose, David Bremner, Marc J. van Kreveld
1994	—	`conf`	Link-2-Convex One-Fillable Polygons are Starshaped. CCCG David Bremner