default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBrent Heeringa
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j3]Micah Adler, Brent Heeringa:
Approximating Optimal Binary Decision Trees. Algorithmica 62(3-4): 1112-1121 (2012)- [j2]Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong:
The knapsack problem with neighbour constraints. J. Discrete Algorithms 16: 224-235 (2012) - [c16]Javad Azimi, Alan Fern, Xiaoli Zhang Fern, Glencora Borradaile, Brent Heeringa:
Batch Active Learning via Coordinated Matching. ICML 2012 - 2011
- [c15]John W. Byers, Brent Heeringa, Michael Mitzenmacher, Georgios Zervas:
Heapable Sequences and Subsequences. ANALCO 2011: 33-44 - [c14]Matthew Berardi, Brent Heeringa, Justin Malestein, Louis Theran:
Rigid components in fixed-lattice and cone frameworks. CCCG 2011 - [c13]Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong:
The 1-Neighbour Knapsack Problem. IWOCA 2011: 71-84 - [c12]Brent Heeringa, Marius Catalin Iordan
, Louis Theran:
Searching in Dynamic Tree-Like Partial Orders. WADS 2011: 512-523 - [i4]Matthew Berardi, Brent Heeringa, Justin Malestein, Louis Theran:
Rigid components in fixed-lattice and cone frameworks. CoRR abs/1105.3234 (2011) - 2010
- [c11]Michael Gerbush, Brent Heeringa:
Approximating Minimum Reset Sequences. CIAA 2010: 154-162 - [i3]John W. Byers, Brent Heeringa, Michael Mitzenmacher, Georgios Zervas:
Heapable Sequences and Subsequences. CoRR abs/1007.2365 (2010) - [i2]Brent Heeringa, Marius Catalin Iordan, Louis Theran:
Searching in Dynamic Tree-Like Partial Orders. CoRR abs/1010.1316 (2010)
2000 – 2009
- 2009
- [c10]Nick Parlante, Thomas P. Murtagh, Mehran Sahami, Owen L. Astrachan, David Reed, Christopher A. Stone, Brent Heeringa, Karen L. Reid:
Nifty assignments. SIGCSE 2009: 483-484 - [i1]Glencora Borradaile, Brent Heeringa, Gordon T. Wilfong:
Approximation Algorithms for Constrained Knapsack Problems. CoRR abs/0910.0777 (2009) - 2008
- [c9]Micah Adler, Brent Heeringa:
Approximating Optimal Binary Decision Trees. APPROX-RANDOM 2008: 1-9 - [c8]Micah Adler, Brent Heeringa:
Search Space Reductions for Nearest-Neighbor Queries. TAMC 2008: 554-567 - 2007
- [j1]Paul R. Cohen, Niall M. Adams, Brent Heeringa:
Voting experts: An unsupervised algorithm for segmenting sequences. Intell. Data Anal. 11(6): 607-625 (2007) - 2004
- [c7]Brent Heeringa, Micah Adler:
Optimal Website Design with the Constrained Subtree Selection Problem. ICALP 2004: 757-769 - 2002
- [c6]Paul R. Cohen, Brent Heeringa, Niall M. Adams:
An Unsupervised Algorithm for Segmenting Categorical Timeseries into Episodes. Pattern Detection and Discovery 2002: 49-62 - [c5]Paul R. Cohen, Brent Heeringa, Niall M. Adams:
Unsupervised Segmentation of Categorical Time Series into Episodes. ICDM 2002: 99-106 - [c4]Tim Oates, Brent Heeringa:
Estimating Grammar Parameters Using Bounded Memory. ICGI 2002: 185-198 - [c3]Gary W. King, Brent Heeringa, David L. Westbrook, Joe Catalano, Paul R. Cohen:
Agent modeling: models of defeat. WSC 2002: 928-934 - 2001
- [c2]Marc S. Atkin, Gary W. King, David L. Westbrook, Brent Heeringa, Paul R. Cohen:
Hierarchical agent control: a framework for defining agent behavior. Agents 2001: 425-432 - 2000
- [c1]Brent Heeringa, Paul R. Cohen:
An underlying model for defeat mechanisms. WSC 2000: 933-939
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 2025-04-03 01:22 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:
