default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristopher W. Brown 0001
Person information
- affiliation: United States Naval Academy, Annapolis, MD, USA
Other persons with the same name
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j14]Zoltán Kovács
, Christopher W. Brown, Tomás Recio, Róbert Vajda:
Computing with Tarski formulas and semi-algebraic sets in a web browser. J. Symb. Comput. 120: 102235 (2024)- [j13]Jasper Nalbach, Erika Ábrahám, Philippe Specht, Christopher W. Brown, James H. Davenport, Matthew England:
Levelwise construction of a single cylindrical algebraic cell. J. Symb. Comput. 123: 102288 (2024) - 2023
- [j12]Christopher W. Brown, Zoltán Kovács, Tomás Recio:
Faithful Real-Time Animation of Parametrized (Semi-) Algebraic Expressions via Cylindrical Algebraic Decomposition. ACM Commun. Comput. Algebra 57(2): 43-46 (2023) - 2022
- [j11]Christopher W. Brown, Zoltán Kovács, Tomás Recio, Róbert Vajda, M. Pilar Vélez:
Is Computer Algebra Ready for Conjecturing and Proving Geometric Inequalities in the Classroom? Math. Comput. Sci. 16(4): 31 (2022) - 2020
- [j10]Christopher W. Brown, Fernando Vale-Enriquez:
From simplification to a partial theory solver for non-linear real polynomial constraints. J. Symb. Comput. 100: 72-101 (2020) - 2016
- [j9]Christopher W. Brown, Michael Jenkins:
Analyzing proposals for improving authentication on the TLS-/SSL-protected Web. Int. J. Inf. Sec. 15(6): 621-635 (2016) - 2015
- [j8]Christopher W. Brown, Marek Kosta:
Constructing a single cell in cylindrical algebraic decomposition. J. Symb. Comput. 70: 14-48 (2015) - 2012
- [j7]Christopher W. Brown:
Fast simplifications for Tarski formulas based on monomial inequalities. J. Symb. Comput. 47(7): 859-882 (2012) - 2009
- [j6]Davide Fossati, Barbara Di Eugenio, Christopher W. Brown, Stellan Ohlsson, David G. Cosejo, Lin Chen:
Supporting Computer Science Curriculum: Exploring and Learning Linked Lists with iList. IEEE Trans. Learn. Technol. 2(2): 107-120 (2009) - 2006
- [j5]Christopher W. Brown, M'hammed El Kahoui, Dominik Novotni, Andreas Weber:
Algorithmic methods for investigating equilibria in epidemic modeling. J. Symb. Comput. 41(11): 1157-1173 (2006) - 2004
- [j4]Christopher W. Brown:
QEPCAD B: a system for computing with semi-algebraic sets via cylindrical algebraic decomposition. SIGSAM Bull. 38(1): 23-24 (2004) - 2003
- [j3]Christopher W. Brown:
QEPCAD B: a program for computing with semi-algebraic sets using CADs. SIGSAM Bull. 37(4): 97-108 (2003) - 2001
- [j2]Christopher W. Brown:
Simple CAD Construction and its Applications. J. Symb. Comput. 31(5): 521-547 (2001) - [j1]Christopher W. Brown:
Improved Projection for Cylindrical Algebraic Decomposition. J. Symb. Comput. 32(5): 447-465 (2001)
Conference and Workshop Papers
- 2024
- [c31]Ellis Fenske, Christopher W. Brown, Jeff Kosseff:
Courting Consensus: How Class Action Lawsuits Shape Data Privacy Rights and Obligations in the US. WPES@CCS 2024: 172-185 - 2023
- [c30]Christopher W. Brown, Zoltán Kovács, Simone Luksch, Tomás Recio, Róbert Vajda, M. Pilar Vélez:
Towards Detection of Partial Truth via Real Geometry. SC-Square@ISSAC 2023: 44-53 - [c29]Philipp Bär, Jasper Nalbach, Erika Ábrahám, Christopher W. Brown:
Exploiting Strict Constraints in the Cylindrical Algebraic Covering. SMT 2023: 33-45 - 2022
- [c28]Zoltán Kovács, Christopher W. Brown, Tomás Recio, Róbert Vajda:
A web version of Tarski, a system for computing with Tarski formulas and semialgebraic sets. SYNASC 2022: 59-62 - 2021
- [c27]Christopher W. Brown, Zoltán Kovács, Róbert Vajda:
Supporting Proving and Discovering Geometric Inequalities in GeoGebra by using Tarski. ADG 2021: 156-166 - 2020
- [c26]Christopher W. Brown, Scott McCallum:
Enhancements to Lazard's Method for Cylindrical Algebraic Decomposition. CASC 2020: 129-149 - [c25]Christopher W. Brown, Glenn Christopher Daves:
Applying Machine Learning to Heuristics for Real Polynomial Constraint Solving. ICMS 2020: 292-301 - 2018
- [c24]Fernando Vale-Enriquez, Christopher W. Brown:
Polynomial Constraints and Unsat Cores in Tarski. ICMS 2018: 466-474 - 2017
- [c23]Christopher W. Brown:
Projection and Quantifier Elimination Using Non-uniform Cylindrical Algebraic Decomposition. ISSAC 2017: 53-60 - 2016
- [c22]Christopher W. Brown:
Bridging Two Communities to Solve Real Problems. SYNASC 2016: 11-14 - 2015
- [c21]Christopher W. Brown:
Open Non-uniform Cylindrical Algebraic Decompositions. ISSAC 2015: 85-92 - [c20]Raymond Greenlaw, Christopher W. Brown, Zachary Dannelly, Andrew Phillips, Sarah Standard:
Using a Message Board as a Teaching Tool in an Introductory Cyber-Security Course. SIGCSE 2015: 308-313 - 2014
- [c19]Christopher W. Brown, Michael Jenkins:
Analyzing Proposals for Improving Authentication on the TLS/SSL-Protected Web. SSR 2014: 39-56 - 2013
- [c18]Christopher W. Brown:
Constructing a single open cell in a cylindrical algebraic decomposition. ISSAC 2013: 133-140 - 2012
- [c17]Christopher W. Brown, Frederick Crabbe, Rita Doerr, Raymond Greenlaw, Chris Hoffmeister, Justin Monroe, Donald Needham, Andrew Phillips, Stephen Schall, John Schultz, Steven Simon, David Stahl, Sarah Standard:
Developing and implementing an institution-wide introductory cyber-security course in record time. ACM Southeast Regional Conference 2012: 95-100 - [c16]Christopher W. Brown, Frederick Crabbe, Rita Doerr, Raymond Greenlaw, Chris Hoffmeister, Justin Monroe, Donald Needham, Andrew Phillips, Anthony G. Pollman, Stephen Schall, John Schultz, Steven Simon, David Stahl, Sarah Standard:
Anatomy, dissection, and mechanics of an introductory cyber-security course's curriculum at the United States naval academy. ITiCSE 2012: 303-308 - 2010
- [c15]Christopher W. Brown, Adam W. Strzebonski:
Black-box/white-box simplification and applications to quantifier elimination. ISSAC 2010: 69-76 - [c14]Davide Fossati, Barbara Di Eugenio, Stellan Ohlsson, Christopher W. Brown, Lin Chen:
Generating Proactive Feedback to Help Students Stay on Track. Intelligent Tutoring Systems (2) 2010: 315-317 - 2009
- [c13]Davide Fossati, Barbara Di Eugenio, Stellan Ohlsson, Christopher W. Brown, Lin Chen, David G. Cosejo:
I learn from you, you learn from me: How to make iList learn from students. AIED 2009: 491-498 - [c12]Christopher W. Brown:
Fast simplifications for Tarski formulas. ISSAC 2009: 63-70 - [c11]Scott McCallum, Christopher W. Brown:
On delineability of varieties in CAD-based quantifier elimination with two equational constraints. ISSAC 2009: 71-78 - 2008
- [c10]Davide Fossati, Barbara Di Eugenio, Christopher W. Brown, Stellan Ohlsson:
Learning Linked Lists: Experiments with the iList System. Intelligent Tutoring Systems 2008: 80-89 - 2007
- [c9]Christopher W. Brown, James H. Davenport:
The complexity of quantifier elimination and cylindrical algebraic decomposition. ISSAC 2007: 54-60 - [c8]Christopher W. Brown, Eric A. Hardisty:
RegeXeX: an interactive system providing regular expression exercises. SIGCSE 2007: 445-449 - 2006
- [c7]Christopher W. Brown, Christian Gross:
Efficient Preprocessing Methods for Quantifier Elimination. CASC 2006: 89-100 - 2005
- [c6]Christopher W. Brown, Sjaak de Vlaming, George Nakos:
Quantifier Elimination and the Ellipticity of Systems of Partial Differential Equations. Algorithmic Algebra and Logic 2005: 55-58 - [c5]Christopher W. Brown, M'hammed El Kahoui, Dominik Novotni, Andreas Weber:
Algorithmic Methods for Investigating Equilibria in Epidemic Modeling. Algorithmic Algebra and Logic 2005: 59-63 - [c4]Christopher W. Brown, Scott McCallum:
On using bi-equational constraints in CAD construction. ISSAC 2005: 76-83 - 2000
- [c3]Christopher W. Brown:
Improved projection for CAD's of R3. ISSAC 2000: 48-53 - 1999
- [c2]Christopher W. Brown:
Guaranteed Solution Formula Construction. ISSAC 1999: 137-144 - 1998
- [c1]Christopher W. Brown:
Simplification of Truth-Invariant Cylindrical Algebraic Decompositions. ISSAC 1998: 295-301
Editorship
- 2024
- [e1]Christopher W. Brown, Daniela Kaufmann, Cláudia Nalon, Alexander Steen, Martin Suda:
Joint Proceedings of the 9th Workshop on Practical Aspects of Automated Reasoning (PAAR) and the 9th Satisfiability Checking and Symbolic Computation Workshop (SC-Square), 2024 co-located with the 12th International Joint Conference on Automated Reasoning (IJCAR 2024), Nancy, France, July 2, 2024. CEUR Workshop Proceedings 3717, CEUR-WS.org 2024 [contents]
Informal and Other Publications
- 2024
- [i4]Lucas Michel, Jasper Nalbach, Pierre Mathonet, Naïm Zénaïdi, Christopher W. Brown, Erika Ábrahám, James H. Davenport, Matthew England:
On Projective Delineability. CoRR abs/2411.13300 (2024) - 2023
- [i3]Philipp Bär, Jasper Nalbach, Erika Ábrahám, Christopher W. Brown:
Exploiting Strict Constraints in the Cylindrical Algebraic Covering. CoRR abs/2306.16757 (2023) - 2022
- [i2]Jasper Nalbach, Erika Ábrahám, Philippe Specht, Christopher W. Brown, James H. Davenport, Matthew England:
Levelwise construction of a single cylindrical algebraic cell. CoRR abs/2212.09309 (2022) - 2014
- [i1]Christopher W. Brown:
Model-based construction of Open Non-uniform Cylindrical Algebraic Decompositions. CoRR abs/1403.6487 (2014)
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-01-21 00:03 CET 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:
