DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cheong, Otfried | - |
dc.contributor.author | Efrat, Alon | - |
dc.contributor.author | Har-Peled, Sariel | - |
dc.date.accessioned | 2013-03-18T08:35:02Z | - |
dc.date.available | 2013-03-18T08:35:02Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2004-01-13 | - |
dc.identifier.citation | The 15th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2004, v., no., pp.1091 - 1100 | - |
dc.identifier.uri | http://hdl.handle.net/10203/146572 | - |
dc.language | ENG | - |
dc.title | On finding a guard that sees most and a shop that sells most | - |
dc.type | Conference | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 1091 | - |
dc.citation.endingpage | 1100 | - |
dc.citation.publicationname | The 15th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2004 | - |
dc.identifier.conferencecountry | United States | - |
dc.identifier.conferencecountry | United States | - |
dc.contributor.localauthor | Cheong, Otfried | - |
dc.contributor.nonIdAuthor | Efrat, Alon | - |
dc.contributor.nonIdAuthor | Har-Peled, Sariel | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.