![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Uri Stav
Person information
- affiliation: Tel Aviv University, Israel
Refine list
![note](https://dblp.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
- [c4]Lilita Infante, Roger A. Hallman
, John Hays, Evelyn Cronnon
, Uri Stav:
Recovery CAT: A Digital Forensics Tool for Cryptocurrency Investigations. ISDFS 2024: 1-5
2000 – 2009
- 2009
- [j7]Noga Alon, Uri Stav:
Stability-type results for hereditary properties. J. Graph Theory 62(1): 65-83 (2009) - [j6]Noga Alon, Asaf Shapira, Uri Stav:
Can a Graph Have Distinct Regular Partitions? SIAM J. Discret. Math. 23(1): 278-287 (2009) - [j5]Noga Alon, Uri Stav:
Hardness of edge-modification problems. Theor. Comput. Sci. 410(47-49): 4920-4927 (2009) - [j4]Eyal Lubetzky, Uri Stav:
Nonlinear index coding outperforming the linear optimum. IEEE Trans. Inf. Theory 55(8): 3544-3551 (2009) - 2008
- [j3]Noga Alon, Uri Stav:
The maximum edit distance from hereditary graph properties. J. Comb. Theory B 98(4): 672-697 (2008) - [j2]Noga Alon, Uri Stav:
What is the furthest graph from a hereditary property? Random Struct. Algorithms 33(1): 87-104 (2008) - [c3]Noga Alon, Eyal Lubetzky, Uri Stav, Amit Weinstein, Avinatan Hassidim:
Broadcasting with Side Information. FOCS 2008: 823-832 - [i2]Eyal Lubetzky, Uri Stav:
Non-linear index coding outperforming the linear optimum. CoRR abs/0806.1919 (2008) - [i1]Noga Alon, Avinatan Hassidim, Eyal Lubetzky, Uri Stav, Amit Weinstein:
Broadcasting with side information. CoRR abs/0806.3246 (2008) - 2007
- [b1]Uri Stav:
Graph edit distance and hereditary properties. Tel Aviv University, Israel, 2007 - [c2]Noga Alon, Asaf Shapira, Uri Stav:
Can a Graph Have Distinct Regular Partitions? COCOON 2007: 428-438 - [c1]Eyal Lubetzky, Uri Stav:
Non-Linear Index Coding Outperforming the Linear Optimum. FOCS 2007: 161-168 - 2004
- [j1]Noga Alon, Uri Stav:
New Bounds on Parent-Identifying Codes: The Case of Multiple Parents. Comb. Probab. Comput. 13(6): 795-807 (2004)
Coauthor Index
![](https://dblp.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-19 21:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint