default search action
David Bremner
Person information
- affiliation: University of New Brunswick, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c35]Joannah Nanjekye, David Bremner, Aleksandar Micic:
Towards Reliable Memory Management for Python Native Extensions. ICOOOLPS@ECOOP 2023: 15-26 - 2022
- [j28]David Avis, David Bremner:
Sparktope: linear programs from algorithms. Optim. Methods Softw. 37(3): 954-981 (2022) - [c34]Joannah Nanjekye, David Bremner, Aleksandar Micic:
The Garbage Collection Cost For Meta-Tracing JIT-based Dynamic Languages. CASCON 2022: 140-149 - 2021
- [c33]Joannah Nanjekye, David Bremner, Aleksandar Micic:
Eclipse OMR garbage collection for tracing JIT-based virtual machines. CASCON 2021: 244-249 - 2020
- [j27]Hassan Mahdikhani, Rasoul Shahsavarifar, Rongxing Lu
, David Bremner:
Achieve privacy-preserving simplicial depth query over collaborative cloud servers. Peer-to-Peer Netw. Appl. 13(1): 412-423 (2020) - [c32]Daryl Maier, Vijay Sundaresan, David Bremner:
4th workshop on advances in open runtimes and cloud performance technologies. CASCON 2020: 262 - [i13]David Avis, David Bremner:
Sparktope: linear programs from algorithms. CoRR abs/2005.02853 (2020) - [i12]David Bremner, Naghmeh Shahverdi:
Outer approximations of core points for integer programming. CoRR abs/2007.10863 (2020)
2010 – 2019
- 2019
- [j26]David Avis, David Bremner, Hans Raj Tiwary
Polynomial size linear programs for problems in P. Discret. Appl. Math. 265: 22-39 (2019) - 2018
- [j25]David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Guillaume Moroz, Sue Whitesides, Stephen K. Wismath:
Monotone Simultaneous Paths Embeddings in ℝd. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [c31]David Bremner, Rasoul Shahsavarifar:
Approximate Data Depth Revisited. CCCG 2018: 272-281 - [i11]Rasoul Shahsavarifar, David Bremner:
Computing the Planar β-skeleton Depth. CoRR abs/1803.05970 (2018) - [i10]Rasoul Shahsavarifar, David Bremner:
Approximate Data Depth Revisited. CoRR abs/1805.07373 (2018) - 2017
- [j24]Lingfang Zeng
Toward cost-effective replica placements in cloud storage systems with QoS-awareness. Softw. Pract. Exp. 47(6): 813-829 (2017) - [c30]David Bremner, Rasoul Shahsavarifar:
On the Planar Spherical Depth and Lens Depth. CCCG 2017: 43-49 - [c29]Shijie Xu, David Bremner, Daniel Heidinga:
Fusing method handle graphs for efficient dynamic JVM language implementations. VMIL@SPLASH 2017: 18-27 - [i9]David Bremner, Rasoul Shahsavarifar:
An Optimal Algorithm for Computing the Spherical Depth of Points in the Plane. CoRR abs/1702.07399 (2017) - 2016
- [c28]Shijie Xu, David Bremner, Daniel Heidinga:
MHDeS: deduplicating method handle graphs for efficient dynamic JVM language implementations. ICOOOLPS@ECOOP 2016: 4:1-4:10 - [c27]David Bremner, Olivier Devillers
Monotone Simultaneous Embeddings of Paths in d Dimensions. GD 2016: 546-553 - [i8]David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, Tamara Mchedlidze, Sue Whitesides, Stephen K. Wismath:
Monotone Simultaneous Embeddings of Paths in R^d. CoRR abs/1608.08791 (2016) - 2015
- [c26]Shijie Xu, Qi Guo, Gerhard W. Dueck, David Bremner, Yang Wang:
Metis: a smart memory allocator using historical reclamation information. ICOOOLPS@ECOOP 2015: 6:1-6:9 - [c25]Panagiotis Patros, Eric Aubanel, David Bremner, Michael Dawson:
A Java util concurrent park contention tool. PMAM@PPoPP 2015: 106-111 - [c24]Shijie Xu, David Bremner, Daniel Heidinga:
Mining Method Handle Graphs for Efficient Dynamic JVM Languages. PPPJ 2015: 159-169 - 2014
- [j23]David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono
Necklaces, Convolutions, and X+Y. Algorithmica 69(2): 294-314 (2014) - [j22]Greg Aloupis, David Bremner:
Editorial. Comput. Geom. 47(2): 111 (2014) - [j21]David Bremner, Mathieu Dutour Sikiric
Computing symmetry groups of polyhedra. LMS J. Comput. Math. 17(1): 565-581 (2014) - [c23]Lingfang Zeng
Monetary-and-QoS Aware Replica Placements in Cloud-Based Storage Systems. CloudCom 2014: 672-675 - [i7]David Avis, David Bremner, Hans Raj Tiwary, Osamu Watanabe:
Polynomial size linear programs for non-bipartite matching problems and other problems in P. CoRR abs/1408.0807 (2014) - 2013
- [j20]David Bremner, Antoine Deza, Hiroshi Imai, Sonoko Moriyama
Editorial. Comput. Geom. 46(5): 493 (2013) - [j19]David Bremner, Antoine Deza, William Hua, Lars Schewe
More bounds on the diameters of convex polytopes. Optim. Methods Softw. 28(3): 442-450 (2013) - [c22]Sajjad Asghar, Eric Aubanel, David Bremner:
A Dynamic Moldable Job Scheduling Based Parallel SAT Solver. ICPP 2013: 110-119 - 2012
- [j18]Yoshitake Matsumoto, Sonoko Moriyama
Matroid Enumeration for Incidence Geometry. Discret. Comput. Geom. 47(1): 17-43 (2012) - [c21]Aaron Moss, David Bremner:
Basis Enumeration of Hyperplane Arrangements Up to Symmetries. CCCG 2012: 143-148 - [c20]David Bremner, William S. Evans, Fabrizio Frati
On Representing Graphs by Touching Cuboids. GD 2012: 187-198 - [i6]David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono
Necklaces, Convolutions, and X+Y. CoRR abs/1212.4771 (2012) - 2011
- [j17]David Bremner, Lars Schewe
Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets. Exp. Math. 20(3): 229-237 (2011) - [c19]David Bremner, Antoine Deza, William Hua, Lars Schewe:
Pushing the boundaries of polytopal realizability. CCCG 2011
2000 – 2009
- 2009
- [j16]Jürgen Bokowski
Symmetric matroid polytopes and their generation. Eur. J. Comb. 30(8): 1758-1777 (2009) - [i5]David Bremner, Dan Chen:
A Branch and Cut Algorithm for the Halfspace Depth Problem. CoRR abs/0910.1923 (2009) - 2008
- [j15]David Bremner, Antoine Deza, Michael Soltys
Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms. J. Comb. Optim. 16(4): 323 (2008) - [j14]David Bremner, Dan Chen, John Iacono, Stefan Langerman
Output-sensitive algorithms for Tukey depth and related problems. Stat. Comput. 18(3): 259-266 (2008) - [c18]Svetlana Stolpner, Jonathan Lenchner, Giuseppe Liotta, David Bremner, Christophe Paul, Marc Pouget, Stephen K. Wismath:
A note on alpha-drawable k-trees. CCCG 2008 - 2007
- [i4]David Bremner, Mathieu Dutour Sikiric, Achill Schürmann:
Polyhedral representation conversion up to symmetries. CoRR abs/math/0702239 (2007) - 2006
- [c17]Prosenjit Bose, David Bremner, Diane L. Souvaine:
Computing the Tool Path of an Externally Monotone Polygon in Linear Time. CCCG 2006 - [c16]David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian:
Necklaces, Convolutions, and X + Y. ESA 2006: 160-171 - 2005
- [j13]David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. Discret. Comput. Geom. 33(4): 593-604 (2005) - [j12]Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis
Games on triangulations. Theor. Comput. Sci. 343(1-2): 42-71 (2005) - 2004
- [j11]David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristán
Small Strictly Convex Quadrilateral Meshes of Point Sets. Algorithmica 38(2): 317-339 (2004) - [c15]David Bremner, David E. Gay:
Experimental lower bounds for three simplex chirality measures in low dimension. CCCG 2004: 170-173 - 2003
- [j10]Oswin Aichholzer
Long proteins with unique optimal foldings in the H-P model. Comput. Geom. 25(1-2): 139-159 (2003) - [c14]Alexander Golynski, David Bremner:
Sufficiently Fat Polyhedra are Not 2-Castable. CCCG 2003: 120-122 - [c13]David Bremner, Komei Fukuda, Vera Rosta:
Primal-dual algorithms for data depth. Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications 2003: 171-194 - [c12]David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. WADS 2003: 451-461 - 2002
- [c11]Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia
Playing with Triangulations. JCDCG 2002: 22-37 - [i3]Oswin Aichholzer, David Bremner, Erik D. Demaine, Henk Meijer, Vera Sacristán, Michael A. Soss:
Long Proteins with Unique Optimal Foldings in the H-P Model. CoRR cs.CG/0201018 (2002) - [i2]David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristán:
Small Strictly Convex Quadrilateral Meshes of Point Sets. CoRR cs.CG/0202011 (2002) - [i1]David Bremner, Alexander Golynski:
Sufficiently Fat Polyhedra are not 2-castable. CoRR cs.CG/0203025 (2002) - 2001
- [j9]David Bremner:
Selected papers from the 12th Annual Canadian Conference on Computational Geometry - Editorial. Comput. Geom. 20(1-2): 1 (2001) - [c10]David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristán
Small Convex Quadrangulations of Point Sets. ISAAC 2001: 623-635 - 2000
- [j8]David Bremner, Thomas C. Shermer:
Point Visibility Graphs and O-Convex Cover. Int. J. Comput. Geom. Appl. 10(1): 55-71 (2000)
1990 – 1999
- 1999
- [j7]David Bremner:
Incremental Convex Hull Algorithms Are Not Output Sensitive. Discret. Comput. Geom. 21(1): 57-68 (1999) - [j6]David Bremner, Victor Klee:
Inner Diagonals of Convex Polytopes. J. Comb. Theory A 87(1): 175-197 (1999) - [c9]David Bremner, Victor Klee:
Inner diagonals of convex polytopes. CCCG 1999 - 1998
- [j5]Mark de Berg, Prosenjit Bose
Computing constrained minimum-width annuli of point sets. Comput. Aided Des. 30(4): 267-275 (1998) - [j4]David Bremner, Komei Fukuda, Ambros Marzetta:
Primal - Dual Methods for Vertex and Facet Enumeration. Discret. Comput. Geom. 20(3): 333-357 (1998) - [c8]Mark de Berg, Prosenjit Bose, David Bremner, William S. Evans, Lata Narayanan:
Recovering lines with fixed linear probes. CCCG 1998 - 1997
- [j3]Prosenjit Bose, David Bremner, Marc J. van Kreveld:
Determining the Castability of Simple Polyhedra. Algorithmica 19(1/2): 84-113 (1997) - [j2]David Avis, David Bremner, Raimund Seidel:
How Good Are Convex Hull Algorithms?. Comput. Geom. 7: 265-301 (1997) - [c7]David Bremner, Komei Fukuda, Ambros Marzetta:
Primal-Dual Methods for Vertex and Facet Enumeration (Preliminary Version). SCG 1997: 49-56 - [c6]Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong:
Computing Constrained Minimum-Width Annuli of Point Sets. WADS 1997: 392-401 - 1996
- [j1]Prosenjit Bose
All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers. Comput. Geom. 6: 291-302 (1996) - [c5]David Bremner:
Incremental Convex Hull Algorithms Are Not Output Sensitive. ISAAC 1996: 26-35 - 1995
- [c4]David Avis, David Bremner:
How Good are Convex Hull Algorithms? SCG 1995: 20-28 - 1994
- [c3]Prosenjit Bose, David Bremner, Godfried T. Toussaint:
All Convex Polyhedra can be Clamped with Parallel Jaw Grippers. CCCG 1994: 344-349 - [c2]David Bremner:
Link-2-Convex One-Fillable Polygons are Starshaped. CCCG 1994: 363-368 - [c1]Prosenjit Bose, David Bremner, Marc J. van Kreveld:
Determining the Castability of Simple Polyhedra. SCG 1994: 123-131
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: