Uri Stav

14 papers A* 2Misc 1Journal 9Unranked 1

Year	Rank	Type	Title / Venue / Authors
2024	—	`conf`	Recovery CAT: A Digital Forensics Tool for Cryptocurrency Investigations. ISDFS Lilita Infante, Roger A. Hallman, John Hays, Evelyn Cronnon, Uri Stav
2009	J	`jnl`	Can a Graph Have Distinct Regular Partitions? SIAM J. Discret. Math. Noga Alon, Asaf Shapira, Uri Stav
2009	J	`jnl`	Hardness of edge-modification problems. Theor. Comput. Sci. Noga Alon, Uri Stav
2009	J	`jnl`	Nonlinear index coding outperforming the linear optimum. IEEE Trans. Inf. Theory Eyal Lubetzky, Uri Stav
2009	J	`jnl`	Stability-type results for hereditary properties. J. Graph Theory Noga Alon, Uri Stav
2008	A*	`conf`	Broadcasting with Side Information. FOCS Noga Alon, Eyal Lubetzky, Uri Stav, Amit Weinstein, Avinatan Hassidim
2008	J	`jnl`	Broadcasting with side information CoRR Noga Alon, Avinatan Hassidim, Eyal Lubetzky, Uri Stav, Amit Weinstein
2008	J	`jnl`	Non-linear index coding outperforming the linear optimum CoRR Eyal Lubetzky, Uri Stav
2008	J	`jnl`	The maximum edit distance from hereditary graph properties. J. Comb. Theory B Noga Alon, Uri Stav
2008	J	`jnl`	What is the furthest graph from a hereditary property? Random Struct. Algorithms Noga Alon, Uri Stav
2007	Misc	`conf`	Can a Graph Have Distinct Regular Partitions? COCOON Noga Alon, Asaf Shapira, Uri Stav
2007	—	`—`	Graph edit distance and hereditary properties Uri Stav
2007	A*	`conf`	Non-Linear Index Coding Outperforming the Linear Optimum. FOCS Eyal Lubetzky, Uri Stav
2004	J	`jnl`	New Bounds on Parent-Identifying Codes: The Case of Multiple Parents. Comb. Probab. Comput. Noga Alon, Uri Stav