default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKiran Tomlinson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Kiran Tomlinson
, Austin R. Benson:
Graph-based methods for discrete choice. Netw. Sci. 12(1): 21-40 (2024)- [c9]Kiran Tomlinson, Johan Ugander, Jon M. Kleinberg:
The Moderating Effect of Instant Runoff Voting. AAAI 2024: 9909-9917 - [c8]Ben Aoki-Sherwood, Catherine Bregou, David Liben-Nowell, Kiran Tomlinson, Thomas Zeng:
Bounding Consideration Probabilities in Consider-Then-Choose Ranking Models. AAMAS 2024: 2129-2131 - [i9]Ben Aoki-Sherwood, Catherine Bregou, David Liben-Nowell, Kiran Tomlinson, Thomas Zeng:
Bounding Consideration Probabilities in Consider-Then-Choose Ranking Models. CoRR abs/2401.11016 (2024) - [i8]Kiran Tomlinson, Tanvi Namjoshi, Johan Ugander, Jon M. Kleinberg:
Replicating Electoral Success. CoRR abs/2402.17109 (2024) - 2023
- [j2]Kiran Tomlinson, Mengting Wan, Cao Lu, Brent J. Hecht, Jaime Teevan, Longqi Yang:
Targeted Training for Multi-organization Recommendation. Trans. Recomm. Syst. 1(3): 1-18 (2023) - [c7]Kiran Tomlinson, Johan Ugander, Jon M. Kleinberg:
Ballot Length in Instant Runoff Voting. AAAI 2023: 5841-5849 - [c6]Kiran Tomlinson, Jennifer Neville, Longqi Yang, Mengting Wan, Cao Lu:
Workplace Recommendation with Temporal Network Objectives. KDD 2023: 4958-4969 - [i7]Kiran Tomlinson, Johan Ugander, Jon M. Kleinberg:
Moderation in instant runoff voting. CoRR abs/2303.09734 (2023) - 2022
- [i6]Kiran Tomlinson, Austin R. Benson:
Graph-Based Methods for Discrete Choice. CoRR abs/2205.11365 (2022) - [i5]Kiran Tomlinson, Johan Ugander, Jon M. Kleinberg:
Ballot length in instant runoff voting. CoRR abs/2207.08958 (2022) - 2021
- [c5]Kiran Tomlinson, Johan Ugander, Austin R. Benson:
Choice Set Confounding in Discrete Choice. KDD 2021: 1571-1581 - [c4]Kiran Tomlinson, Austin R. Benson:
Learning Interpretable Feature Context Effects in Discrete Choice. KDD 2021: 1582-1592 - [i4]Kiran Tomlinson, Johan Ugander, Austin R. Benson:
Choice Set Confounding in Discrete Choice. CoRR abs/2105.07959 (2021) - 2020
- [j1]Zach Dinardo, Kiran Tomlinson, Anna M. Ritz, Layla Oesper:
Distance measures for tumor evolutionary trees. Bioinform. 36(7): 2090-2097 (2020) - [c3]Patty Commins, David Liben-Nowell, Tina Liu, Kiran Tomlinson:
Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions. CPM 2020: 11:1-11:15 - [c2]Kiran Tomlinson, Austin R. Benson:
Choice Set Optimization Under Discrete Choice Models of Group Decisions. ICML 2020: 9514-9525 - [i3]Kiran Tomlinson, Austin R. Benson:
Choice Set Optimization Under Discrete Choice Models of Group Decisions. CoRR abs/2002.00421 (2020) - [i2]Patty Commins, David Liben-Nowell, Tina Liu, Kiran Tomlinson:
Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions. CoRR abs/2004.08993 (2020) - [i1]Kiran Tomlinson, Austin R. Benson:
Learning Interpretable Feature Context Effects in Discrete Choice. CoRR abs/2009.03417 (2020)
2010 – 2019
- 2018
- [c1]Kiran Tomlinson, Layla Oesper:
Examining Tumor Phylogeny Inference in Noisy Sequencing Data. BIBM 2018: 36-43
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-09 13:07 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:
