About: Dan Hirschberg     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatResearchersInDistributedComputing, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FDan_Hirschberg

Daniel S. Hirschberg is a full professor in Computer Science at University of California, Irvine. His research interests are in the theory of design and analysis of algorithms. He obtained his PhD in Computer Science from Princeton University in 1975. He supervised the PhD dissertation of Lawrence L. Larmore.

AttributesValues
rdf:type
rdfs:label
  • Dan Hirschberg (en)
rdfs:comment
  • Daniel S. Hirschberg is a full professor in Computer Science at University of California, Irvine. His research interests are in the theory of design and analysis of algorithms. He obtained his PhD in Computer Science from Princeton University in 1975. He supervised the PhD dissertation of Lawrence L. Larmore. (en)
foaf:name
  • Daniel S. Hirschberg (en)
name
  • Daniel S. Hirschberg (en)
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/DanHirschberg.jpg
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
workplaces
dbp:wikiPageUsesTemplate
thumbnail
alma mater
caption
  • Dan Hirschberg (en)
known for
  • Work on Hirschberg's algorithm (en)
has abstract
  • Daniel S. Hirschberg is a full professor in Computer Science at University of California, Irvine. His research interests are in the theory of design and analysis of algorithms. He obtained his PhD in Computer Science from Princeton University in 1975. He supervised the PhD dissertation of Lawrence L. Larmore. He is best known for his 1975 and 1977 work on the longest common subsequence problem: Hirschberg's algorithm for this problem and for the related string edit distance problem solves it efficiently in only linear space. He is also known for his work in several other areas, including Distributed Algorithms. In Nancy Lynch's book Distributed Algorithms she gives details of an algorithm by Hirschberg and J. B. Sinclair for leader election in a synchronous ring. Lynch named this algorithm the HS algorithm, after its authors. (en)
doctoral students
doctoral student
institution
gold:hypernym
schema:sameAs
prov:wasDerivedFrom
page length (characters) of wiki page
alma mater
known for
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
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, 53 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software