Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristopher Hillar
Person information
- affiliation: Awecom, Inc., San Francisco, CA, USA
- affiliation (former): University of California Berkeley, Redwood Center for Theoretical Neuroscience, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j36]Christopher Hillar, Tenzin Chan, Rachel Taubman, David Rolnick
:
Hidden Hypergraphs, Error-Correcting Codes, and Critical Learning in Hopfield Networks. Entropy 23(11): 1494 (2021)- 2019
- [j35]Charles J. Garfinkle, Christopher J. Hillar:
On the Uniqueness and Stability of Dictionaries for Sparse Representation of Noisy Signals. IEEE Trans. Signal Process. 67(23): 5884-5892 (2019) - 2017
- [j34]Badr F. Albanna, Christopher Hillar, Jascha Sohl-Dickstein, Michael Robert DeWeese:
Minimum and Maximum Entropy Distributions for Binary Systems with Known Means and Pairwise Correlations. Entropy 19(8): 427 (2017) - 2016
- [j33]Christopher J. Hillar, Abraham Martín del Campo:
Corrigendum to "Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals" [J. Symb. Comput. 50(March 2013) 314-334]. J. Symb. Comput. 74: 650-652 (2016) - 2015
- [j32]Nickolas Hein, Christopher J. Hillar, Abraham Martín del Campo, Frank Sottile, Zach Teitler:
The Monotone Secant Conjecture in the Real Schubert Calculus. Exp. Math. 24(3): 261-269 (2015) - [j31]Christopher J. Hillar, Friedrich T. Sommer:
When Can Dictionary Learning Uniquely Recover Sparse Data From Subsamples? IEEE Trans. Inf. Theory 61(11): 6290-6297 (2015) - 2013
- [j30]Christopher J. Hillar, Lek-Heng Lim:
Most Tensor Problems Are NP-Hard. J. ACM 60(6): 45:1-45:39 (2013) - [j29]Christopher J. Hillar, Abraham Martín del Campo:
Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals. J. Symb. Comput. 50: 314-334 (2013) - [j28]Christopher J. Hillar, Frank Sottile:
Complex Static Skew-Symmetric Output Feedback Control. SIAM J. Control. Optim. 51(4): 3011-3026 (2013) - 2012
- [j27]Luis David García-Puente, Nickolas Hein, Christopher J. Hillar, Abraham Martín del Campo, James Ruffo, Frank Sottile, Zach Teitler:
The Secant Conjecture in the Real Schubert Calculus. Exp. Math. 21(3): 252-265 (2012) - 2010
- [j26]Jesús A. De Loera, Christopher J. Hillar, Peter N. Malkin, Mohamed Omar:
Recognizing Graph Theoretic Properties with Polynomial Ideals. Electron. J. Comb. 17(1) (2010) - 2009
- [j25]Christopher J. Hillar:
Problem 11422. Am. Math. Mon. 116(3): 277 (2009) - [j24]Christopher J. Hillar, Saïd Amghibech:
A Polynomial Identity: 11288 [2007, 359]. Am. Math. Mon. 116(5): 468 (2009) - [j23]Christopher J. Hillar:
Problem 11446. Am. Math. Mon. 116(7): 647 (2009) - [j22]Christopher J. Hillar, Bruce S. Burdick, Roger Williams:
Polynomials Not Associated with Symmetric Matrices: 11321 [2007, 835]. Am. Math. Mon. 116(7): 649-650 (2009) - 2008
- [j21]Christopher J. Hillar, Troels Windfeldt:
Algebraic characterization of uniquely vertex colorable graphs. J. Comb. Theory, Ser. B 98(2): 400-414 (2008) - [j20]Christopher J. Hillar, Lionel Levine, Stephen C. Locke:
Snapshots for Velocities: 11223. Am. Math. Mon. 115(1): 75-76 (2008) - [j19]Christopher J. Hillar:
Problem 11346. Am. Math. Mon. 115(2): 166-167 (2008) - [j18]Christopher J. Hillar, Lionel Levine:
Problem 11377. Am. Math. Mon. 115(7): 664 (2008) - [j17]Christopher J. Hillar, O. P. Lossers:
A Group In Which Equations Are Solvable: 11231. Am. Math. Mon. 115(7): 665-666 (2008) - 2007
- [j16]Christopher J. Hillar, Troels Windfeldt:
Problem 11288. Am. Math. Mon. 114(4): 359 (2007) - [j15]Christopher J. Hillar:
Problem 11321. Am. Math. Mon. 114(9): 835 (2007) - [j14]Christopher J. Hillar, John H. Lindsey II, Robin Chapman:
The Trace of the Sum of All Products of Two Matrices: 11204. Am. Math. Mon. 114(9): 840-841 (2007) - [j13]Christopher J. Hillar, Darren L. Rhea:
Automorphisms of Finite Abelian Groups. Am. Math. Mon. 114(10): 917-923 (2007) - 2006
- [j12]Christopher J. Hillar, Darren L. Rhea:
A result about the density of iterated line intersections in the plane. Comput. Geom. 33(3): 106-114 (2006) - [j11]Christopher J. Hillar:
Problem 11204. Am. Math. Mon. 113(2): 179 (2006) - [j10]Christopher J. Hillar, Darren L. Rhea, Godfrey L. Isaacs:
An Oldie: 11098. Am. Math. Mon. 113(2): 186 (2006) - [j9]Christopher J. Hillar, Lionel Levine:
Problem 11123. Am. Math. Mon. 113(5): 459 (2006) - [j8]Christopher J. Hillar:
Problem 11231. Am. Math. Mon. 113(6): 567 (2006) - 2005
- [j7]Christopher J. Hillar:
Cyclic resultants. J. Symb. Comput. 39(6): 653-669 (2005) - [j6]Christopher J. Hillar:
Erratum to "Cyclic resultants" [J. Symbolic Comput. 39 (6) (2005) 653-669]. J. Symb. Comput. 40(3): 1126-1127 (2005) - 2004
- [j5]Christopher J. Hillar, Darren L. Rhea:
Problem 11098. Am. Math. Mon. 111(7): 625 (2004) - 2003
- [j4]Christopher J. Hillar, Patrick J. Fitzsimmons:
Convergent Series with Exponents: 10928. Am. Math. Mon. 110(5): 444-445 (2003) - 2002
- [j3]Charles R. Johnson, Christopher J. Hillar:
Eigenvalues of Words in Two Positive Definite Letters. SIAM J. Matrix Anal. Appl. 23(4): 916-928 (2002) - [j2]Christopher J. Hillar:
Problem 10928. Am. Math. Mon. 109(3): 298 (2002) - 2001
- [j1]Christopher J. Hillar, Heinz-Jürgen Seiffert:
Two Sums That Are Congruent Modulo p: 10723. Am. Math. Mon. 108(2): 176 (2001)
Conference and Workshop Papers
- 2023
- [c10]Sophia Sanborn, Christian Shewmake, Bruno A. Olshausen, Christopher J. Hillar:
Bispectral Neural Networks. ICLR 2023 - 2020
- [c9]Zuozhu Liu, Thiparat Chotibut, Christopher Hillar, Shaowei Lin:
Biologically Plausible Sequence Learning with Spiking Neural Networks. AAAI 2020: 1316-1323 - 2017
- [c8]Christopher J. Hillar, Sarah Marzen:
Revisiting Perceptual Distortion for Natural Images: Mean Discrete Structural Similarity Index. DCC 2017: 241-249 - 2015
- [c7]Ram Mehta, Sarah Marzen, Christopher J. Hillar:
Exploring discrete approaches to lossy compression schemes for natural image patches. EUSIPCO 2015: 2236-2240 - [c6]Christopher J. Hillar, Felix Effenberger:
Robust Discovery of Temporal Structure in Multi-neuron Recordings Using Hopfield Networks. INNS Conference on Big Data 2015: 365-374 - [c5]Felix Effenberger, Christopher J. Hillar:
Discovery of Salient Low-Dimensional Dynamical Structure in Neuronal Population Activity Using Hopfield Networks. SIMBAD 2015: 199-208 - 2014
- [c4]Christopher J. Hillar, Ram Mehta, Kilian Koepsell:
A hopfield recurrent neural network trained on natural images performs state-of-the-art image compression. ICIP 2014: 4092-4096 - 2010
- [c3]William K. Coulter, Christopher J. Hillar, Guy Isley, Friedrich T. Sommer:
Adaptive compressed sensing - A new class of self-organizing coding models for neuroscience. ICASSP 2010: 5494-5497 - [c2]Guy Isley, Christopher J. Hillar, Friedrich T. Sommer:
Deciphering subsampled data: adaptive compressive sampling as a principle of brain communication. NIPS 2010: 910-918 - 2008
- [c1]Matthias Aschenbrenner, Christopher J. Hillar:
An algorithm for finding symmetric Grobner bases in infinite dimensional rings. ISSAC 2008: 117-124
Informal and Other Publications
- 2023
- [i6]Giovanni Luca Marchetti, Christopher Hillar, Danica Kragic, Sophia Sanborn:
Harmonics of Learning: Universal Fourier Features Emerge in Invariant Networks. CoRR abs/2312.08550 (2023) - 2022
- [i5]Sophia Sanborn, Christian Shewmake, Bruno A. Olshausen, Christopher Hillar:
Bispectral Neural Networks. CoRR abs/2209.03416 (2022) - 2019
- [i4]Zuozhu Liu, Thiparat Chotibut, Christopher Hillar, Shaowei Lin:
Biologically Plausible Sequence Learning with Spiking Neural Networks. CoRR abs/1911.10943 (2019) - 2016
- [i3]Charles J. Garfinkle, Christopher J. Hillar:
Robust Identifiability in Sparse Dictionary Learning. CoRR abs/1606.06997 (2016) - 2011
- [i2]Osbert Bastani, Christopher J. Hillar, Dimitar Popov, J. Maurice Rojas:
Randomization, Sums of Squares, and Faster Real Root Counting for Tetranomials and Beyond. CoRR abs/1101.2642 (2011) - 2009
- [i1]Christopher J. Hillar, Lek-Heng Lim:
Most tensor problems are NP hard. CoRR abs/0911.1393 (2009)
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-04-25 02:39 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:
