![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Katina Russell
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Hao-Ren Yao
, Nairen Cao
, Katina Russell
, Der-Chen Chang
, Ophir Frieder
, Jeremy T. Fineman
:
Self-Supervised Representation Learning on Electronic Health Records with Graph Kernel Infomax. ACM Trans. Comput. Heal. 5(2): 10:1-10:28 (2024) - 2023
- [c8]Nairen Cao
, Jeremy T. Fineman
, Katina Russell
:
Efficient Construction of Directed Hopsets and Parallel Single-source Shortest Paths (Abstract). HOPC@SPAA 2023: 3-4 - 2022
- [j1]Nairen Cao, Jeremy T. Fineman, Katina Russell, Eugene Yang:
I/O-Efficient Algorithms for Topological Sort and Related Problems. ACM Trans. Algorithms 18(1): 5:1-5:24 (2022) - [c7]Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh
:
Nested Active-Time Scheduling. ISAAC 2022: 36:1-36:16 - [c6]Nairen Cao, Jeremy T. Fineman, Katina Russell:
Parallel Shortest Paths with Negative Edge Weights. SPAA 2022: 177-190 - [c5]Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh
:
Brief Announcement: Nested Active-Time Scheduling. SPAA 2022: 381-383 - [i3]Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh:
Nested Active-Time Scheduling. CoRR abs/2207.12507 (2022) - [i2]Hao-Ren Yao, Nairen Cao, Katina Russell, Der-Chen Chang, Ophir Frieder, Jeremy T. Fineman:
Self-supervised Representation Learning on Electronic Health Records with Graph Kernel Infomax. CoRR abs/2209.00655 (2022) - 2021
- [c4]Nairen Cao, Jeremy T. Fineman, Katina Russell:
Brief Announcement: An Improved Distributed Approximate Single Source Shortest Paths Algorithm. PODC 2021: 493-496 - 2020
- [c3]Nairen Cao, Jeremy T. Fineman, Katina Russell:
Improved Work Span Tradeoff for Single Source Reachability and Approximate Shortest Paths. SPAA 2020: 511-513 - [c2]Nairen Cao, Jeremy T. Fineman, Katina Russell:
Efficient construction of directed hopsets and parallel approximate shortest paths. STOC 2020: 336-349
2010 – 2019
- 2019
- [c1]Nairen Cao, Jeremy T. Fineman, Katina Russell, Eugene Yang
:
I/O-Efficient Algorithms for Topological Sort and Related Problems. SODA 2019: 2053-2070 - [i1]Nairen Cao, Jeremy T. Fineman, Katina Russell:
Efficient Construction of Directed Hopsets and Parallel Approximate Shortest Paths. CoRR abs/1912.05506 (2019)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-03 01:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint