Lista referatów

• 2018-09-24, godz. 14:15, TBA

  Peter Selinger (Dalhousie University)

  Quantum computing

  As an idea, quantum computing has been around for more than 30 years. During most of this time, practical quantum computers were considered a far-in-the-future prospect. Consequently, most research focused on theoretical questions, such as quantum algorithms and their asymptotic complexity. This has...

• 2018-05-24, godz. 14:15, 5440

  Atri Rudra (SUNY University at Buffalo)

  (Dense Structured) Matrix Vector Multiplication

  We will study the problem of matrix-vector multiplication. In particular, we consider the case when the matrix is dense and structured (but the vector is arbitrary). We will study the arithmetic complexity of this operation with the goal of identifying when we can perform this operation in near-line...

• 2018-05-10, godz. 13:15, 5440

  Daniel Kral (University of Warwick)

  Combinatorial limits

  The theory of combinatorial limits provides analytic tools to represent and analyze large discrete objects. Such tools have found important applications in various areas of computer science and mathematics. They also led to opening new links between algebra, analysis, combinatorics, ergodic theory, ...

• 2018-04-18, godz. 14:15, 2180

  Carsten Lutz (University of Bremen)

  Ontology Engineering and Ontological Data Access

  In artificial intelligence, ontologies are used to capture the knowledge of an application domain. They constitute a core component of `intelligent' systems and also play an important role in querying data that is incomplete and heterogeneous, arising in prominent applications such as web data e...

• 2018-03-15, godz. 14:15, 3180

  Marcin Jurdziński (University of Warwick)

  Algorithms for solving parity games

  Parity games have played a fundamental role in automata theory, logic, and their applications to verification and synthesis since early 1990's. Solving parity games is polynomial-time equivalent to checking emptiness of tree automata and to the modal mu-calculus model checking. It is a long-stan...

• 2018-01-25, godz. 14:15, 3160

  Albert Atserias (Universitat Politècnica de Catalunya)

  The Width Method for Resolution and Sums-of-Squares Proofs

  Resolution is a proof system for propositional logic of great practical use. Indeed, virtually all practically-used SAT-solvers are "resolution-based" in the sense that their underlying inference system is Resolution. In particular, when the SAT-solvers halt and state that a given formula ...

• 2017-12-01, godz. 14:15, 5070 i 4070

  Jakob Rehof (Technische Universität Dortmund)

  A Type-Based Approach to Component-Oriented Synthesis

  The synthesis problem (given a logical specification, to construct a program satisfying the specification) is one of the most challenging problems in computer science. The problem is intrinsically of high computational complexity. Moreover, a no less important problem from a pragmatic perspective is...

• 2017-10-12, godz. 15:00, 3180

  Piotr Faliszewski (AGH)

  Algorithmic Analysis of Elections

  (see http://phdopen.mimuw.edu.pl/index.php?page=z17w1 for full description) Computational social choice (COMSOC) is an interdisciplinary research that focuses on using methods from computer science, economics, and operations research in the context of group decision making. In this course we w...

• 2017-05-18, godz. 14:45, 2080

  Gerhard Lauer (University of Goettingen)

  Humanities in the Digital Age

  I give an introduction to digital humanities, encompassing major fields of research. We will go more into detail about exploring texts by computers. Text mining is a fast growing area to use machine for reading texts. We make use and discuss common tools from Voyant to R. More info: http://phdop...

• 2017-04-27, godz. 15:30, 5070

  Bartosz Klin (Uniwersytet Warszawski)

  Computation theory with atoms

  First, a caveat: "atoms" here are mathematical rather than physical entities, so people hoping for some kind of nuclear computation devices will be disappointed. "Computation with atoms" means computation over structures that are infinite, but exhibit a lot of symmetries that ma...

Strony