![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Nathanaël Fijalkow, Laboratoire d'Informatique Algorithmique: Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 
Friday 13 November 2015, 14:00-15:00
Online Space Complexity
- 👤 Speaker: Nathanaël Fijalkow, Laboratoire d'Informatique Algorithmique: Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 🔗 Website
- 📅 Date & Time: Friday 13 November 2015, 14:00 - 15:00
- 📍 Venue: FW26
Questions? Contact
Ohad Kammar
Abstract
The Online Space Complexity of a language L (over finite words) is a complexity measure aiming at quantifying the amount of information (in terms of space consumption) needed to process words letter by letter and maintaining the answer to the Boolean query “is the word read so far in L?”.
The aim of this talk is to motivate the study of Online Space Complexity and to give an overview of the preliminary results we obtained so far. In particular, we’ll discuss the Online Space Complexity of Probabilistic Languages.
Series This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computing and Mathematics
- Department of Computer Science and Technology talks and seminars
- FW26
- Interested Talks
- Logic and Semantics Seminar (Computer Laboratory)
- Martin's interesting talks
- School of Technology
- tcw57’s list
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.