Network Profiles
Twitter Profile: Nathanaël Fijalkow (@NathFijalkow) | Twitter
The latest Tweets from Nathanaël Fijalkow (@NathFijalkow)
nathanael-fijalkow/acme · GitHub
github.com
Automata with Counters, Monoids and Equivalence. Contribute to acme development by creating an account on GitHub.
Martin Zimmermann
www.react.uni-saarland.de
Joint work with Nathanaël Fijalkow, FSTTCS · Optimal Bounds in Parametric LTL Games · TCS Down the Borel Hierarchy: Solving Muller Games via ...
Sophie Pinchinat Publications - Irisa
people.irisa.fr
Emptiness of alternating tree automata using games with imperfect information: Nathanaël Fijalkow, Sophie Pinchinat and Olivier Serre: FSTTCS 2013, IARCS ...
Business Profiles
Nathanaël Fijalkow - Publications - ResearchGate
www.researchgate.net
Krishnendu Chatterjee, Nathanaël Fijalkow. [Show abstract] [Hide abstract] ABSTRACT: We study two-player zero-sum games over infinite-state graphs with ...
Projects
HOL theorem-proving system / Mailing Lists - SourceForge
sourceforge.net
... Parameterized Complexity of Chosen Problems for Finite Automata on Trees Krishnendu Chatterjee, Nathanaël Fijalkow: Finitary Languages ...
Books & Literature
Automata, Languages, and Programming: 39th International ...
books.google.de
We would like to thank Nathanaël Fijalkow, Bartek Klin, and the anonymous referees for their comments and suggestions. References 1. Bojanczyk, M., Braud, L.
Automated Technology for Verification and Analysis: 12th ...
books.google.de
ACME: Automata with Counters, Monoids and Equivalence (Tool Paper) Nathanaël Fijalkow and Denis Kuperberg Modelling and Analysis of Markov Reward ...
Language and Automata Theory and Applications: 5th ...
books.google.de
... Shallit Finitary Languages Krishnendu Chatterjee and Nathanaël Fijalkow The Complexity of Request-Response Games .
Mathematical Foundations of Computer Science 2014: 39th ...
books.google.de
256 Kord Eickmeyer, Michael Elberfeld, and Frederik Harwath Two Recursively Inseparable Problems for Probabilistic Automata Nathanaël Fijalkow, ...
Related Documents
[ ] What is known about the Value 1 Problem for ...
arxiv.org
From: Nathanael Fijalkow [view email] [v1] Mon, 13 Oct :40:22 GMT (16kb). Which authors of this paper are endorsers? | Disable ...
Deciding the Value 1 Problem for Probabilistic Leaktight ...
dl.acm.org
Deciding the Value 1 Problem of Probabilistic. Leaktight Automata. Nathanaël Fijalkow. LIAFA,. Université Denis Diderot-Paris 7, France.
[ ] Profinite Techniques for Probabilistic ...
arxiv.org
Submission history. From: Nathanael Fijalkow [view email] [v1] Tue, 13 Jan :28:30 GMT (53kb,D) [v2] Fri, 30 Jan :35:06 GMT ...
List of the (abstracts of the) talks1 - Cirm
www.cirm-math.fr
Nathanaël FIJALKOW: Profinite Techniques for Probabilistic Automata. We consider probabilistic automata over finite words, and develop a profinite theory for ...
Scientific Publications
LICS - Archive
lics.rwth-aachen.de
Nathanaël Fijalkow. Paper: Nathanaël Fijalkow Hugo Gimbert Youssouf Oualhadj Deciding the Value 1 Problem for Probabilistic Leaktight Automata (LICS ...
dblp: Nathanaël Fijalkow
dblp.uni-trier.de
Compiled list of computer science publications by Nathanaël Fijalkow.
Jewels of Automata: from Mathematics to Applications
www.automatha.uni-leipzig.de
Nathanaël Fijalkow (Paris). Ines Klimann (Paris). Dexter Kozen (Ithaca). Dietrich Kuske (Ilmenau). Ranko Lazic (Warwick). Kim Larsen (Aalborg). Markus Lohrey ...
WATA – List of Participants
wwwtcs.inf.tu-dresden.de
... Germany); Sigrid Ewert (Johannesburg, South Africa); Uli Fahrenberg (Rennes, France); Ina Fichtner (Leipzig, Germany); Nathanaël Fijalkow (Paris, France) ...
Publications
Parity and Streett Games with Costs : Nathanaël Fijalkow ...
archive.org
We study two-player games played on finite graphs equipped with costs on edges and introduce two winning conditions, cost-parity and cost-Streett, which...
FreeSearch/DBLP: by:"Nathanaël Fijalkow" Source:DBLP
dblp.kbs.uni-hannover.de
Use can use the facets on the left to filter publications. You might want to see more details about: Nathanaël Fijalkow. 20 results for by:"Nathanaël Fijalkow".
automataseminar - Changes - Wikispaces
automataseminar.wikispaces.com
Nathanaël Fijalkow FM-theory. Graphs games. Boundedness problems. Symptoms of depression. Another symptom of depression. (view changes). 7:21 am.
CORE: Connecting Repositories
core.ac.uk
Deciding the Value 1 Problem of Probabilistic Leaktight Automata. By Nathanaël Fijalkow, Hugo Gimbert and Youssouf Oualhadj ...
Reports & Statements
Un article d'Eléonore Hamaïde : La représentation des ...
inventeursdelectures.over-blog.com
Nathanaël Fijalkow écrit dans la dernière phrase du livre, qu'il me pardonne de le citer, sa phrase est si belle : « La mémoire n'est pas ce qui ...
Miscellaneous
Nathanaël Fijalkow - Google Scholar Citations
scholar.google.com
Cancel. Nathanaël Fijalkow. LIAFA and University of Warsaw. First interest, Second interest, ... Verified email at liafa.univ-paris-diderot.fr - Homepage · Scholar.
Nathanaël Fijalkow - Trích dẫn của Google Scholar
scholar.google.com.vn
Proceedings of LICS'2012 (the th Annual IEEE/ACM Symposium on Logic ...Parity and Streett Games with Costs. N Fijalkow, M ...
Denis Kuperberg - Google Scholar-sitater
scholar.google.co.uk
MedforfattereSe alle… Orna Kupferman,; Peter Dybjer,; Michał Skrzypczak,; Udi Boker,; Nathanaël Fijalkow,; Shaull Almagor ...
Nathanaël FIJALKOW - liafa
www.liafa.univ-paris-diderot.fr
I am a third-year PhD student jointly advised by Mikołaj Bojańczyk (Institute of Informatics, Warsaw University) and Thomas Colcombet (LIAFA, Université Paris
A reduction from parity games to simple stochastic ARiSE
arise.or.at
A reduction from parity games to simple stochastic games (bibtex). by Krishnendu Chatterjee, Nathanaël Fijalkow. View PDF. Reference: A reduction from parity ...
Algorithmic Game Theory | CWI Amsterdam | Research in ...
www.cwi.nl
... summer 2010); Arantza Estévez-Fernández ( till ); Florian Horn ( till ); Nathanaël Fijalkow (internship, summer ...
Hugo Gimbert - Google Scholar Citations
scholar.google.nl
MedeauteursAlle weergeven… youssouf oualhadj,; Nathanaël Fijalkow,; Krishnendu Chatterjee,; Thomas Brihaye · Titel1–20, Geciteerd ...
Merged citations - Google
scholar.google.com.my
Co-authorsView all… youssouf oualhadj,; Nathanaël Fijalkow,; Krishnendu Chatterjee,; Thomas Brihaye · Title1–20, Cited by, Year ...
youssouf oualhadj - Citations Google Scholar
scholar.google.be
CoauteursTout afficher… Hugo Gimbert,; Nathanaël Fijalkow,; Krishnendu Chatterjee,; Ocan Sankur,; Pierre-Alain Reynier ...
BibSonomy :: publication :: A Class of Probabilistic Automata ...
www.bibsonomy.org
A Class of Probabilistic Automata with a Decidable Value 1 Problem. Nathanaël Fijalkow, Hugo Gimbert, and Youssouf Oualhadj. CoRR (2011) ...
CONCUR | Young Researchers Workshop
www.win.tue.nl
Nathanaël Fijalkow (IST Austria, AT and ENS Cachan, FR). 14:40-15:05, Inference and Abstraction of the Biometric Passport. Fides Aarts ...
CSL Torino: accepted papers
csl13.di.unito.it
Krishnendu Chatterjee and Nathanaël Fijalkow. Infinite-state games with finitary conditions. Ranald Clouston, Rajeev Goré and Alwen Tiu.
youssouf oualhadj - Google विद्वान उद्धरण
scholar.google.co.in
सह-लेखकसभी देखें… Hugo Gimbert,; Nathanaël Fijalkow,; Krishnendu Chatterjee,; Ocan Sankur,; Pierre-Alain Reynier ...
Cost-Parity and Cost-Streett Games. - BibSonomy
www.bibsonomy.org
Nathanaël Fijalkow, and Martin Zimmermann FSTTCS, volume 18 of LIPIcs, page Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2012) ...
Deciding the Value 1 Problem of Probabilistic Leaktight ...
hal.cirad.fr
Deciding the Value 1 Problem of Probabilistic Leaktight Automata. Nathanaël Fijalkow 1, 2 Hugo Gimbert 3 Youssouf Oualhadj 3. Détails.
Department of Computer Science, University of Oxford: TBC
www.cs.ox.ac.uk
TBC. Nathanael Fijalkow (LIAFA, Universite Paris Diderot). Info. Date. 3rd June (week 6, Trinity Term 2015). Time. 11:00. Place. Lecture Theatre B, Wolfson ...
EPTCS: A reduction from parity games to simple stochastic ...
eptcs.web.cse.unsw.edu.au
Krishnendu Chatterjee (Institute of Science and Technology (IST Austria)), Nathanaël Fijalkow (Institute of Science and Technology (IST ...
FSTTCS Accepted Papers
www.fsttcs.org
Scheduling with Setup Costs and Monotone Penalties; Nathanael Fijalkow and Martin Zimmermann. Cost-Parity and Cost-Streett Games; Andreas Krebs and ...
Finitary Languages (bibtex) - ARiSE
arise.or.at
by Krishnendu Chatterjee, Nathanaël Fijalkow. View PDF. Reference: Finitary LanguagesKrishnendu Chatterjee, Nathanaël FijalkowLATA, pages , ...
Games Accepted Contributions
www.games.unina.it
ω-Regular Trace Languages: Classification and Synthesis; Nathanaël Fijalkow and Martin Zimmermann: Cost-Parity and Cost-Streett Games; Yaron Velner:
Related search requests for Nathanaël Fijalkow
Krishnendu Chatterjee Martin Zimmermann Andrew Zemke | Florian Horn Alexandru Tomescu Thomas Brihaye | Olivier Serre Thomas Colcombet |
People Forename "Nathanaël" (41) Name "Fijalkow" (2) |
sorted by relevance / date