• 2013-02-26Digital Morphogenesis via Schelling segregation
• 2013-01-14Effective Methods for Concurrent Program Debugging
• 2012-12-18Foreseeing the Unseen: Probability Estimation over Large Alphabets
• 2012-12-12Revisiting finite automata and their relation with languages and circuits
• 2012-12-03Progress on Algorithmic randomness
• 2012-11-05A Role for Mereology in Domain Science and Engineering – to every mereology there corresponds a lambda-expression
• 2012-11-05Verification of Artifact-Centric Multi-Agent Systems
• 2012-10-31Random Polynomials and Expected Complexity of Real Solving
• 2012-10-29GNU TeXmacs, a scientific editing platform
• 2012-10-16Exponential Lower Bounds for the PPSZ k-SAT Algorithm
• 2012-10-11Basics of Research Studies that They Don’t Teach You at the Graduate School
• 2012-10-09Experimental Program Analysis
• 2012-10-08Termination of higher-order rewrite systems using the notion of computability closure
• 2012-09-17Presentation Techniques at International Conferences
• 2012-09-17Modular discrete time approximations of distributed hybrid automata
• 2012-09-04Pervasive Model Checking
• 2012-08-10Equality to Equals and Unequals: A Revisit of the Equivalence and Nonequivalence Criteria in Class-Level Testing of Object-Oriented Software
• 2012-08-06Bisimulations Meet PCTL Equivalences for Probabilistic Automata
• 2012-07-24Decimals of Pi: An example in verified programming about mathematics
• 2012-07-23A Calculational Framework for Parallel Programming with MapReduce