Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Uri Stav" ( http://dblp.L3S.de/Authors/Uri_Stav )

URL (Homepage):  http://www.cs.tau.ac.il/~uristav/  Author page on DBLP  Author page in RDF  Community of Uri Stav in ASPL-2

Publication years (Num. hits)
2004 (1) 2007 (2) 2008 (5) 2009 (4)
Publication types (Num. hits)
article(9) inproceedings(3)
Venues (Conferences, Journals, ...)
CoRR(2) FOCS(2) COCOON(1) Combinatorics, Probability & C...(1) IEEE Transactions on Informati...(1) J. Comb. Theory, Ser. B(1) Journal of Graph Theory(1) Random Struct. Algorithms(1) SIAM J. Discrete Math.(1) Theor. Comput. Sci.(1)
Authors
Uri Stav(12) Noga Alon(9) Eyal Lubetzky(5) Amit Weinstein(2) Asaf Shapira(2) Avinatan Hassidim(2)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.
Results
Found 12 publication records. Showing 12 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Noga Alon, Uri Stav Hardness of edge-modification problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Noga Alon, Asaf Shapira, Uri Stav Can a Graph Have Distinct Regular Partitions? Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Noga Alon, Uri Stav Stability-type results for hereditary properties. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Eyal Lubetzky, Uri Stav Nonlinear index coding outperforming the linear optimum. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Noga Alon, Uri Stav The maximum edit distance from hereditary graph properties. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Noga Alon, Uri Stav What is the furthest graph from a hereditary property? Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Eyal Lubetzky, Uri Stav Non-linear index coding outperforming the linear optimum Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Noga Alon, Avinatan Hassidim, Eyal Lubetzky, Uri Stav, Amit Weinstein Broadcasting with side information Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Noga Alon, Eyal Lubetzky, Uri Stav, Amit Weinstein, Avinatan Hassidim Broadcasting with Side Information. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Noga Alon, Asaf Shapira, Uri Stav Can a Graph Have Distinct Regular Partitions? Search on Bibsonomy COCOON The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Eyal Lubetzky, Uri Stav Non-Linear Index Coding Outperforming the Linear Optimum. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Noga Alon, Uri Stav New Bounds on Parent-Identifying Codes: The Case of Multiple Parents. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #12 of 12 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.