Matches in DBpedia 2016-04 for { <http://doi.org/10.1145/380752.380813> ?p ?o }
Showing triples 1 to 16 of
16
with 100 triples per page.
- 380752.380813 arxiv "cs/0111050".
- 380752.380813 author1Link "Daniel Spielman".
- 380752.380813 author2Link "Shanghua Teng".
- 380752.380813 chapter "Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time".
- 380752.380813 doi "10.1145/380752.380813".
- 380752.380813 first1 "Daniel".
- 380752.380813 first2 "Shang-Hua".
- 380752.380813 isCitedBy Simplex_algorithm.
- 380752.380813 isCitedBy Smoothed_analysis.
- 380752.380813 isbn "978-1-58113-349-3".
- 380752.380813 last1 "Spielman".
- 380752.380813 last2 "Teng".
- 380752.380813 pages "296–305".
- 380752.380813 publisher "ACM".
- 380752.380813 title "Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing".
- 380752.380813 year "2001".