<--- Back to Details
First PageDocument Content
Symposium on Theoretical Aspects of Computer Science / Logic in computer science / International Colloquium on Automata /  Languages and Programming / Fundamenta Informaticae / IEEE Symposium on Logic in Computer Science / Lecture Notes in Computer Science / Workshop on Logic /  Language /  Information and Computation / Theoretical computer science / Applied mathematics / Computer science
Date: 2012-01-12 19:14:06
Symposium on Theoretical Aspects of Computer Science
Logic in computer science
International Colloquium on Automata
Languages and Programming
Fundamenta Informaticae
IEEE Symposium on Logic in Computer Science
Lecture Notes in Computer Science
Workshop on Logic
Language
Information and Computation
Theoretical computer science
Applied mathematics
Computer science

Curriculum Vitae ´ ski Damian Niwin JanuaryCurrent Position

Add to Reading List

Source URL: www.mimuw.edu.pl

Download Document from Source Website

File Size: 58,65 KB

Share Document on Facebook

Similar Documents

Sorting algorithms / Order theory / Mathematics / Combinatorics / Quicksort / Shellsort / Insertion sort / Merge sort / Adaptive sort / Factorial / Time complexity / Heapsort

Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view

DocID: 1xVR3 - View Document

Theoretical computer science / Theory of computation / Computability theory / Mathematics / Turing machine / Alan Turing / Models of computation / Ambient calculus / Turing completeness / Halting problem / Computability / Reduction

Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗

DocID: 1xUAX - View Document

Formal languages / Mathematics / Language / Combinatorics / Context-free language / Regular language / Context-free grammar / Kleene star / Regular expression / Omega-regular language / Complementation of Bchi automaton

Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs

DocID: 1xUr4 - View Document

Computational complexity theory / Theoretical computer science / Logic in computer science / Complexity classes / Mathematical optimization / Boolean algebra / NP-complete problems / Boolean satisfiability problem / 2-satisfiability / Horn-satisfiability / P versus NP problem / Exponential time hypothesis

Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen

DocID: 1xTuz - View Document

CS 153 Current Topics in Theoretical Computer Science Spring 2016

DocID: 1vryF - View Document