Piotr Indyk (original) (raw)
- Piotr Indyk (geb. vor 1995) ist ein polnisch-US-amerikanischer theoretischer Informatiker. Er ist Professor am CSAIL des Massachusetts Institute of Technology. Indyk erhielt 1995 seinen Magister-Abschluss in Informatik an der Universität Warschau und promovierte 2000 bei Rajeev Motwani an der Stanford University (High-dimensional computational geometry). Seit 2000 ist er am MIT tätig. Piotr Indyk ist unter anderem für seine Beiträge zum Lokalitäts-sensitiven Hashing (LSH) bekannt. Lokalitäts-sensitives Hashing kann für die Nearest-Neighbor-Suche in hohen Dimensionen eingesetzt werden. Es findet Anwendung bei Suchmaschinen und im Data Mining. Im Jahr 2002 erhielt Indyk den Career Award der National Science Foundation.Im Jahr 2012 erhielt er zusammen mit Andrei Broder und Moses S. Charikar den Paris-Kanellakis-Preis für seine Arbeiten zum Lokalitäts-sensitiven Hashing. Er war Packard Fellow und Sloan Fellow. Zu seinen Doktoranden gehört Alexandr (Alex) Andoni. (de)
- Piotr Indyk is Thomas D. and Virginia W. Cabot Professor in the Theory of Computation Group at the Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology. (en)
- Piotr Indyk est un informaticion théoricien, professeur au MIT Computer Science and Artificial Intelligence Laboratory du Massachusetts Institute of Technology. Il travaille principalement en géométrie algorithmique de dimensions élevées. (fr)
- Piotr Indyk é um cientista da computação polonês-estadunidense, professor do do Instituto de Tecnologia de Massachusetts (MIT). Indyk obteve em 1995 o bacharelado em informática na Universidade de Varsóvia, com um doutorado em 2000 na Universidade Stanford, orientado por , com a tese High-dimensional computational geometry. Trabalha desde 2000 no MIT. Piotr Indyk é conhecido dentre outros por suas contribuições para a função hash. Recebeu o Prêmio Paris Kanellakis de 2012, juntamente com e . (pt)
- Пйотр Індик - американський науковець, професор групи теорії обчислень в Лабораторії комп'ютерних наук та штучного інтелекту Массачусетського технологічного інституту. (uk)
- dbr:List_of_Fellows_of_the_Association_for_Computing_Machinery
- dbr:David_and_Lucile_Packard_Foundation
- dbr:National_Science_Foundation
- dbr:Sloan_Fellowship
- dbr:Simons_Investigator
- dbr:Paris_Kanellakis_Award
- dbr:Symposium_on_Foundations_of_Computer_Science
- 21582029 (xsd:integer)
- 5202 (xsd:nonNegativeInteger)
- 1123172863 (xsd:integer)
- dbc:Researchers_in_geometric_algorithms
- dbc:Polish_computer_scientists
- dbr:List_of_Fellows_of_the_Association_for_Computing_Machinery
- dbr:United_States
- dbr:University_of_Warsaw
- dbr:David_and_Lucile_Packard_Foundation
- dbc:Living_people
- dbc:Year_of_birth_missing_(living_people)
- dbr:Massachusetts_Institute_of_Technology
- dbr:Mathematics
- dbr:MIT_Computer_Science_and_Artificial_Intelligence_Laboratory
- dbr:MIT_Technology_Review
- dbr:Stanford_University
- dbr:Compressed_sensing
- dbr:Computational_geometry
- dbr:Computational_learning_theory
- dbr:Computer_science
- dbc:Stanford_University_alumni
- dbc:Theoretical_computer_scientists
- dbr:Johnson–Lindenstrauss_lemma
- dbr:Locality-sensitive_hashing
- dbr:Alfred_P._Sloan_Foundation
- dbr:Fourier_transform
- dbr:Fast_Fourier_transform
- dbr:Jelani_Nelson
- dbr:Association_for_Computing_Machinery
- dbc:Fellows_of_the_Association_for_Computing_Machinery
- dbc:Massachusetts_Institute_of_Technology_faculty
- dbc:Simons_Investigator
- dbr:Poland
- dbr:Poles
- dbr:National_Science_Foundation
- dbr:Rajeev_Motwani
- dbr:Pattern_matching
- dbr:Sloan_Fellowship
- dbr:Streaming_algorithm
- dbr:Simons_Investigator
- dbr:Paris_Kanellakis_Award
- dbr:Symposium_on_Foundations_of_Computer_Science
- dbr:Stanford_University
- University of Warsaw (en)
- Simons Investigator (en)
- ACM Fellow (en)
- Career Award from the National Science Foundation (en)
- Sloan Fellowship from the Alfred P. Sloan Foundation (en)
- Best Student Paper Award at FOCS (en)
- Packard Fellowship from the Packard Foundation (en)
- Paris Kanellakis Award from the ACM (en)
- Computational geometry, Streaming algorithms, Computational learning theory (en)
- Piotr Indyk (en)
- dbc:Researchers_in_geometric_algorithms
- dbc:Polish_computer_scientists
- dbc:Living_people
- dbc:Year_of_birth_missing_(living_people)
- dbc:Stanford_University_alumni
- dbc:Theoretical_computer_scientists
- dbc:Fellows_of_the_Association_for_Computing_Machinery
- dbc:Massachusetts_Institute_of_Technology_faculty
- dbc:Simons_Investigator
- owl:Thing
- foaf:Person
- dbo:Person
- dul:NaturalPerson
- wikidata:Q19088
- wikidata:Q215627
- wikidata:Q5
- wikidata:Q729
- dbo:Animal
- dbo:Eukaryote
- dbo:Scientist
- dbo:Species
- schema:Person
- yago:WikicatLivingPeople
- yago:WikicatTheoreticalComputerScientists
- yago:WikicatStanfordUniversityAlumni
- wikidata:Q901
- yago:Alumnus109786338
- yago:CausalAgent100007347
- yago:ComputerScientist109951070
- yago:ComputerUser109951274
- yago:Intellectual109621545
- yago:LivingThing100004258
- yago:Object100002684
- yago:Organism100004475
- yago:Person100007846
- yago:PhysicalEntity100001930
- yago:ResearchWorker110523076
- yago:YagoLegalActor
- yago:YagoLegalActorGeo
- yago:Scholar110557854
- yago:Scientist110560637
- yago:Whole100003553
- yago:WikicatPolishComputerScientists
- yago:WikicatResearchersInGeometricAlgorithms
- umbel-rc:Scientist
- Piotr Indyk is Thomas D. and Virginia W. Cabot Professor in the Theory of Computation Group at the Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology. (en)
- Piotr Indyk est un informaticion théoricien, professeur au MIT Computer Science and Artificial Intelligence Laboratory du Massachusetts Institute of Technology. Il travaille principalement en géométrie algorithmique de dimensions élevées. (fr)
- Piotr Indyk é um cientista da computação polonês-estadunidense, professor do do Instituto de Tecnologia de Massachusetts (MIT). Indyk obteve em 1995 o bacharelado em informática na Universidade de Varsóvia, com um doutorado em 2000 na Universidade Stanford, orientado por , com a tese High-dimensional computational geometry. Trabalha desde 2000 no MIT. Piotr Indyk é conhecido dentre outros por suas contribuições para a função hash. Recebeu o Prêmio Paris Kanellakis de 2012, juntamente com e . (pt)
- Пйотр Індик - американський науковець, професор групи теорії обчислень в Лабораторії комп'ютерних наук та штучного інтелекту Массачусетського технологічного інституту. (uk)
- Piotr Indyk (geb. vor 1995) ist ein polnisch-US-amerikanischer theoretischer Informatiker. Er ist Professor am CSAIL des Massachusetts Institute of Technology. Indyk erhielt 1995 seinen Magister-Abschluss in Informatik an der Universität Warschau und promovierte 2000 bei Rajeev Motwani an der Stanford University (High-dimensional computational geometry). Seit 2000 ist er am MIT tätig. Zu seinen Doktoranden gehört Alexandr (Alex) Andoni. (de)
- Piotr Indyk (de)
- Piotr Indyk (fr)
- Piotr Indyk (en)
- Piotr Indyk (pt)
- Пйотр Індик (uk)
- freebase:Piotr Indyk
- yago-res:Piotr Indyk
- https://dblp.org/pid/i/PiotrIndyk
- http://viaf.org/viaf/102008878
- http://viaf.org/viaf/270776272
- https://orcid.org/0000-0003-1254-2424
- wikidata:Piotr Indyk
- dbpedia-de:Piotr Indyk
- dbpedia-fr:Piotr Indyk
- dbpedia-pt:Piotr Indyk
- dbpedia-uk:Piotr Indyk
- https://global.dbpedia.org/id/4u8QQ
- Piotr Indyk (en)
is dbo:doctoralAdvisor of
is dbo:doctoralStudent of
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
- dbr:List_of_fellows_of_the_Association_for_Computing_Machinery
- dbr:List_of_Polish_people
- dbr:Indyk
- dbr:List_of_people_by_Erdős_number
- dbr:List_of_people_named_Piotr
- dbr:Machtey_Award
- dbr:K-independent_hashing
- dbr:Paris_Kanellakis
- dbr:List_of_International_Congresses_of_Mathematicians_Plenary_and_Invited_Speakers
- dbr:Jelani_Nelson
- dbr:Manolis_Kellis
- dbr:Indyk,_Piotr
- dbr:MinHash
- dbr:Rajeev_Motwani
- dbr:Symposium_on_Theory_of_Computing
- dbr:Symposium_on_Discrete_Algorithms
- dbr:Moses_Charikar
- dbr:Paris_Kanellakis_Award
- dbr:Symposium_on_Foundations_of_Computer_Science
is dbp:doctoralStudents of
is foaf:primaryTopic of