About: László Bélády     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:Whole100003553, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FLászló_Bélády

László "Les" Bélády (born April 29, 1928, in Budapest; died November 6, 2021) was a Hungarian computer scientist notable for devising the Bélády's Min theoretical memory caching algorithm in 1966 while working at IBM Research. He also demonstrated the existence of a Bélády's anomaly. During the 1980s, he was the editor-in-chief of the IEEE Transactions on Software Engineering.

AttributesValues
rdf:type
rdfs:label
  • László Bélády (eo)
  • László Bélády (fr)
  • László Bélády (en)
  • Белади, Ласло (ru)
rdfs:comment
  • László Bélády [lAslO bElAdi], laŭ hungarlingve kutima nomordo (kaj pli komplete) Bélády László Antal estas hungara inĝeniero, profesoro, membro (ekstera (1990)) de Hungara Scienca Akademio. László Bélády [1] naskiĝis la 29-an de aprilo 1928 en Budapeŝto. (eo)
  • László "Les" Bélády (born April 29, 1928, in Budapest; died November 6, 2021) was a Hungarian computer scientist notable for devising the Bélády's Min theoretical memory caching algorithm in 1966 while working at IBM Research. He also demonstrated the existence of a Bélády's anomaly. During the 1980s, he was the editor-in-chief of the IEEE Transactions on Software Engineering. (en)
  • László Bélády, né le 29 avril 1928 à Budapest et mort le 6 novembre 2021, est un informaticien hongrois connu pour son algorithme de 1966 sur la gestion des mémoires. Il a cofondé les (Laboratoires électriques de Mitsubishi) et en a été le président. Il a aussi été membre de l’université du Colorado - Boulder en tant que conseiller en informatique. Bélády a étudié l’ingénierie aéronautique à Budapest. Il a quitté la Hongrie après l’insurrection de 1956. Il a d’abord vécu à Paris, puis à Londres et s’est installé aux États-Unis en 1961. (fr)
  • Ла́сло Бе́лади (венг. Bélády László; род. 29 апреля 1928, Будапешт) — венгерский и американский учёный в области информатики и вычислительной техники, известный благодаря разработке Минимума Белади, теоретического алгоритма кэширования памяти, который он создал в 1966 году, работая в IBM Research. Также он продемонстрировал существование . В 1980-х он стал главным редактором IEEE Transactions в подразделении Software Engineering (Разработка ПО). (ru)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software