The INI has a new website!

This is a legacy webpage. Please visit the new site to ensure you are seeing up to date information.

Skip to content

LAA Seminar List

for period 9 January to 7 July 2006

Monday 09 January
09:00-10:00 Otto, M (Technische Universitat Darmstadt)
  Model theoretic methods for special classes of (finite) structures Satellite
10:00-11:00 Kujipers, B (Hasselt)
  Topological queries - topological invariants and query languages Satellite
11:00-12:00 Van de Bussche, J (Hasselt)
  Logical aspects of spatial databases Satellite
13:00-14:00 Macpherson, D (Leeds)
  Asymptotics of definable sets in finite structres Satellite
14:00-15:00 Wilke, T (Christian-Albrechts)
  Logics, automata, and finite semigroups Satellite
15:00-16:00 Walukiewicz, I (CNRS)
  Towards understanding tree languages - part 1 Satellite
16:00-17:00 Djordjevic, M (Uppsala)
  Connections between finite and infinite model theory Satellite
17:00-18:00 Etessami, K (Edinburgh)
  Analysis of recursive Markov chains, recursive Markov decision processes, and recursive stochastic games Satellite
Tuesday 10 January
13:00-14:00 Elwes, R (Leeds)
  Asymptotics of definable sets in finite structures Satellite
15:00-16:00 Walukiewicz, I (CNRS)
  Towards understanding tree languages - part 2 Satellite
Wednesday 11 January
13:00-14:00 Macpherson, D (Leeds)
  Asymptotics of definable sets in finite structures Satellite
Thursday 12 January
11:00-12:00 Rubin, S (Auckland)
  Classifying automatic structures Satellite
12:00-13:00 Schweikardt, N (Humboldt)
  (Finite) model theory of tree and tree-like structures Satellite
13:00-14:00 Kreutzer, S (Humboldt)
  (Finite) model of tree and tree-like structures Satellite
Friday 13 January
17:00-18:00 Bodirsky, M (Humboldt)
  The algebraic approach to infinite-valued constraint satisfaction Satellite
Thursday 19 January
11:00-12:00 Marcinkowski, J (Wroclaw)
  On the selectivity of a semantic subsumption index Sem 1
Tuesday 24 January
11:00-12:00 Alechina, N (Nottingham)
  Epistemic logics for time and space bounded reasoning Sem 1
Thursday 26 January
11:00-12:00 Bulatov, A (Simon Fraser)
  Complexity of constraint problems via polymorphisms Sem 1
Tuesday 31 January
11:00-12:00 Valeriote, M (McMaster)
  Tractable constraint languages arising from some algebras that generate congruence distributive varieties Sem 1
Thursday 02 February
11:00-12:00 Ong, L (Oxford)
  Game semantics and its algorithmic applications: Part I Sem 1
Friday 03 February
11:00-12:00 Cook, B (Microsoft Research)
  Automatically proving the termination of C programs Sem 1
Monday 06 February
11:00-12:00 Atserias, A (Politecnica de Catalunya)
  Non-uniform hardness for NP via black-box adversaries Sem 1
Tuesday 07 February
11:00-12:00 Ong, L (Oxford)
  Game semantics and its algorithmic applications: Part II Sem 1
Thursday 09 February
11:00-12:00 Ong, L (Oxford)
  Game semantics and its algorithmic applications: Part III Sem 1
16:00-17:00 Atserias, A (Politecnica de Catalunya)
  Part II on hardness for NP Informal Discussion DS
Monday 13 February
11:00-12:00 Kupferman, O (Hebrew University of Jerusalem)
  Avoiding determinization Sem 1
Tuesday 14 February
11:00-12:00 Ong, L (Oxford)
  Game semantics and its algorithmic applications: Part IV Sem 1
Wednesday 15 February
11:30-12:30 Hella, L (Tampere)
  Complete problems for higher order logics Sem 1
Thursday 16 February
11:00-12:00 Ong, L (Oxford)
  Game semantics and its algorithmic applications: Part V Sem 1
Friday 17 February
11:00-12:00 Markstrom, K (Umea)
  A class of SAT-instances which are hard for resolution based SAT-solvers Sem 1
Monday 20 February
11:00-12:00 Chen, H (Pompeu Fabra)
  The computational complexity of quantified constraint satisfaction Sem 1
Tuesday 21 February
11:00-12:00 Cardelli, L (Microsoft)
  Biological systems as reactive systems Sem 1
Wednesday 22 February
11:00-12:00 Arratia-Quesada, A (Valladolid)
  Syntactic vs. semantic approximations to logics that capture complexity classes Sem 1
Thursday 23 February
11:00-12:00 Dalmau, V (Pompeu Fabra)
  Beyond Hypertee Width: Decomposition methods without decompositions Sem 1
Friday 24 February
11:00-12:00 Hella, L (Tampere)
  Complete problems for higher order logics Sem 1
Monday 27 February
09:30-11:00 Neven, F (Limburg)
  The automaton approach to XML schema languages: from practice to theory Sem 1
11:30-12:30 Suciu, D (Washington)
  Probabilities in databases and in logics I Sem 1
14:00-15:00 Kolaitis, P (IBM Almladen)
  Foundations of Schema mappings I Sem 1
15:30-16:15 Sazonov, V (Liverpool)
  Querying hyperset/web-like databases Sem 1
16:15-17:00 Lynch, J (Clarkson)
  Concentration bounds for Markov processes of metafinite models Sem 1
17:00-17:45 Marx, M (Amsterdam)
  XPath with transitive closure Sem 1
Tuesday 28 February
09:30-10:15 Bertossi, L (Carleton)
  Cardinality-based semantics for consistent query answering: incremental and parameterized complexity Sem 1
10:15-11:00 Gottlob, G (Oxford)
  Computational problems of data exchange Sem 1
11:30-12:30 Suciu, D (Washington)
  Probabilities in databases and in logics II Sem 1
14:00-15:00 Kolaitis, P (IBM Almladen)
  Foundations of Schema mappings II Sem 1
15:30-16:15 Gardner, P (Imperial College London)
  Context logic and tree update Sem 1
16:15-17:00 Katz, M (Haifa)
  Approximation logic and databases Sem 1
17:00-17:45 Lindell, S (Haverford College)
  A normal form for singulary logic over physically realizable data models Sem 1
Wednesday 01 March
09:15-10:15 Koch, C (Saarlandes)
  Queries on tree-structured data: Logical languages and complexity Sem 1
10:15-11:00 Beeri, C (Hebrew)
  BPQL - A query language for business processes Sem 1
11:30-12:30 Segoufin, L (INRIA)
  Pebble tree walking automata and TC-logics on trees Sem 1
Thursday 02 March
09:15-10:15 Schweikardt, N (Berlin)
  The complexity of processing data streams and external memory data I Sem 1
10:15-11:00 Calvanese, D (Bozen-Bolzano)
  Ontology mediated data management Sem 1
11:30-12:30 Vianu, V (California, San Diego)
  Automatic verification of communicating data-aware web services Sem 1
14:00-15:00 Libkin, L (Toronto)
  Database normalization revisited: an information-theoretic approach Sem 1
15:30-16:15 Szeider, S (Durham)
  On the clique-width of graphs Sem 1
16:15-17:00 Alechina, N (Nottingham)
  Complete axiomatisation for PDLpath Sem 1
17:00-17:45 Arenas, M (PUC Chile)
  Locally consistent transformations and query answering in data exchange Sem 1
Friday 03 March
09:15-10:15 Schweikardt, N (Berlin)
  The complexity of processing data streams and external memory data Sem 1
10:15-11:00 Barcelo, P (Toronto)
  Temporal logics for n-ary queries over XML documents Sem 1
11:30-12:30 Grohe, M (Humboldt-Universitat zu Berlin)
  Law enforcement on hypergraphs Sem 1
Monday 06 March
11:00-12:00 Krokhin, A (Durham)
  Constraint satisfaction problems and dualities Sem 1
Tuesday 07 March
11:00-12:00 Krajicek, J (Prague)
  Basic proof complexity I Sem 1
Wednesday 08 March
11:00-12:00 Steinhorn, C (Vassar)
  On asymptotic classes of finite structures Sem 1
Thursday 09 March
11:00-12:00 Krajicek, J (Prague)
  Basic proof complexity II Sem 1
Friday 10 March
11:00-12:00 Griffin, T (Cambridge)
  Metarouting: An algebraic approach to defining routing protocols Sem 1
Monday 13 March
11:00-12:00 Kun, G (Eotvos)
  CSP and MMSNP are computationally equivalent Sem 1
Tuesday 14 March
11:00-12:00 Krajicek, J (Prague)
  Basic proof complexity III Sem 1
Wednesday 15 March
11:00-12:00 Hell, P (Simon Fraser)
  Graph partitions Sem 1
Thursday 16 March
11:00-12:00 Krajicek, J (Prague)
  Basic proof complexity IIII Sem 1
Friday 17 March
11:00-12:00 Goranko, V (Witwatersrand)
  Infinite state model checking in modal logic Sem 1
14:15-15:15 Vardi, M (Rice)
  Logic and Algorithms Sem 1
Monday 27 March
11:00-12:00 Szeider, S (Durham)
  Fixed-parameter algorithms for propositional satisfiability and constraint satisfaction Sem 2
Tuesday 28 March
11:00-12:00 Nesetril, J (Charles)
  Small extensions Sem 2
Thursday 30 March
11:00-12:00 Fisler, K (Worcester Polytechnic Institute)
  Verification and change-impact analysis of access-control policies Sem 2
Monday 03 April
11:00-12:00 Milner, R (Cambridge)
  Ubiquitous computing: shall we understand it? Sem 2
Tuesday 04 April
11:00-12:00 Kreutzer, S (Humboldt)
  Approximation schemes for first-order definable optimisation problems Sem 2
Thursday 06 April
11:00-12:00 Vorobyov, S (Uppsala)
  Games as controlled optimization problems Sem 2
Friday 07 April
11:00-12:00 Hodges, W (QMUL)
  The semantics of modularity Sem 2
Monday 10 April
10:00-11:00 Pudlak, P (Academy of Sciences, Prague)
  $On \forall\Sigma_1^b$ sentences provable in bounded arithmetic Sem 1
11:30-12:00 Nguyen, P (Toronto)
  The complexity of proving the discrete Jordan Curve theorem and related principles Sem 1
12:00-12:30 Beckmann, A (Wales)
  Uniform proof complexity Sem 1
14:00-15:00 Thapen, N (Academy of Sciences, Prague)
  $T^1_2, T^2_2$ and search problems Sem 1
15:30-16:00 Jerabek, E (Toronto)
  Approximate counting in bounded arithmetic Sem 1
16:00-16:30 Pollett, C (San Jose State University)
  When can $S^1_2$ prove the weak pigeonhole principle? Sem 1
Tuesday 11 April
09:30-10:30 Cook, S (Toronto)
  Capturing complexity classes by their reasoning power Sem 1
10:30-11:00 Vardi, M (Rice )
  Constraint propagation as a proof system Sem 1
11:30-12:00 Soltys, M (McMaster)
  The proof complexity of matrix algebra Sem 1
12:00-12:30 Perron, S (Toronto)
  A minimal quantified proof system for polytime reasoning Sem 1
14:00-15:00 Impagliazzo, R (California, San Diego)
  Which SAT instances are the hardest? Sem 1
15:30-16:00 Riis, S (London)
  Sporadic propositional proofs Sem 1
16:00-16:30 Galesi, N (Rome)
  Resolution by pebbling games Sem 1
Wednesday 12 April
09:30-10:30 Pitassi, T (Toronto)
  Using lower bounds in proof complexity Sem 1
10:30-11:00 Nordstrom, J (Royal Institute of Technology, Stockholm)
  Narrow proofs may be spacious: separating space and width in resolution Sem 1
11:30-12:30 Segerlind, N (Washington)
  Connections between zero-one programming, communication complexity and proof complexity Sem 1
Thursday 13 April
09:30-10:30 Tzameret, I (Tel Aviv)
  The strength of multilinear proofs Sem 1
10:00-10:30 Bonet, ML (Barcelona)
  A complete resolution-like calculus for Maxsat Sem 1
11:30-12:30 Dantchev, S (Durham)
  Parametrised proof complexity Sem 1
14:00-14:30 Naumov, P (McDaniel College)
  Meta complexity of propositional proofs Sem 1
14:30-15:30 Alekhnovich, M (California, San Diego)
  On the power of Lovasz-Schrijver hierarchy Sem 1
Tuesday 18 April
11:00-12:00 Brihaye, T (Mons-Hainault)
  O-minimal hybrid systems, bisimulation and control Sem 1
Thursday 20 April
11:00-12:00 Krajicek, J (Czech Academy of Sciences)
  Forcing with random variables and complexity of computations and proofs Sem 1
Friday 21 April
11:00-12:00 Vaananen, J (Helsinki)
  Team logic Sem 1
Monday 24 April
11:00-12:00 Pudlak, P (Czech Academy of Sciences)
  On lower bounds in non-classical logics Sem 1
Tuesday 25 April
11:00-12:00 Kreutzer, S (Humboldt)
  Graph searching games and graph decompositions I Sem 1
Wednesday 26 April
11:00-12:00 Dantchev, S (Durham)
  Complexity gaps for resolution-based proof systems Sem 1
Thursday 27 April
11:00-12:00 Kreutzer, S (Humboldt)
  Graph searching games and graph decompositions II Sem 1
Tuesday 02 May
11:00-12:00 Kreutzer, S (Humboldt)
  Graph searching games and graph decompositions III Sem 1
Wednesday 03 May
11:00-12:00 Kulesza, K (Cambridge)
  Observations on inverting the VMPC one-way function Sem 1
Thursday 04 May
11:00-12:00 Kreutzer, S (Humboldt)
  Graph searching games and graph decompositions IV Sem 1
Friday 05 May
11:00-12:00 Abdulla, P (Uppsala )
  Confluent Markov chains Sem 1
Monday 08 May
10:00-11:00 Manna, Z (Stanford University)
  From verification conditions to constraints Sem 1
11:30-12:00 Bradley, A (Stanford University)
  Solving verification constraint problems with constraint programming Sem 1
14:00-15:00 Cousot, P (ENS-DI)
  Program verification by parametric abstraction and semi-definite programming Sem 1
15:30-16:00 Fisler, K (Worcester Polytechnic Institute)
  Parameterized interfaces for open system verification of product lines Sem 1
16:00-16:30 Sankaranarayanan, S (NEC Labs America)
  Polyhedral analysis of systems software Sem 1
16:30-17:00 Cook, B (Microsoft Research Cambridge)
  Proving termination of programs Sem 1
Tuesday 09 May
09:00-10:00 Clarke, E (Carnegie Mellon University)
  Bounded and unbounded model checking with SAT Sem 1
10:00-10:30 Kroening, D (ETH Zentrum)
  Model checking C++ programs that use the STL Sem 1
10:30-11:00 Namjoshi, K (Bell Labs)
  Incremental model checking Sem 1
11:30-12:00 Marques-Silva, J (University of Southampton)
  Towards more efficient SAT-based model checking Sem 1
12:00-12:30 Lisitsa, A (Liverpool)
  Uniform + supercompilation = verification Sem 1
14:00-15:00 Cardelli, L (Microsoft Research)
  Artifical Biochemistry Sem 1
15:30-16:00 Dechter, R (University of California)
  Generalizing BDD trees using minimal and/or graphs Sem 1
16:00-16:30 Junker, U (ILOG)
  Return of the JTMS: Preferences orchestrate conflict learning and solution synthesis Sem 1
16:30-17:00 Gupta, A (NEC Labs America)
  Enhancing software model checking with static program analysis Sem 1
17:00-17:30 Leconte, M (ILOG SA)
  State of the art in constraint programming solvers Sem 1
Wednesday 10 May
09:00-10:00 Hanna, Z (Intel Corp)
  Logic verification challenges in system level design at Intel Sem 1
10:00-10:30 Havlicek, J (Freescale Inc)
  Constraints in hardware verification: some industrial perspectives Sem 1
10:30-11:00 Lugiez, D (CMI)
  Symbolic constraint solving for cryptographic protocols Sem 1
11:30-12:00 Grumberg, OG (Technion)
  Automatic refinement and vacuity detection for symbolic trajectory evaluation Sem 1
Thursday 11 May
09:00-10:00 Kwiatkowska, MZ (University of Birmingham)
  Linear constraints in probabilistic model checking Sem 1
10:00-10:30 Jurdzinski, M (University of Warwick)
  Time average games Sem 1
10:30-11:00 Maler, O (Verimag)
  Controller synthesis with adversaries Sem 1
11:30-12:00 Abdullah, P (Uppsala University )
  Language inclusion for timed automata Sem 1
14:00-15:00 McMillan, K (Cadence Berkeley Labs)
  Consequence generation, interpolants and invariant discovery Sem 1
15:30-16:30 Naveh, Y (IBM research Lab in Haifa)
  Constraint satisfaction for random stimuli generation Sem 1
16:30-17:00 Qadeer, S (Microsoft Research)
  Verifying properties of well-founded linked lists Sem 1
17:00-17:30 Bouajjani, A (Paris 7)
  Reasoning about dynamic networks of counter systems Sem 1
Friday 12 May
09:00-10:00 Wolper, P (Universite de Liege)
  On the use of automata for representing arithmetic constraints Sem 1
10:00-10:30 Mitchell, D (Simon Fraser University)
  Modelling with FO(ID); Solving with SAT Sem 1
10:30-11:00 Cotton, S (Verimag)
  Satisfiability modulo theory chains with DPLL(T) Sem 1
11:30-12:00 Sakallah, K (University of Michigan)
  A progressive approach to solving satisfiability modulo theories (SMT) Sem 1
14:00-15:00 Giunchiglia, E (DIST - Universita di Genova)
  State of the art in QBF reasoning, with emphasis on applications in FV Sem 1
15:30-16:30 Amir, E (University of Illinois)
  Compact propositional encodings of first-order theories Sem 1
Monday 15 May
11:00-12:00 Amir, E (Illinois)
  Connecting logic and learning Sem 1
Tuesday 16 May
11:00-12:00 Klaedtke, F (ETH, Zurich)
  Don't care words with an application to the automata-based approach for real addition Sem 1
Wednesday 17 May
11:00-12:00 Kwiatkowska, M (Birmingham)
  Model checking for probabilistic real-time systems Sem 1
Thursday 18 May
11:00-12:00 Piterman, N (EPF Lausanne)
  Solving games without determinization Sem 1
Tuesday 23 May
11:00-12:00 Bouajjani, A (Paris)
  Automata-based techniques for the analysis of dynamic concurrent programs Sem 1
Thursday 25 May
11:00-12:00 Lindell, S (Haverford)
  A physical analysis of mechanical computability Sem 1
Tuesday 30 May
11:00-12:00 Vollmer, H (Hannover)
  Post's lattice with applications to complexity theory (Part I) Sem 1
Thursday 01 June
11:00-12:00 Vollmer, H (Hannover)
  Post's lattice with applications to complexity theory (Part II) Sem 1
Monday 05 June
11:00-12:00 Vollmer, H (Hannover)
  Post's lattice with applications to complexity theory (Part III) Sem 1
Tuesday 06 June
11:00-12:00 Vardi, M (Rice)
  And logic begat computer science: When giants roamed the Earth Sem 1
Thursday 08 June
11:00-12:00 Richerby, D (Athens)
  Choiceless polynomial time Sem 1
Monday 12 June
11:00-12:00 Dawar, A (Cambridge)
  Model theory on well-behaved finite structures Sem 1
Tuesday 13 June
11:00-12:00 Etessami, K (Edinburgh)
  Analysis of recursive Markov chains, recursive Markov decision processes and recursive stochastic games (Part I) Sem 1
Wednesday 14 June
11:00-12:00 Veith, H (TU, Munich)
  Environment abstraction for parameterised systems Sem 1
Thursday 15 June
11:00-12:00 Etessami, K (Edinburgh)
  Analysis of recursive Markov chains, recursive Markov decision processes and recursive stochastic games (Part II) Sem 1
Tuesday 20 June
11:00-12:00 Etessami, K (Edinburgh)
  Analysis of recursive Markov chains, recursive Markov decision processes and recursive stochastic games. Part III. Sem 1
Thursday 22 June
11:00-12:00 Niwinski, D (Warsaw)
  On the complexity of infinite computations Sem 1
Friday 23 June
11:00-12:00 Jurdzinski, M (Warwick)
  A deterministic subexponential algorithm for solving parity games Sem 1
Monday 26 June
11:00-12:00 Mitchell, D (Simon Fraser)
  Modelling in logic; solving with SAT Sem 2
Tuesday 27 June
11:00-12:00 Trefler, R (Waterloo)
  Patterns of compositional reasoning Sem 2
Wednesday 28 June
11:00-12:00 Gastin, P (ENS, Cachan)
  A fresh look at testing for asynchronous communication Sem 2
Thursday 29 June
11:00-12:00 Lynch, JF (Clarkson)
  Models of biological regulatory networks Sem 2
Monday 03 July
09:00-10:25 van Benthem, J (Stanford and Amsterdam)
  Dynamic-epistemic logic of games Sem 1
10:30-10:45 Kaiser, L (RWTH Aachen)
  Game quantification on automatic structures and hierarchical games Sem 1
11:30-12:00 Duparc, J (Universite de Lausanne)
  Towards the Wadge hierarchy of weak alternating tree automata Sem 1
12:00-12:30 Obdrzalek, J (Masaryk University, Brno)
  Are parity games spineless? Sem 1
14:00-14:30 Colcombet, T (IRISA)
  Ramseyan factorisation for trees Sem 1
14:30-14:45 Samuelides, M (Universite Denis Diderot)
  Pebble tree-walking automata Sem 1
14:45-15:00 Barany, V (RWTH Aachen)
  A hierachy of automatically presentable omega-words having a decidable MSO theory Sem 1
15:30-16:00 Janin, D (Universite Bordeaux-1)
  On distributed synthesis of discrete systems Sem 1
16:00-16:30 Esparza, J (Universitaet Stuttgart)
  Solving fixpoint equations in omega-continuous semirings: Some ideas and many questions Sem 1
16:30-17:00 Immerman, N (Massachusetts)
  On size versus number of variables Sem 1
Tuesday 04 July
09:00-10:25 Monderer, D (Technion)
  Mechanism design Sem 1
10:30-11:00 Apt, K (CWI)
  Stable partitions in coalition games Sem 1
11:30-12:00 Zielonka, W (LIAFA - Universite Paris 7)
  From discounting to parity games Sem 1
12:00-12:30 Gimbert, H (Warsaw)
  Positional stochastic games Sem 1
14:00-14:30 Etessami, K (Edinburgh)
  Recursive concurrent stochastic games Sem 1
14:30-15:00 Berwanger, D (Universite Bordeaux-1)
  Backwards induction for games of infinite horizon Sem 1
15:30-16:55 Gottlob, G (Oxford)
  Hypertree decompositions Sem 1
Wednesday 05 July
09:00-10:25 Vardi, M (Rice)
  Games as an algorithmic construct Sem 1
10:30-11:00 Venema, Y (Amsterdam)
  Coalgebra automata Sem 1
11:30-12:00 Froschle, S (Warsaw)
  When is secrecy decidable? Sem 1
12:00-12:15 Horn, F (Laboratoire d'Informatique Algorithmique)
  Finitary parity and streett games Sem 1
12:15-12:30 Lasota, S (Warsaw)
  Faster algorithm for bisimulation equivalence of normed context-free processes Sem 1
Thursday 06 July
09:00-10:25 Alur, R (Pennsylvania)
  Nested words and trees Sem 1
10:30-11:00 Murawski, A (Oxford)
  Game semantics and automata Sem 1
11:30-12:00 Touili, T (LIAFA - Universite Paris 7)
  Verifying concurrent message-passing C programs with recursive calls Sem 1
12:00-12:15 Rozier, K (Rice)
  Algorithms for automata-theoretic linear temporal logic model checking Sem 1
12:15-12:30 Tabakov, D (Rice)
  Experimental evaluation of complementation of non-deterministic Buechi automata Sem 1
14:00-14:30 Jurdzinski, M (Warwick)
  Optimality equations and strategy improvement for average payoff games Sem 1
14:30-14:45 Trivedi, A (Warwick)
  A strategy improvement algorithm for optimal time reachability games Sem 1
14:45-15:00 Krcal, P (Uppsala)
  Communicating timed automata Sem 1
15:30-16:00 Jonsson, B (Uppsala)
  Proving liveness by backwards reachability Sem 1
16:00-16:30 Lange, M (Munich)
  Model checking games for fixpoint logic with Chop Sem 1
Friday 07 July
09:00-10:25 Caucal, D (IRISA - CNRS)
  Deterministic grammars Sem 1
10:30-11:00 Lazic, R (Warwick)
  On LTL with the freeze quantifier and register automata Sem 1
11:30-12:00 Vorobyov, S (Uppsala)
  Are one-player games always simple? Sem 1
12:00-12:30 Walukiewicz, I (Universite Bordeaux-1)
  Tree algebras Sem 1
Other Seminars
Seminars in the University
National and International Scientific Research Meetings

Back to top ∧