Property |
Value |
dbo:abstract
|
- Mihai Pătraşcu (1982-2012) est un informaticien théoricien roumano-américain qui travaillait aux (en) à Florham Park, (New Jersey). (fr)
- Mihai Pătraşcu (1982-2012) est un informaticien théoricien roumano-américain qui travaillait aux (en) à Florham Park, (New Jersey). (fr)
|
dbo:almaMater
| |
dbo:award
| |
dbo:birthPlace
| |
dbo:citizenship
| |
dbo:deathPlace
| |
dbo:doctoralAdvisor
| |
dbo:occupation
| |
dbo:wikiPageExternalLink
| |
dbo:wikiPageID
| |
dbo:wikiPageLength
|
- 6834 (xsd:nonNegativeInteger)
|
dbo:wikiPageRevisionID
| |
dbo:wikiPageWikiLink
| |
prop-fr:année
|
- 2006 (xsd:integer)
- 2007 (xsd:integer)
- 2010 (xsd:integer)
- 2011 (xsd:integer)
|
prop-fr:arxiv
|
- 808.112800 (xsd:double)
- cs/0502041 (fr)
|
prop-fr:doi
| |
prop-fr:fr
|
- AT&T Labs (fr)
- prix Machtey (fr)
- Carol I National College (fr)
- Semantic scholar (fr)
- AT&T Labs (fr)
- prix Machtey (fr)
- Carol I National College (fr)
- Semantic scholar (fr)
|
prop-fr:journal
| |
prop-fr:langue
| |
prop-fr:lienAuteur
|
- Erik Demaine (fr)
- Mikkel Thorup (fr)
- Timothy M. Chan (fr)
- Erik Demaine (fr)
- Mikkel Thorup (fr)
- Timothy M. Chan (fr)
|
prop-fr:nom
|
- Chan (fr)
- Demaine (fr)
- Harmon (fr)
- Thorup (fr)
- Iacono (fr)
- Pătraşcu (fr)
- Roditty (fr)
- Chan (fr)
- Demaine (fr)
- Harmon (fr)
- Thorup (fr)
- Iacono (fr)
- Pătraşcu (fr)
- Roditty (fr)
|
prop-fr:numéro
|
- 1 (xsd:integer)
- 2 (xsd:integer)
- 3 (xsd:integer)
- 4 (xsd:integer)
|
prop-fr:pages
|
- 240 (xsd:integer)
- 333 (xsd:integer)
- 703 (xsd:integer)
- 730 (xsd:integer)
- 827 (xsd:integer)
- 932 (xsd:integer)
|
prop-fr:prénom
|
- Erik (fr)
- John (fr)
- Mihai (fr)
- Mikkel (fr)
- Dion (fr)
- Timothy (fr)
- Liam (fr)
- Timothy M. (fr)
- Erik (fr)
- John (fr)
- Mihai (fr)
- Mikkel (fr)
- Dion (fr)
- Timothy (fr)
- Liam (fr)
- Timothy M. (fr)
|
prop-fr:texte
|
- AT&T Labs (fr)
- Carol I National College (fr)
- AT&T Labs (fr)
- Carol I National College (fr)
|
prop-fr:titre
|
- Dynamic optimality—almost (fr)
- Logarithmic lower bounds in the cell-probe model (fr)
- Unifying the landscape of cell-probe lower bounds (fr)
- Transdichotomous results in computational geometry, I: Point location in sublogarithmic time (fr)
- Higher lower bounds for near-neighbor and further rich problems (fr)
- Dynamic connectivity: connecting to networks and geometry (fr)
- Dynamic optimality—almost (fr)
- Logarithmic lower bounds in the cell-probe model (fr)
- Unifying the landscape of cell-probe lower bounds (fr)
- Transdichotomous results in computational geometry, I: Point location in sublogarithmic time (fr)
- Higher lower bounds for near-neighbor and further rich problems (fr)
- Dynamic connectivity: connecting to networks and geometry (fr)
|
prop-fr:trad
|
- AT&T Labs (fr)
- Machtey Award (fr)
- Carol I National College (fr)
- AT&T Labs (fr)
- Machtey Award (fr)
- Carol I National College (fr)
|
prop-fr:url
| |
prop-fr:volume
|
- 35 (xsd:integer)
- 37 (xsd:integer)
- 39 (xsd:integer)
- 40 (xsd:integer)
|
prop-fr:wikiPageUsesTemplate
| |
dct:subject
| |
rdf:type
| |
rdfs:comment
|
- Mihai Pătraşcu (1982-2012) est un informaticien théoricien roumano-américain qui travaillait aux (en) à Florham Park, (New Jersey). (fr)
- Mihai Pătraşcu (1982-2012) est un informaticien théoricien roumano-américain qui travaillait aux (en) à Florham Park, (New Jersey). (fr)
|
rdfs:label
|
- Mihai Pătraşcu (fr)
- Mihai Pătrașcu (it)
- Mihai Pătrașcu (computer scientist) (en)
|
rdfs:seeAlso
| |
owl:sameAs
| |
prov:wasDerivedFrom
| |
foaf:isPrimaryTopicOf
| |
is dbo:doctoralStudent
of | |
is dbo:wikiPageRedirects
of | |
is dbo:wikiPageWikiLink
of | |
is oa:hasTarget
of | |
is foaf:primaryTopic
of | |