About: Stefan Szeider     Goto   Sponge   NotDistinct   Permalink

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

Stefan Szeider is an Austrian computer scientist who works on the areas of algorithms, computational complexity, theoretical computer science, and more specifically on propositional satisfiability, constraint satisfaction problems, and parameterised complexity. He is a full professor at the Faculty of Informatics at the Vienna University of Technology (TU Wien), the head of the Algorithms and Complexity Group, and co-chair of the Vienna Center for Logic and Algorithms of TU Wien (VCLA).

AttributesValues
rdf:type
rdfs:label
  • Stefan Szeider (en)
rdfs:comment
  • Stefan Szeider is an Austrian computer scientist who works on the areas of algorithms, computational complexity, theoretical computer science, and more specifically on propositional satisfiability, constraint satisfaction problems, and parameterised complexity. He is a full professor at the Faculty of Informatics at the Vienna University of Technology (TU Wien), the head of the Algorithms and Complexity Group, and co-chair of the Vienna Center for Logic and Algorithms of TU Wien (VCLA). (en)
foaf:name
  • Stefan Szeider (en)
foaf:homepage
name
  • Stefan Szeider (en)
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
  • TU Wien
  • Austrian Academy of Sciences (en)
  • University of Durham (en)
  • University of Toronto (en)
dbp:wikiPageUsesTemplate
alma mater
fields
  • Algorithms
  • Parameterized complexity (en)
  • Theoretical computer science (en)
  • Complexity (en)
  • Boolean satisfiability (en)
  • Constraint satisfaction (en)
nationality
  • Austrian (en)
has abstract
  • Stefan Szeider is an Austrian computer scientist who works on the areas of algorithms, computational complexity, theoretical computer science, and more specifically on propositional satisfiability, constraint satisfaction problems, and parameterised complexity. He is a full professor at the Faculty of Informatics at the Vienna University of Technology (TU Wien), the head of the Algorithms and Complexity Group, and co-chair of the Vienna Center for Logic and Algorithms of TU Wien (VCLA). (en)
doctoral advisors
  • Georg Gottlob (en)
  • Herbert Fleischner (en)
institution
prov:wasDerivedFrom
page length (characters) of wiki page
academic discipline
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 (61 GB total memory, 49 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software