Ian A. Kash

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Sushirdeep Narayana

> Home > Persons > Ian A. Kash

Publications

2023
[c50]
- view
  - electronic edition @ mlr.press (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/uai/NarayanaK23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/uai/NarayanaK23
Sushirdeep Narayana, Ian A. Kash:
Keep-Alive Caching for the Hawkes process. UAI 2023: 1499-1509
[i28]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2309-03521
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2309-03521
Sushirdeep Narayana, Ian A. Kash:
Keep-Alive Caching for the Hawkes process. CoRR abs/2309.03521 (2023)
2021
[c47]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/aaai/NarayanaK21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/NarayanaK21
Sushirdeep Narayana, Ian A. Kash:
Fair and Efficient Allocations with Limited Demands. AAAI 2021: 5620-5627
[i25]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2103-00391
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2103-00391
Sushirdeep Narayana, Ian A. Kash:
Fair and Efficient Allocations with Limited Demands. CoRR abs/2103.00391 (2021)

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.