default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Eichhorn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j1]John Ringland
, Martha Bohm, So-Ra Baek, Matthew Eichhorn:
Automated survey of selected common plant species in Thai homegardens using Google Street View imagery and a deep neural network. Earth Sci. Informatics 14(1): 179-191 (2021)
Conference and Workshop Papers
- 2023
- [c6]Siddhartha Banerjee, Matthew Eichhorn, David Kempe:
Allocating with Priorities and Quotas: Algorithms, Complexity, and Dynamics. EC 2023: 209-240 - 2022
- [c5]Mayleen Cortez, Matthew Eichhorn, Christina Lee Yu:
Staggered Rollout Designs Enable Causal Inference Under Interference Without Network Knowledge. NeurIPS 2022 - [c4]Matthew Eichhorn, Siddhartha Banerjee, David Kempe:
Online Team Formation Under Different Synergies. WINE 2022: 78-95 - 2020
- [c3]Tri Dao, Nimit Sharad Sohoni, Albert Gu, Matthew Eichhorn, Amit Blonder, Megan Leszczynski, Atri Rudra, Christopher Ré:
Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Maps. ICLR 2020 - 2019
- [c2]Tri Dao, Albert Gu, Matthew Eichhorn, Atri Rudra, Christopher Ré:
Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizations. ICML 2019: 1517-1527 - 2018
- [c1]Subhadeep Karan, Matthew Eichhorn, Blake Hurlburt, Grant Iraci, Jaroslaw Zola:
Fast Counting in Machine Learning Applications. UAI 2018: 540-549
Informal and Other Publications
- 2024
- [i8]Mayleen Cortez-Rodriguez, Matthew Eichhorn, Christina Lee Yu:
Combining Rollout Designs and Clustering for Causal Inference under Low-order Interference. CoRR abs/2405.05119 (2024) - 2022
- [i7]Siddhartha Banerjee, Matthew Eichhorn, David Kempe:
Fair and Efficient Allocation with Quotas. CoRR abs/2204.13019 (2022) - [i6]Mayleen Cortez, Matthew Eichhorn, Christina Lee Yu:
Graph Agnostic Estimators with Staggered Rollout Designs under Network Interference. CoRR abs/2205.14552 (2022) - [i5]Mayleen Cortez, Matthew Eichhorn, Christina Lee Yu:
Exploiting neighborhood interference with low order interactions under unit randomized design. CoRR abs/2208.05553 (2022) - [i4]Matthew Eichhorn, Siddhartha Banerjee, David Kempe:
Online Team Formation under Different Synergies. CoRR abs/2210.05795 (2022) - 2020
- [i3]Tri Dao, Nimit Sharad Sohoni, Albert Gu, Matthew Eichhorn, Amit Blonder, Megan Leszczynski, Atri Rudra, Christopher Ré:
Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Maps. CoRR abs/2012.14966 (2020) - 2019
- [i2]Tri Dao, Albert Gu, Matthew Eichhorn, Atri Rudra, Christopher Ré:
Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizations. CoRR abs/1903.05895 (2019) - 2018
- [i1]Subhadeep Karan, Matthew Eichhorn, Blake Hurlburt, Grant Iraci, Jaroslaw Zola:
Fast Counting in Machine Learning Applications. CoRR abs/1804.04640 (2018)
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-06-25 21:54 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:
