default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel N. Rockmore
Dan Rockmore
Person information
- affiliation: Dartmouth College, Hanover, USA
SPARQL queries 
🛈 Please note that only 71% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j29]Feng Fu
, Daniel N. Rockmore:
Too little, too late - a dynamical systems model for gun-related violence and intervention. Appl. Math. Comput. 467: 128495 (2024)- [j28]Xin Ran, Ellen R. Meara, Nancy E. Morden, Erika L. Moen, Daniel N. Rockmore, A. James O'Malley:
Estimating the impact of physician risky-prescribing on the network structure underlying physician shared-patient relationships. Appl. Netw. Sci. 9(1): 63 (2024) - 2023
- [c38]Xin Ran, Ellen R. Meara, Nancy E. Morden, Erika L. Moen, Daniel N. Rockmore, A. James O'Malley:
Modeling the Association Between Physician Risky-Prescribing and the Complex Network Structure of Physician Shared-Patient Relationships. COMPLEX NETWORKS (3) 2023: 194-207 - [c37]Neel Guha, Julian Nyarko, Daniel E. Ho, Christopher Ré, Adam Chilton, K. Aditya, Alex Chohlas-Wood, Austin Peters, Brandon Waldon, Daniel N. Rockmore, Diego Zambrano, Dmitry Talisman, Enam Hoque, Faiz Surani, Frank Fagan, Galit Sarfaty, Gregory M. Dickinson, Haggai Porat, Jason Hegland, Jessica Wu, Joe Nudell, Joel Niklaus, John J. Nay, Jonathan H. Choi, Kevin Tobia, Margaret Hagan, Megan Ma, Michael A. Livermore, Nikon Rasumov-Rahe, Nils Holzenberger, Noam Kolt, Peter Henderson, Sean Rehaag, Sharad Goel, Shang Gao, Spencer Williams, Sunny Gandhi, Tom Zur, Varun Iyer, Zehua Li:
LegalBench: A Collaboratively Built Benchmark for Measuring Legal Reasoning in Large Language Models. NeurIPS 2023 - [i14]Ho-Chun Herbert Chang, Brooke Harrington, Feng Fu, Daniel N. Rockmore:
Complex Systems of Secrecy: The Offshore Networks of Oligarchs. CoRR abs/2303.03371 (2023) - [i13]Neel Guha, Julian Nyarko, Daniel E. Ho, Christopher Ré, Adam Chilton, Aditya Narayana, Alex Chohlas-Wood, Austin Peters, Brandon Waldon, Daniel N. Rockmore, Diego Zambrano, Dmitry Talisman, Enam Hoque, Faiz Surani, Frank Fagan, Galit Sarfaty, Gregory M. Dickinson, Haggai Porat, Jason Hegland, Jessica Wu, Joe Nudell, Joel Niklaus, John J. Nay, Jonathan H. Choi, Kevin Tobia, Margaret Hagan, Megan Ma, Michael A. Livermore, Nikon Rasumov-Rahe, Nils Holzenberger, Noam Kolt, Peter Henderson, Sean Rehaag, Sharad Goel, Shang Gao, Spencer Williams, Sunny Gandhi, Tom Zur, Varun Iyer, Zehua Li:
LegalBench: A Collaboratively Built Benchmark for Measuring Legal Reasoning in Large Language Models. CoRR abs/2308.11462 (2023) - 2021
- [j27]Faraz Dadgostari, Mauricio Guim, Peter A. Beling, Michael A. Livermore, Daniel N. Rockmore:
Correction to: Modeling law search as prediction. Artif. Intell. Law 29(1): 1 (2021) - [j26]Faraz Dadgostari, Mauricio Guim, Peter A. Beling, Michael A. Livermore, Daniel N. Rockmore:
Modeling law search as prediction. Artif. Intell. Law 29(1): 3-34 (2021) - [c36]Almas Abdibayev, Allen Riddell, Daniel N. Rockmore:
BPoMP: The Benchmark of Poetic Minimal Pairs - Limericks, Rhyme, and Narrative Coherence. RANLP 2021: 1-9 - [c35]Keith Carlson, Allen Riddell, Daniel N. Rockmore:
Unsupervised Text Style Transfer with Content Embeddings. RANLP 2021: 226-233
2010 – 2019
- 2019
- [j25]Chuankai An, A. James O'Malley, Daniel N. Rockmore:
Towards intelligent complex networks: the space and prediction of information walks. Appl. Netw. Sci. 4(1): 35:1-35:21 (2019) - [c34]Chuankai An, Daniel N. Rockmore:
Open Personalized Navigation on the Sandbox of Wiki Pages. WWW (Companion Volume) 2019: 1173-1179 - [i12]Daryl R. DeFord, Daniel N. Rockmore:
On the Spectrum of Finite Rooted Homogeneous Trees. CoRR abs/1903.07134 (2019) - 2018
- [j24]Greg Leibon, Michael A. Livermore, Reed H. Harder, Allen Riddell, Dan Rockmore:
Bending the law: geometric tools for quantifying influence in the multinetwork of legal opinions. Artif. Intell. Law 26(2): 145-167 (2018) - [j23]Chuankai An, A. James O'Malley, Daniel N. Rockmore:
Referral paths in the U.S. physician network. Appl. Netw. Sci. 3(1): 20:1-20:24 (2018) - [j22]Daniel N. Rockmore, Chen Fang, Nicholas J. Foti, Tom Ginsburg, David C. Krakauer:
The cultural evolution of national constitutions. J. Assoc. Inf. Sci. Technol. 69(3): 483-494 (2018) - [c33]Chuankai An, A. James O'Malley, Daniel N. Rockmore:
Walk Prediction in Directed Networks. COMPLEX NETWORKS (1) 2018: 15-27 - 2017
- [c32]Reed H. Harder, Alfredo J. Velasco, Michael S. Evans, Chuankai An, Daniel N. Rockmore:
Wikipedia Verification Check: A Chrome Browser Extension. WWW (Companion Volume) 2017: 1619-1625 - [i11]Chuankai An, A. James O'Malley, Daniel N. Rockmore, Corey D. Stock:
Analysis of the U.S. Patient Referral Network. CoRR abs/1711.03245 (2017) - [i10]Keith Carlson, Allen Riddell, Daniel N. Rockmore:
Zero-Shot Style Transfer in Text Using Recurrent Neural Networks. CoRR abs/1711.04731 (2017) - [i9]Daniel N. Rockmore, Chen Fang, Nicholas J. Foti, Tom Ginsburg, David C. Krakauer:
The Cultural Evolution of National Constitutions. CoRR abs/1711.06899 (2017) - 2016
- [c31]Chuankai An, Dan Rockmore:
Predicting Phone Usage Behaviors with Sensory Data Using a Hierarchical Generative Model. PAKDD Workshops 2016: 75-87 - [c30]Chuankai An, Dan Rockmore:
Improving Local Search with Open Geographic Data. WWW (Companion Volume) 2016: 635-640 - [i8]Daryl R. DeFord, Daniel N. Rockmore:
A Random Dot Product Model for Weighted Networks. CoRR abs/1611.02530 (2016) - 2015
- [c29]Chen Fang, Daniel N. Rockmore:
Multi-Task Metric Learning on Network Data. PAKDD (1) 2015: 317-329 - [i7]Robin L. Lumsdaine, Daniel N. Rockmore, Nicholas J. Foti, Gregory Leibon, J. Doyne Farmer:
The Intrafirm Complexity of Systemically Important Financial Institutions. CoRR abs/1505.02305 (2015) - [i6]Reed H. Harder, Alfredo J. Velasco, Michael S. Evans, Daniel N. Rockmore:
Measuring Verifiability in Online Information. CoRR abs/1509.05631 (2015) - 2014
- [c28]Ye Xu, Daniel N. Rockmore:
Sparse Coding for Key Node Selection over Networks. Discovery Science 2014: 337-349 - [c27]James Michael Hughes, Daniel N. Rockmore, Yang Wang:
Non-stationary noise estimation using dictionary learning and Gaussian mixture models. Image Processing: Algorithms and Systems 2014: 90190L - [i5]Chen Fang, Daniel N. Rockmore:
Multi-Task Metric Learning on Network Data. CoRR abs/1411.2337 (2014) - 2013
- [j21]James Michael Hughes, Daniel N. Rockmore, Yang Wang:
Bayesian Learning of Sparse Multiscale Image Representations. IEEE Trans. Image Process. 22(12): 4972-4983 (2013) - [c26]Nicholas J. Foti, Joseph D. Futoma, Daniel N. Rockmore, Sinead Williamson:
A unifying representation for a class of dependent random measures. AISTATS 2013: 20-28 - [c25]Ye Xu, Daniel N. Rockmore, Adam M. Kleinbaum:
Hyperlink Prediction in Hypernetworks Using Latent Social Features. Discovery Science 2013: 324-339 - [c24]Chen Fang, Ye Xu, Daniel N. Rockmore:
Unbiased Metric Learning: On the Utilization of Multiple Datasets and Web Images for Softening Bias. ICCV 2013: 1657-1664 - 2012
- [j20]James Michael Hughes, Dong Mao, Daniel N. Rockmore, Yang Wang, Qiang Wu:
Empirical Mode Decomposition Analysis for Visual Stylometry. IEEE Trans. Pattern Anal. Mach. Intell. 34(11): 2147-2157 (2012) - [c23]Ye Xu, Daniel N. Rockmore:
Feature selection for link prediction. PIKM 2012: 25-32 - [i4]Nicholas J. Foti, Joseph D. Futoma, Daniel N. Rockmore, Sinead Williamson:
A unifying representation for a class of dependent random measures. CoRR abs/1211.4753 (2012) - 2011
- [j19]Rosemary Braun, Gregory Leibon, Scott D. Pauls, Daniel N. Rockmore:
Partition decoupling for multi-gene analysis of gene expression profiling data. BMC Bioinform. 12: 497 (2011) - [j18]Daniel J. Graham, Daniel N. Rockmore:
The Packet Switching Brain. J. Cogn. Neurosci. 23(2): 267-276 (2011) - [c22]James Michael Hughes, Daniel J. Graham, C. Robert Jacobsen, Daniel N. Rockmore:
Comparing higher-order spatial statistics and perceptual judgements in the stylometric analysis of art. EUSIPCO 2011: 1244-1248 - [c21]Gabriel A. Weaver, Nicholas J. Foti, Sergey Bratus, Daniel N. Rockmore, Sean W. Smith:
Using Hierarchical Change Mining to Manage Network Security Policy Evolution. Hot-ICE 2011 - [i3]Tilman Dette, Scott D. Pauls, Daniel N. Rockmore:
Robustness and Contagion in the International Financial Network. CoRR abs/1104.4249 (2011) - [i2]Sean Brocklebank, Scott D. Pauls, Daniel N. Rockmore, Timothy C. Bates:
Characteristic Characteristics. CoRR abs/1107.1229 (2011) - [i1]Greg Leibon, Scott D. Pauls, Daniel N. Rockmore, Robert Savell:
Partition Decomposition for Roll Call Data. CoRR abs/1108.2805 (2011) - 2010
- [c20]Daniel J. Graham, Jay D. Friedenberg, Cyrus H. McCandless, Daniel N. Rockmore:
Preference for art: similarity, statistics, and selling price. Human Vision and Electronic Imaging 2010: 75271 - [c19]David C. Krakauer, Jessica C. Flack, Simon DeDeo, J. Doyne Farmer, Daniel N. Rockmore:
Intelligent Data Analysis of Intelligent Systems. IDA 2010: 8-17
2000 – 2009
- 2009
- [j17]Wooram Park, Gregory Leibon, Daniel N. Rockmore, Gregory S. Chirikjian:
Accurate Image Rotation Using Hermite Expansions. IEEE Trans. Image Process. 18(9): 1988-2003 (2009) - [c18]Daniel J. Graham, Jay D. Friedenberg, Daniel N. Rockmore:
Efficient visual system processing of spatial and luminance statistics in representational and non-representational art. Human Vision and Electronic Imaging 2009: 72401 - 2008
- [j16]Greg Leibon, Daniel N. Rockmore, Wooram Park, Robert Taintor, Gregory S. Chirikjian:
A fast Hermite transform. Theor. Comput. Sci. 409(2): 211-228 (2008) - [c17]Wei Pan, Micah K. Johnson, Larry Polansky, Daniel N. Rockmore, Douglas Repetto:
Owt: a Real-Time Optimal Tuning Application. ICMC 2008 - 2007
- [j15]Cristopher Moore, Daniel N. Rockmore, Alexander Russell, Leonard J. Schulman:
The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts. SIAM J. Comput. 37(3): 938-958 (2007) - [c16]Greg Leibon, Daniel N. Rockmore, Gregory S. Chirikjian:
A fast hermite transform with applications to protein structure determination. SNC 2007: 117-124 - 2006
- [j14]Cristopher Moore, Daniel N. Rockmore, Alexander Russell:
Generic quantum Fourier transforms. ACM Trans. Algorithms 2(4): 707-723 (2006) - [c15]Gustavo K. Rohde, Dennis M. Healy Jr., Carlos Alberto Berenstein, Akram Aldroubi, Daniel N. Rockmore:
Stochastic Analysis of Geometric Image Processing Using B-Splines. ICASSP (5) 2006: 1017-1020 - 2004
- [j13]Rosa C. Orellana, Michael E. Orrison, Daniel N. Rockmore:
Rooted trees and iterated wreath products of cyclic groups. Adv. Appl. Math. 33(3): 531-547 (2004) - [j12]Dennis M. Healy Jr., Peter J. Kostelec, Daniel N. Rockmore:
Towards Safe and Effective High-Order Legendre Transforms with Applications to FFTs for the 2-sphere. Adv. Comput. Math. 21(1-2): 59-105 (2004) - [j11]Jeremy R. Johnson, José M. F. Moura, Markus Püschel, Daniel N. Rockmore:
Special issue on computer algebra and signal processing: forward by the guest editors. J. Symb. Comput. 37(2): 133-135 (2004) - [j10]Richard Foote, Gagan Mirchandani, Daniel N. Rockmore:
Two-dimensional wreath product group-based image processing. J. Symb. Comput. 37(2): 187-207 (2004) - [j9]Siwei Lyu, Daniel N. Rockmore, Hany Farid:
A digital technique for art authentication. Proc. Natl. Acad. Sci. USA 101(49): 17006-17010 (2004) - [c14]Cristopher Moore, Daniel N. Rockmore, Alexander Russell:
Generic quantum Fourier transforms. SODA 2004: 778-787 - [c13]Cristopher Moore, Daniel N. Rockmore, Alexander Russell, Leonard J. Schulman:
The power of basis selection in fourier sampling: hidden subgroup problems in affine groups. SODA 2004: 1113-1122 - 2003
- [j8]David Keith Maslen, Michael E. Orrison, Daniel N. Rockmore:
Computing Isotypic Projections with the Lanczos Iteration. SIAM J. Matrix Anal. Appl. 25(3): 784-803 (2003) - 2002
- [j7]Oliver Bastert, Daniel N. Rockmore, Peter F. Stadler, Gottfried Tinhofer:
Landscapes on spaces of trees. Appl. Math. Comput. 131(2-3): 439-459 (2002) - [c12]Phil Burk, Larry Polansky, Douglas Repetto, Daniel N. Rockmore, Mary Lee Roberts:
Description of an interactive, sound making, online computer music tutorial web book. Available for any browser on a Windows or Apple platform. ICMC 2002 - 2000
- [j6]Daniel N. Rockmore:
The FFT: an algorithm the whole family can use. Comput. Sci. Eng. 2(1): 60-64 (2000) - [j5]Richard Foote, Gagan Mirchandani, Daniel N. Rockmore, Dennis M. Healy Jr., Timothy E. Olson:
A wreath product group approach to signal and image processing .I. Multiresolution analysis. IEEE Trans. Signal Process. 48(1): 102-132 (2000) - [j4]Gagan Mirchandani, Richard Foote, Daniel N. Rockmore, Dennis M. Healy Jr., Timothy E. Olson:
A wreath product group approach to signal and image processing .II. Convolution, correlation, and applications. IEEE Trans. Signal Process. 48(3): 749-767 (2000) - [c11]Gagan Mirchandani, Richard Foote, Daniel N. Rockmore, Dennis M. Healy Jr., Timothy E. Olson:
Wreath product cyclic group-based convolution: a new class of noncommutative filters. ICASSP 2000: 356-359
1990 – 1999
- 1997
- [j3]James R. Driscoll, Dennis M. Healy Jr., Daniel N. Rockmore:
Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs. SIAM J. Comput. 26(4): 1066-1099 (1997) - [c10]Douglas W. Warner, Dennis M. Healy Jr., Daniel N. Rockmore:
A Smooth Non-Rectangular Time-Frequency Segmentation of L2(R2). ICIP (1) 1997: 695-698 - [c9]John D. Lafferty, Daniel N. Rockmore:
Spectral Techniques for Expander Codes. STOC 1997: 160-167 - 1996
- [c8]Dennis M. Healy Jr., Daniel N. Rockmore, Sean S. B. Moore:
An FFT for the 2-sphere and applications. ICASSP 1996: 1323-1326 - [c7]Dennis M. Healy Jr., Gagan Mirchandani, Timothy E. Olson, Daniel N. Rockmore:
Wreath products for image processing. ICASSP 1996: 3581-3584 - 1995
- [c6]David Keith Maslen, Daniel N. Rockmore:
Generalized FFT's- A survey of some recent results. Groups and Computation 1995: 183-237 - [c5]Daniel N. Rockmore:
Some applications of generalized FFT's. Groups and Computation 1995: 329-369 - [c4]David Keith Maslen, Daniel N. Rockmore:
Adapted Diameters and the Efficient Computation of Fourier Transforms on Finite Groups. SODA 1995: 253-262 - 1994
- [j2]Daniel N. Rockmore:
Efficient Computation of Fourier Inversion for Finite Groups. J. ACM 41(1): 31-66 (1994) - 1993
- [c3]László Babai, Robert Beals, Daniel N. Rockmore:
Deciding Finiteness of Matrix Groups in Deterministic Polynomial Time. ISSAC 1993: 117-126 - 1992
- [j1]John D. Lafferty, Daniel N. Rockmore:
Fast Fourier Analysis for SL2 over a Finite Field and Related Numerical Experiments. Exp. Math. 1(2): 115-139 (1992) - [c2]John D. Lafferty, Daniel N. Rockmore:
Numerical Investigation of the Spectrum for Certain Families of Cayley Graphs. Expanding Graphs 1992: 63-73 - 1991
- [c1]Persi Diaconis, Daniel N. Rockmore:
Efficient Computation of Isotypic Projections for the Symmetric Group 87. Groups And Computation 1991: 87-104
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-08 20:32 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:
