University of Birmingham theoretical computer science seminar

computer science theory Mathematics

Audience:	Researchers in the topic
Seminar series time:	Friday 12:00-13:00 in your time zone, UTC
Organizers:	Namrata, Pouya Partow
	*contact for this listing

Meeting ID: 818 7333 5084 ~ Password: 217

Upcoming talks

Past talks

Your time			Speaker	Title
Fri	Jun 12	12:00	Dichuan Gao	Graphical Algebraic Geometry: From Ideals and Varieties to Quantum Calculi

Embed this schedule

Your time			Speaker	Title
Fri	Jun 05	12:00	Adithya Diddapur	Unit Interval Selection in Random Order Streams
Fri	May 29	12:00	Pedro Nora	Good Notions of Bisimulation
Fri	May 22	12:00	Guy McCusker	Interaction Improvement
Fri	May 15	14:30	Rahul Santhanam	The Complexity of Explicit Constructions
Fri	Apr 10	12:00	Dmitriy Zhuk	Quantified Constraint Satisfaction Problem: Towards the classification of complexity
Fri	Mar 27	13:00	Nicholas Pischke	An overview of proof mining and probability theory
Fri	Mar 20	13:00	Silvia Butti	The Weisfeiler–Leman Dimension of Relational Database Queries
Fri	Mar 13	13:00	Pedro Azevedo De Amorim	A 2-categorical theory of logical relations
Fri	Mar 06	13:00	Mrudula Balachander	Towards practical synthesis based on automata learning and succinct representations
Fri	Feb 27	13:00	Elaine Pimentel	Bilateralism with incompatible proofs and refutations
Fri	Feb 20	13:00	Nihil Shah	No-go theorems for distributive laws: directed containers vs. uniform sampling
Fri	Feb 13	13:00	Alex Rice	A continuation monad for quantum effects in recursive programs
Fri	Feb 06	13:00	Giacomo Tendas	Logic internal to a monoidal closed category
Fri	Jan 30	13:00	Sandra Kiefer	Long-Refinement Graphs
Fri	Jan 23	13:00	Fernando Lucatelli Nunes	Eilenberg–Moore, Kleisli and Descent Factorizations
Fri	Dec 12	14:00	Alyssa Renata	Stone Duality for Monads
Fri	Dec 05	14:00	Dimitrios Economou	Focusing is CBPV but CBPV is almost focusing
Fri	Nov 28	14:00	Anupam Das	Right-linear structures: decomposing the theory of (omega-)regular languages via fixed points
Fri	Nov 21	14:00	Paul Taylor	A Categorical Replacement for Replacement
Fri	Nov 14	14:00	Martin Costa	Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time
Fri	Nov 07	14:00	Matteo Acclavio	Dealing with Concurrency in Dynamic Logic
Fri	Oct 31	14:00	Bruno Cavalar	Monotone Circuit Complexity of Matching
Fri	Oct 24	13:00	Ohad Kammar	Modular abstract syntax trees (MAST) – substitution tensors with second-class sorts
Fri	Oct 17	13:00	Jim de Groot	Intuitionistic monotone modal logic
Fri	Oct 10	13:00	Tikhon Pshenitsyn	First-order linear logic and graph languages
Fri	Oct 03	14:30	Thomas Sauerwald	Balanced Allocations: The Power of Choice versus Noise
Fri	Oct 03	13:00	Nachi Valliappan	Lax modal lambda calculi
Fri	Sep 26	13:00	Antonio Lorenzin	Categories of abstract and noncommutative measurable spaces
Fri	Jun 27	13:00	Guillaume Munch-Maccagnoni	Resource management in programming, call-by-push-value, and ordered logic
Fri	Jun 20	13:00	Parinya Chalermsook	Extremal Combinatorics Meets Algorithms and Data Structures
Fri	Jun 06	13:00	Nikhil Mande	On Kings in Tournaments
Fri	May 30	13:00	Dylan McDermott	Notions of presentation for graded monads
Fri	May 23	13:00	Sayan Bhattacharya	Vizing's Theorem in Near-Linear Time
Fri	May 16	13:00	Rahaleh Jalali	Skolemization and the logic of quantifier shifts
Fri	May 09	13:00	Geoff Sutcliffe	The TPTP World - Infrastructure for Automated Reasoning
Fri	Apr 04	13:00	Rodrigo Nicolau Almeida	Heyting algebras one step at a time
Fri	Mar 28	14:00	Vincent Moreau	Profinite lambda-terms and higher-order regular languages
Fri	Mar 21	14:00	Caterina Viola	Algebraic Approach to Approximation
Fri	Mar 07	14:00	Mario Román	String Diagrams for Premonoidal Categories
Fri	Feb 28	14:00	Matthew Alan Le Brun	Multiparty Session Types with a Bang!
Fri	Feb 21	14:00	Karteek Sreenivasaiah	Unconditional lower bounds for Orthogonal Vectors
Fri	Feb 14	14:00	Rini Banerjee	Fulminate: Testing CN Separation-Logic Specifications in C
Fri	Feb 07	14:00	Daniel Hausmann	Infinite-duration Games in Formal Methods
Fri	Jan 31	14:00	John Sylvester	Adjacency Labeling Schemes for Small Classes
Fri	Jan 24	14:00	Laura Bocchi	Asynchronous Session Subtyping by Trace Relaxation
Fri	Dec 13	14:00	Morgan Rogers	Topoi with enough points
Fri	Dec 06	14:00	Amin Karamlou	Quantum relaxations of CSP and structure isomorphism
Fri	Nov 29	14:00	Sebastian Enqvist	Computational content of classical cyclic proofs
Fri	Nov 22	14:00	Luca Reggio	Resource-bounded logics: a categorical and modal view
Fri	Nov 15	14:00	Sergey Goncharov	Introduction to Higher-Order Mathematical Operational Semantics
Fri	Nov 08	14:00	Giovanni Soldà	A proof of Nash-Williams theorem in ATR0
Fri	Nov 01	14:00	Soumyajit Paul	Drinking is not good for driving, nor for computation : complexity of solving games with imperfect information
Fri	Oct 25	13:00	Sky Wilshaw	New Foundations: the story of a large formalisation project
Fri	Oct 18	13:00	Daniel Gratzer	On synthetic category theory in homotopy type theory
Fri	Oct 11	13:00	Tamio-Vesa Nakajima	Bipartite versus triangle-free subgraphs
Fri	Oct 04	13:00	Christian Konrad	Maximal Matching in Bounded-deletion Streams
Fri	Sep 27	13:00	Arkadev Chattopadhyay	The Power of Randomness in Query and Communication
Thu	Sep 19	10:00	Stepan Kuznetsov	Substructural logics with Kleene star
Fri	Jun 07	10:00	Wilmer Ricciotti	Syntactic representation of program execution history
Fri	May 31	10:00	Ambroise Lafont	A diagram editor to mechanise categorical proofs
Fri	May 24	10:00	Sam van Gool	Deciding unifiability by folding coalgebras
Fri	May 17	10:00	Calum Hughes	Models of Martin-Löf Type Theory and Algebraic Model Structures
Fri	May 10	10:00	Andrew Sogokon	Inductive Invariants in Continuous Systems
Fri	Apr 26	10:00	Paul Taylor	Free algebras for functors, with not an ordinal in sight
Fri	Apr 19	10:00	Pablo Donato	Deep Inference for Graphical Theorem Proving
Thu	Apr 18	10:00	Hugo Ferée	Mechanised uniform interpolation for modal logics K, GL and iSL
Fri	Mar 22	11:00	Cristina Matache	Parameterized algebraic theories and applications
Mon	Mar 18	13:00	Igor Carboni Oliveira	Polynomial-Time Pseudodeterministic Construction of Primes
Fri	Mar 15	11:00	Leo Lobski	Towards functorial chemistry: completeness and universality for reaction representation
Fri	Mar 08	11:00	Charles Grellois	Semantic approaches to verification of functional programs
Fri	Mar 01	11:00	Nesta van der Schaaf	Ordered Locales
Fri	Feb 23	11:00	Alex Kavvos	Two-dimensional Kripke Semantics
Fri	Feb 16	11:00	Dylan Braithwaite	Probabilistic Programming with Session Types
Fri	Feb 09	11:00	Satoshi Kura	Higher-Order Weakest Precondition Transformers via a CPS Transformation
Fri	Feb 02	11:00	Tomáš Jakl	Feferman–Vaught–Mostowski theorems and game comonads
Fri	Jan 26	11:00	Jeremy Gibbons	Turner, Bird, Eratosthenes: An Eternal Burning Thread

Embed this schedule

Export series to