Call for Papers
Hilbert’s Epsilon and Tau in Logic, Informatics and Linguistics
Dates: June 10-12, 2015
Location: Montpellier, France
Workshop Webpage: https://sites.google.com/site/epsilon2015workshop/
Contact email: Epsilon2015(a)easychair.org
Submission deadline: April 1st, 2015
Submission webpage: https://easychair.org/conferences/?conf=epsilon2015
Organizers / workshop co-chairs:
Stergios Chatzikyriakidis, LIRMM-CNRS, University of Montpellier
Fabio Pasquali, University of Marseille
…
[View More]Christian Retoré, University of Montpellier & LIRMM-CNRS
Host: I2M-CNRS and University of Montpellier
Workshop information:
This workshop aims at promoting work on Hilbert’s epsilon calculus in a
number of relevant fields ranging from Philosophy and Mathematics to
Linguistics and Informatics. The Epsilon and Tau operators were introduced by
David Hilbert, inspired by Russell's Iota operator for definite descriptions, as
binding operators that form terms from formulae. One of their main features
is that substitution with Epsilon and Tau terms expresses quantification. This
leads to a calculus which is a strict and conservative extension of First Order
Predicate Logic. The calculus was developed for studying first order logic in
view of the program of providing a rigorous foundation of mathematics via
syntactic consistency proofs. The first relevant outcomes that certainly deserve
a mention are the two "Epsilon Theorems" (similar to quantifiers elimination),
the first correct proof of Herbrand’s theorem or the use of the Epsilon
operator in Bourbaki’s Éléments de Mathématique. Nowadays the interest in
the Epsilon substitution method has spread in a variety of fields: Mathematics,
Logic, Philosophy, History of Mathematics, Linguistic, Type Theory, Computer
science, Category Theory and others.
Submission
The workshop welcomes submissions of up to 4 (but not less than 2) pages.
Usual spacing, font and margin should be used (single-spaced, 11pt or larger,
and 1 inch margin on A4 or letter size paper). Abstracts should be submitted
by April 1st, 2015 as pdf files through the EasyChair conference system (
https://easychair.org/conferences/?conf=epsilon2015). An indicative list of
themes that are of particular interest to the conference are (non-exhaustive):
- History of Logic
- Philosophy
- Proof theory
- Model theory
- Category theory
- Type theory
- Quantification in Natural language
- Noun-Phrases Semantics
- Proof Assistants (e.g. Coq, Isabelle, ... )
- Other subnectors (e.g. Russell's iota, μ-operator, ... )
Reviewing:
Abstracts will be reviewed by members of the program committee, and, where
appropriate, outside reviewers. The organizers will be responsible for making
decisions partly in consultation with the program committee. Notifications will
be made by May 1st, 2015.
Post-Proceedings:
Selected papers from the workshop will appear as a special volume in Journal
of Logics and their Applications
Important dates:
April 1st, 2015: Submission deadline
May 1st,2015: Notification of acceptance
June 10-12, 2015: Workshop
Invited speakers:
Claus-Peter Wirth (University of Saarland): The descriptive operators iota, tau
and epsilon - on their origin, partial and complete specification, model-
theoretic semantics, practical applicability (with the support of the Hilbert
Bernays Project (sponsored by IFCoLog)).
Vito Michele Abrusci (University of Roma Tre): Hilbert's tau and epsilon in
proof theory.
Hartley Slater (University of Western Australia): Linguistic and philosophical
ramifications of the epsilon calculus.
Program Committee:
Daisuke Bekki (Ochanomizu University)
Stergios Chatzikyriakidis (LIRMM-CNRS & University of Montpellier)
Francis Corblin (University of Paris-Sorbonne & Institut Jean Nicod CNRS)
Michael Gabbay (University of Cambridge)
Makoto Kanazawa (National Institute of Informatics of Tokyo)
Ruth Kempson (King's College, London)
Alda Mari (CNRS Institut Jean Nicod & ENS & EHESS)
Georg Moser (University of Innsbruck)
Bruno Woltzenlogel Paleo (Vienna University of Technology)
Michel Parigot (CNRS-PPS & University of Paris Diderot 7)
Fabio Pasquali (University of Aix-Marseille & I2M CNRS)
Christian Retoré (University of Montpellier & LIRMM-CNRS)
Mark Steedman (University of Edimburgh)
Richard Zach (University of Calgary)
[View Less]
東京大学の小林と申します。
以下のように、ワルシャワ大学のPawel Parys氏を招いて講演会を開催しますので、
ふるってご参加ください。
Parysさんは、ここ数年、高階文法、高階プッシュダウンオートマトンなどについて
未解決問題を解いたりしてよい仕事をされている方です
小林直樹
東京大学大学院情報理工学系研究科コンピュータ科学専攻
〒113-0033 東京都文京区本郷7-3-1
Phone: 03-5841-4124
Fax: 03-5841-4124
email: koba(a)is.s.u-tokyo.ac.jp
----------------------------------
Time: 2月18日(水) 15:00〜
Place: 理学部7号館 214号室
Title:
A Characterization of Lambda-terms Transforming Numbers
Speaker:
Pawel Parys (Warsaw University)
Abstract:
It is well known, that simply-…
[View More]typed lambda-terms can be used to
represent numbers, as well as some other data types. We show that
lambda-terms of each fixed (but possibly very complicated) type can be
described by a finite piece of information (a set of appropriately
defined intersection types) and by a vector of natural numbers. On
one hand the description is compositional: having only the finite
piece of information for two closed lambda-terms M and N, we can
determine its counterpart for MN, and a linear transformation that
applied to the vectors of numbers for M and N gives us the vector for
MN. On the other hand, when a lambda-term represents a natural
number, then this number is approximated by a number in the vector
corresponding to this lambda-term.
As a consequence, we prove that in a lambda-term of a fixed type we
can store only a fixed number of natural numbers, in such a way that
they can be extracted using lambda-terms. More precisely, while
representing k numbers in a closed lambda-term of some type we only
require that there are k closed lambda-terms M1,...,Mk such that Mi
takes as argument the lambda-term representing the k-tuple, and
returns the i-th number in the tuple (we do not require that, using
lambda-calculus, one can construct the representation of the k-tuple
out of the k numbers in the tuple). Moreover, the same result holds
when we allow that the numbers can be extracted approximately, up to
some error (even when we only want to know whether a set is bounded or
not).
All the results remain true when we allow the Y combinator (recursion)
in our lambda-terms, as well as uninterpreted constants.
[View Less]
Prof. Georg Moser at NII Logic Seminar
Date: February 13, 2015, 14:00--16:00
Place: National Institute of Informatics, Room 1208 (12th floor)
場所: 国立情報学研究所 12階 1208室
(半蔵門線,都営地下鉄三田線・新宿線 神保町駅または東西線 竹橋駅より徒歩5分)
(地図 http://www.nii.ac.jp/about/access/)
Speaker: Prof. Georg Moser (University of Innsbruck)
Title: Amortised Cost Analysis and Term Rewrite Systems
Abstract:
I will present a univariate resource analysis for typed term rewrite
systems based on a potential-based type system. …
[View More]This type system gives
rise to polynomial bounds on the innermost runtime complexity. The
thus obtained amortised resource analysis relates to polynomial
interpretations and we obtain the perhaps surprising result that
whenever a rewrite system can be well-typed, then there exists a
polynomial interpretation that orients the system. If time permits
I'll speak about very recent generalisations to a multivariate
analysis. This is a joint work with Martin Hofmann.
問合せ先:
龍田 真 (国立情報学研究所)
e-mail: tatsuta(a)nii.ac.jp
http://research.nii.ac.jp/~tatsuta
[View Less]
みなさま,
東京大学の蓮尾です.8月にテヘランで行われる国際会議
TTCS の案内をお送りします.ICALP や TCS のように track
A/B に分かれていて,スコープの広い会議です.
ぜひ投稿をご検討ください.
また,お近くの研究者のみなさん(特にこのメールが届かない,
アルゴリズム系のみなさま)にこのメールを転送いただけると
助かります.
どうかよろしくお願いいたします.
蓮尾 一郎
http://www-mmm.is.s.u-tokyo.ac.jp/
(apologies if you receive multiple copies)
=========================================
Topics in Theoretical Computer Science (TTCS 2015)
http://www.ttcs.ir/
Institute for Research in Fundamental Sciences (IPM), Tehran, Iran
August 26-28, 2015
===============…
[View More]==========================
Scope
________________________________
TTCS is a new bi-annual conference series, intending to serve as a
forum for novel and high-quality research in all areas of Theoretical
Computer Science. The conference is held in cooperation with the
European Association for Theoretical Computer Science.
There will be a number of satellite events at TTCS, These will feature
presentation of early research results, and position papers. There
will also be a forum for Ph.D. students to receive comments about
their ongoing research projects.
Topics of interest include but are not limited to:
algebra and co-algebra in computer science,
algorithms and data structures,
algorithmic coding theory,
algorithmic graph theory and combinatorics,
approximation algorithms,
computational complexity,
computational geometry,
computational learning theory,
concurrency theory,
coordination languages,
economics and algorithmic game theory,
fixed parameter algorithms,
formal verification and model-based testing,
logic in computer science,
machine learning
methods, models of computation and reasoning for embedded, hybrid, and
cyber-physical systems,
optimization,
parallel and distributed algorithms,
quantum computing,
randomness in computing,
stochastic and probabilistic specification and reasoning
theoretical aspects of other CS-related research areas, e.g.,
computational science, databases, information retrieval, and
networking,
theoretical cryptography,
theory of programming languages, and
type theory and its application in program verification.
Keynote Speakers
________________________________
Anuj Dawar, Cambridge University, UK
Michael Fellows, Charles Darwin University, Australia
Mehrnoosh Sadrezadeh, Queen Mary University of London, UK
Submission
________________________________
For the main conference, we solicit research papers in all areas of
theoretical computer science. All papers will undergo a rigorous
review process and will be judged based on their originality,
soundness, significance of the results, and relevance to the theme of
the conference.
Papers should be written in English. Research papers should not exceed
15 pages in the LNCS style format. Multiple and/or concurrent
submission to other scientific venues is not allowed and will result
in rejection as well as notification to the other venue. Any case of
plagiarism (including self-plagiarism from earlier publications) will
result in rejection as well as notification to the the authors'
institutions.
Papers should be submitted through our EasyChair submission website:
https://www.easychair.org/conferences/?conf=ttcs2015 . The web site is
open for submissions.
Important Dates
________________________________
Paper Submission: May 15, 2015 (Anywhwere on Earth)
Author notification: June 26, 2015
Camera ready paper due: July 10, 2015
Conference: August 26-28, 2015
Program Committee
________________________________
Track A: Algorithms and Complexity
Mohammad Ali Abam, Sharif University of Technology, Iran
Saeed Akbari, Sharif University of Technology, Iran
Saeed Alaei, Cornell University, USA
Mohammad Hossein Bateni, Google Research, USA
Salman Beigi, IPM, Iran
Amir Daneshgar, Sharif University of Technology, Iran
Fedor Fomin, University of Bergen, Norway
Ali Ghodsi, University of Waterloo, Canada
Mohammad Ghodsi, Sharif University of Technology, Iran
Mohammad T. Hajiaghayi, University of Maryland, USA (Chair)
Amin Karbasi, Yale University, USA
Nicole Immorlica, Microsoft Research, USA
Amit Kumar, IIT Delhi, India
Mohammad Mahdian, Google Research, USA
Hamid Mahini, University of Maryland, USA
Bojan Mohar, Simon Fraser University, Canada
Mohammad Mahmoody, University of Virginia, USA
Vahab Mirrokni, Google Research, USA
Morteza Monemizadeh, Frankfurt University, Germany
Shayan Oveisgharan, UC Berkeley and University of Washington, USA
Debmalya Panigrahi, Duke University, USA
Jorg Sack, Carleton University, Canada
Mohit Singh, Microsoft Research, USA
Dimitrios M. Thilikos, CNRS, France and University of Athens, Greece
Suresh Venkatasubramanian, University of Utah, USA
Jan Vondrak, IBM Almaden Research Center, USA
Track B: Logic, Semantics, and Programming Theory
Farhad Arbab, CWI and Leiden University, The Netherlands
S. Arun-Kumar, IIT Delhi, India
Ilaria Castellani, INRIA Sophia Antipolis, France
Dave Clarke, Uppsala University, Sweden and KU Leuven, Belgium
Pieter Cuijpers, Eindhoven University of Technology, The Netherlands
Fatemeh Ghassemi, Tehran University, Iran
Matthew Hennessy, Trinity College Dublin, Ireland
Ichiro Hasuo, University of Tokyo, Japan
Mahdi Jaghoori, AMC University of Amsterdam, The Netherlands
Jeroen Keiren, Vrije Universiteit Amsterdam, The Netherlands
Bas Luttik, Eindhoven University of Technology, The Netherlands
Jose Meseguer, University of Illinois at Urbana, USA
Lary Moss, Indiana University, USA
Mohammad Mousavi, Halmstad University, Sweden (Chair)
Jun Pang, University of Luxembourg, Luxembourg
Gerardo Schneider, Chalmers University of Technology, Sweden
Marjan Sirjani, Reykjavik University, Iceland
Walter Vogler, Augsburg University, Germany
Tim Willemse, Eindhoven University of Technology, The Netherlands
[View Less]
(複数お受け取りの場合はご容赦ください.)
皆様,
京都大学の末永です.
今年10月にコロンビアで開かれる国際会議 ICTAC の
論文募集をお送りします.ご投稿をお待ちしております.
末永幸平
--
**********************************************************************
CALL FOR PAPERS -- ICTAC 2015
12th International Colloquium on
Theoretical Aspects of Computing
29-31 October 2015, Cali, Colombia
http://www.ictac2015.co
DEADLINE FOR SUBMISSIONS: JUNE 5, 2015.
***************************************…
[View More]*******************************
ICTAC 2015 will take place at the campus of Universidad Javeriana,
Cali, Colombia during October 29-31, 2015.
The ICTAC conference series aims at bringing together practitioners
and researchers to exchange ideas and experiences addressing
challenges in theoretical aspects of computing as well as in
exploiting theory through methods and tools for system development.
ICTAC also aims to promote cooperation between participants and
institutions from developing and industrial countries in research and
education.
THEMES AND TOPICS OF PAPERS
Topics of interest include theories of computation and programming,
foundations of software engineering and formal techniques in software
design and verification, as well as tools that support formal
techniques for software modeling, system design and verification.
The topical areas of the conference include, but are not limited to
* Automata theory and formal languages;
* Principles and semantics of programming languages;
* Theories of concurrency, mobility and reconfiguration;
* Logics and their applications;
* Software architectures, their models, refinement and verification;
* Relationship between software requirements, models and code;
* Program static and dynamic analysis and verification;
* Software specification, refinement, verification and testing;
* Model checking and theorem proving;
* Models of object and component systems;
* Coordination and feature interaction;
* Integration of theories, formal methods and tools for
engineering computing systems;
* Service-oriented architectures: models and development methods;
* Models of concurrency, security, and mobility;
* Theory of distributed, grid and cloud computing;
* Real-time, embedded, hybrid and cyber-physical systems;
* Type and category theory in computer science.
INVITED SPEAKERS
* Jean-Raymond Abrial
* Volker Diekert
* César Muñoz
* Catuscia Palamidessi
* Davide Sangiorgi
* Moshe Vardi
* Glynn Winskel
ASSOCIATED EVENTS
* ICTAC Summer School on Formal Methods (October 25-27)
* DCM 2015: 11th International Workshop on Developments in
Computational Models (October 28)
PAPER SUBMISSION
== Important Dates
* Abstract submission: Monday, June 1, 2015.
* Paper submission: Friday, June 5, 2015.
* Author notification: Monday, July 20, 2015.
* Camera ready: Monday, August 3, 2015.
== Paper Categories and Format
We call for submissions, related to the above areas and topics,
according to the following three categories:
* Regular papers, with original research contributions;
* Short papers, on recent work or proposals of emerging challenges;
* Tool papers, on tools that support formal techniques for software
modeling, system design and verification.
Submissions should adhere to the LNCS format (see
http://www.springer.de/comp/lncs/authors.html for details). Regular
papers should not exceed 18 pages. Short and tool papers should not
exceed 10 pages.
Submissions to the colloquium must not have been published or be
concurrently considered for publication elsewhere. All submissions
will be judged on the basis of originality, contribution to the field,
technical and presentation quality, as well as their relevance to the
conference.
==Submission Link
Papers must be submitted by using www.easychair.org/conferences/?conf=ictac2015.
==Proceedings
As for the past editions, the proceedings of ICTAC 2015 will be
published by Springer in the series Lecture Notes in Computer Science
(LNCS).
==Special Issue
Extended versions of selected papers from ICTAC 2015 will be invited
to a special issue of Mathematical Structures in Computer Science
(http://journals.cambridge.org/action/displayJournal?jid=MSC).
GENERAL CHAIRS
* Martin Leucker, University of Luebeck (DE).
* Camilo Rueda, Pontificia Universidad Javeriana - Cali (CO).
* Frank Valencia, CNRS and LIX, Ecole Polytechnique (FR).
CONTACT CHAIR
* Frank D. Valencia (frank.valencia(a)gmail.com).
PROGRAM COMMITTEE
* Nazareno Aguirre (AR)
* Gerard Assayag (FR)
* Mauricio Ayala-Rincón (BR)
* Pablo Barceló (CL)
* Gustavo Betarte (UY)
* Filippo Bonchi (FR)
* Marco Carbone (DK)
* Ilaria Castellani (FR)
* Néstor Cataño (CO)
* Gabriel Ciobanu (RO)
* Silvia Crafa (IT)
* Pedro R. D'Argenio (AR)
* Nicolas D'Ippolito (AR)
* Stefan Dantchev (UK)
* Rocco De Nicola (IT)
* Yuxin Deng (CN)
* Gilles Dowek (FR)
* Moreno Falaschi (IT)
* José Luiz Fiadeiro (UK)
* Wan Fokkink (NL)
* Fabio Gadducci (IT)
* Julian Gutierrez (UK)
* Stefan Haar (FR)
* Thomas Hildebrandt (DK)
* Einar Broch Johnsen (NO)
* Bartek Klin (PL)
* Marta Kwiatkowska (UK)
* Kim G. Larsen (DK)
* Martin Leucker (DE) (co-chair)
* Etienne Lozes (FR)
* Larissa Meinicke (AU)
* Hernan Melgratti (AR)
* Dominique Mery (FR)
* Matteo Mio (FR)
* Andrzej Murawski (UK)
* Vivek Nigam (BR)
* Mauricio Osorio (MX)
* Prakash Panangaden (CA)
* Jorge A. Pérez (NL)
* Elaine Pimentel (BR)
* António Ravara (PT)
* Camilo Rocha (CO)
* Camilo Rueda (CO) (co-chair)
* Augusto Sampaio (BR)
* Vijay Saraswat (US)
* Vladimiro Sassone (UK)
* Gerardo Schneider (SE)
* Alexandra Silva (NL)
* Jiri Srba (DK)
* Jean-Bernard Stefani (FR)
* Perdita Stevens (UK)
* Kohei Suenaga (JP)
* Alwen Tiu (SG)
* Kazunori Ueda (JP)
* Frank Valencia (FR) (co-chair)
* Vasco T. Vasconcelos (PT)
* Kapil Vaswani (IN)
* Björn Victor (SE)
* Igor Walukiewicz (FR)
* Farn Wang (TW)
* Alan Wassyng (CA)
* Gianluigi Zavattaro (IT)
--
Kohei Suenaga (末永幸平), Ph.D
Associate professor (准教授)
Graduate School of Informatics, Kyoto University
(京都大学情報学研究科)
ksuenaga(a)gmail.com
http://www.fos.kuis.kyoto-u.ac.jp/~ksuenaga/
[View Less]
皆様
来年3月に金沢で開催されるJAIST Logic Workshop Series 2015のお知らせです。
ふるってご投稿・ご参加ください。
問合せ先:
石原 哉・木原貴行・根元多佳子・横山啓太
北陸先端科学技術大学院大学 情報科学研究科
e-mail: jlws2015(a)jaist.ac.jp
--------------------------------------------------------
*Call for Abstracts*
JAIST LOGIC WORKSHOP SERIES 2015
Constructivism and Computability
2 March 2015 – 6 March 2015
Shiinoki Cultural Complex, Kanazawa, Japan
http://www.jaist.ac.jp/is/labs/ishihara-lab/…
[View More]jlws2015/
--------------------------------------------------------
IMPORTANT DATES
November 30 - deadline for abstract submissions
December 25 - notification of accepted contributions
February 15 - deadline for registrations
March 2-6 - Constructivism and Computability workshop
TUTORIALS
* Giovanni Sambin (University of Padova)
* Hideki Tsuiki (Kyoto University)
* Stanley Wainer (University of Leeds)
INVITED SPEAKERS
* Ulrich Berger (Swansea University)
* Takayuki Kihara (JAIST)
* Graham Leigh (Vienna University of Technology)
* Michael Rathjen (University of Leeds)
* Masahiko Sato (Kyoto University)
* Makoto Tatsuta (National Institute of Informatics)
PROGRAM COMMITTEE
* Toshiyasu Arai (Chiba University)
* Andrej Bauer (University of Ljubljana)
* Ulrich Berger (Swansea University)
* Hajime Ishihara (co-chair, JAIST)
* Masahiro Kumabe (Open University of Japan)
* Erik Palmgren (Stockholm University)
* Peter Schuster (University of Leeds)
* Helmut Schwichtenberg (co-chair, LMU Munich)
* Dieter Spreen (University of Siegen, UNISA Pretoria)
* Kazuyuki Tanaka (Tohoku University)
SUBMISSIONS
Submissions of short abstracts (1 page in PDF format) are accepted through
easychair.org, see https://easychair.org/conferences/?conf=jlws2015
DESCRIPTION
JAIST Logic Workshop Series is a workshop series bringing together
researchers
from mathematical logic and its application, especially to artificial
intelligence and
software science. Each workshop has its own focus on a specific area of
research
in mathematical logic and its application. Previous workshops have been
held in
Kanazawa 2013, 2014 and 2014:
http://www.jaist.ac.jp/~hirokawa/pr2013/http://www.jaist.ac.jp/~preining/wpp/http://www.jaist.ac.jp/~v-sano/jw2014/index.html
In 2015, JAIST Logic Workshop Series focuses on “Constructivism and
Computability”
aiming at interaction and knowledge transfer between constructive
mathematics and
computability theory. The workshop is held being affiliated with EU FP7
Marie Curie
Actions IRSES projects COMPUTAL (http://computal.uni-trier.de/) and
CORCON (http://corcon.net/), but is open to all researchers in the areas.
SCOPE
Constructive mathematics and computability, and related areas
including but not limited to: intuitionistic logic and type theory,
proof theory, constructive analysis and topology, program extraction
from proofs, recursion theory, computable analysis and topology,
classical/constructive reverse mathematics, algorithmic randomness,
real number computation etc.
LOCAL ORGANIZERS
* Hajime Ishihara (JAIST)
* Takayuki Kihara (JAIST)
* Takako Nemoto (JAIST)
* Keita Yokoyama (JAIST)
The workshop is supported by:
* Japan Advanced Institute of Science and Technology (JAIST)
CO-LOCATED WORKSHOP
* JSPS-NUS Joint Workshop in Mathematica Logic and Foundations of
Mathematics
(6-7 March 2015, at the same venue)
[View Less]
京都大学の勝股です。
投稿締切まで3週間となりましたICALP2015のご案内です。
----------
ICALP 2015
http://www.kurims.kyoto-u.ac.jp/icalp2015/
Second Call for Papers
======================
The 42nd International Colloquium on Automata, Languages, and
Programming (ICALP) will take place in the period 6-10 July 2015 in
Kyoto, Japan. The conference will co-locate with LICS 2015, the 30th
ACM/IEEE Symposium on Logic in Computer Science. The ICALP 2015
conference chair …
[View More]is Kazuo Iwama (Kyoto University).
ICALP is the main conference and annual meeting of the European
Association for Theoretical Computer Science (EATCS). As usual, the
main conference will be preceded and/or followed by a series of
workshops.
Important dates
---------------
Submission deadline: Tuesday, 17 February 2015, 23:59 PST (Pacific
Standard Time, UTC-8)
Author notification: 15 April 2015
Final manuscript due: 30 April 2015
Deadlines are firm; late submissions will not be considered.
Proceedings
-----------
ICALP proceedings are published in the Springer-Verlag ARCoSS
(Advanced Research in Computing and Software Science) subseries of
LNCS (Lecture Notes in Computer Science).
Invited Speakers
=================
Ken Kawarabayashi, NII, Japan
Valerie King, University of Victoria, Canada
Thomas Moscibroda, MSR Asia, China
Anca Muscholl, Universite Bordeaux, France (Joint with LICS)
Peter O'Hearn, Facebook, UK (Joint with LICS)
Invited Tutorial Speakers (Joint with LICS)
-------------------------------------------
Piotr Indyk, MIT, USA
Andrew Pitts, University of Cambridge, UK
Geoffrey Smith, Florida International University, USA
Masterclass speaker
-------------------
Ryuhei Uehara, JAIST, Japan
Topics
======
Papers presenting original research on all aspects of theoretical
computer science are sought. Typical but not exclusive topics of
interest are:
Track A: Algorithms, Complexity and Games
-----------------------------------------
* Algorithmic Game Theory
* Approximation Algorithms
* Combinatorial Optimization
* Combinatorics in Computer Science
* Computational Biology
* Computational Complexity
* Computational Geometry
* Cryptography
* Data Structures
* Design and Analysis of Algorithms
* Machine Learning
* Parallel, Distributed and External Memory Computing
* Randomness in Computation
* Quantum Computing
Track B: Logic, Semantics, Automata and Theory of Programming
-------------------------------------------------------------
* Algebraic and Categorical Models
* Automata, Games, and Formal Languages
* Emerging and Non-standard Models of Computation
* Databases, Semi-Structured Data and Finite Model Theory
* Principles and Semantics of Programming Languages
* Logic in Computer Science, Theorem Proving and Model Checking
* Models of Concurrent, Distributed, and Mobile Systems
* Models of Reactive, Hybrid and Stochastic Systems
* Program Analysis and Transformation
* Specification, Refinement, Verification and Synthesis
* Type Systems and Theory, Typed Calculi
Track C: Foundations of Networked Computation:
Models, Algorithms and Information Management
------------------------------------------------------
* Algorithmic Aspects of Networks and Networking
* Formal Methods for Network Information Management
* Foundations of Privacy, Trust and Reputation in Networks
* Mobile and Wireless Networks and Communication
* Network Economics and Incentive-Based Computing Related to Networks
* Networks of Low Capability Devices
* Network Mining and Analysis
* Overlay Networks and P2P Systems
* Specification, Semantics, Synchronization of Networked Systems
* Theory of Security in Networks
Submission Guidelines
--------------------
Authors are invited to submit an extended abstract of no more than 12
pages, including references, in LNCS style presenting original
research on the theory of Computer Science. All submissions will be
electronic via the EasyChair page for the conference, with three
tracks (A, B and C):
https://easychair.org/conferences/?conf=icalp2015
Submissions should be made to the appropriate track of the conference.
No prior publication or simultaneous submission to other publication
outlets (either a conference or a journal) is allowed.
Submissions must adhere to the specified format and
length. Submissions that are too long or formatted incorrectly may be
rejected immediately. All the technical details that are necessary
for a proper scientific evaluation of a submission must be included in
a clearly-labelled appendix, to be consulted at the discretion of
program committee members. This includes, in particular, the proofs of
all the key theorems in a paper.
Should I submit my paper to Track A or Track C?
------------------------------------------------
While the scope of Tracks A and B are generally well understood given
their long history, the situation for Track C may be less obvious. In
particular, some clarifications may be helpful regarding areas of
potential overlap, especially between Tracks A and C.
The aim for Track C is to be the leading venue for theory papers truly
motivated by networking applications, and/or proposing theoretical
results relevant to real networking, certified analytically, but not
necessarily tested practically. The motivation for the track was the
lack of good venues for theory papers motivated by applications in
networking. On the one hand, the good networking conferences typically
ask for extended experiments and/or simulations, while the TCS
community is hardly able to do such experiments or simulations. On the
other hand, the good conferences on algorithms tend to judge a paper
based only on its technical difficulty and on its significance from an
algorithmic perspective, which may not be the same as when judging the
paper from the perspective of impact on networks.
Several areas of algorithmic study of interest to track C have a broad
overlap with track A. Graph algorithmics can belong in either, though
if the work is not linked to networking, it is more appropriate in
track A. Algorithmic game theory is another area of major
overlap. Aspects involving complexity, the computation of equilibria
and approximations, belong more in Track A, while results with
applications in auctions, networks and some aspects of mechanism
design belong in Track C.
Finally, it should be noted that algorithms and complexity of
message-passing based distributed computing belong squarely in track
C, while certain other aspects of distributed computing do not fall
under its scope.
Best Paper Awards
-----------------
As in previous editions of ICALP, there will be best paper and best
student paper awards for each track of the conference. In order to be
eligible for a best student paper award, a paper should be authored
only by students and should be marked as such upon submission.
Committees
==========
Track A: Algorithms, complexity, and games
------------------------------------------
Peyman Afshani, Aarhus University, Denmark
Hee-Kap Ahn, POSTECH, South Korea
Hans Bodlaender Utrecht University, The Netherlands
Karl Bringmann, Max-Planck Institut für Informatik, Germany
Sergio Cabello, University of Ljubljana, Slovenia
Ken Clarkson, IBM Almaden Research Center, USA
Eric Colin de Verdiere, École Normale Supérieure Paris, France
Stefan Dziembowski, University of Warsaw, Poland
David Eppstein, University of California at Irvine, USA
Dimitris Fotakis, National Technical University of Athens, Greece
Paul Goldberg, University of Oxford, UK
MohammadTaghi Hajiaghayi, University of Maryland at College Park, USA
Jesper Jansson, Kyoto University, Japan
Andrei Krokhin, Durham University, UK
Asaf Levin, Technion, Israel
Inge Li Gortz, Technical University of Denmark, Denmark
Pinyan Lu, Microsoft Research Asia, China
Frederic Magniez, Universite Paris Diderot, France
Kazuhisa Makino, Kyoto University, Japan
Elvira Mayordomo, Universidad de Zaragoza, Spain
Ulrich Meyer, Goethe University Frankfurt am Main, Germany
Wolfgang Mulzer, Free University Berlin, Germany
Viswanath Nagarajan, University of Michigan, USA
Vicky Papadopoulou, European University Cyprus, Cyprus
Michal Pilipczuk, University of Bergen, Norway
Liam Roditty, Bar-Ilan University, Israel
Ignaz Rutter, Karlsruhe Institute of Technology, Germany
Rocco Servedio, Columbia University, USA
Jens Schmidt, TU Ilmenau, Germany
Bettina Speckmann (chair), TU Eindhoven, The Netherlands
Csaba D. Toth, California State University Northridge, USA
Takeaki Uno, National Institute of Informatics, Japan
Erik Jan van Leeuwen, Max-Planck Institut für Informatik, Germany
Rob van Stee, University of Leicester, UK
Ivan Visconti, University of Salerno, Italy
Track B: Logic, semantics, automata and theory of Programming
-------------------------------------------------------------
Andreas Abel, Chalmers and Gothenburg University, Sweden
Albert Atserias, Universitat Politècnica de Catalunya, Spain
Christel Baier, TU Dresden, Germany
Lars Birkedal, Aarhus University, Denmark,
Luis Caires, Universidade Nova de Lisboa, Portugal
James Cheney, University of Edinburgh, UK
Wei Ngan Chin, National University of Singapore, Singapore
Ugo Dal Lago, University of Bologna, Italy
Thomas Ehrhard, CNRS, Université Paris Diderot, France
Zoltan Esik, University of Szeged, Hungary
Xinyu Feng, University of Science and Technology of China, China
Wan Fokkink, VU University Amsterdam, The Netherlands
Shin-ya Katsumata, Kyoto University, Japan
Naoki Kobayashi (chair), The University of Tokyo, Japan
Eric Koskinen, New York University, USA
Antonín Kucera, Masaryk University, Czech Republic
Orna Kupferman, Hebrew University, Israel
Annabelle Mclver, Macquarie University, Australia
Dale Miller, INRIA Saclay, France
Markus Mueller-Olm, University of Münster, Germany
Andrzej Murawski, Univeristy of Warwick, UK
Joel Ouaknine, Univeristy of Oxford, UK
Prakash Panangaden, McGill University, Canada
Pawel Parys, University. of Warsaw, Poland
Reinhard Pichler, TU Vienna, Austria
Simona Ronchi Della Rocca, University of Torino, Italy
Jeremy Siek, Indiana University, USA
Track C: Foundations of networked computation:
Models, algorithms and information management
------------------------------------------------------
Ioannis Caragiannis, Univ. Patras, Greece
Katarina Cechlarova, Pavol Jozef Safarik Univ., Slovakia
Shiri Chechik, Tel Aviv Univ., Israel
Yuval Emek, Technion, Israel
Sandor Fekete, TU Braunschweig, Germany
Pierre Fraigniaud, CNRS and Paris Diderot, France
Leszek Gasieniec, Univ. Liverpool, UK
Aristides Gionis, Aalto Univ., Finland
Magnus M. Halldorsson (chair), Reykjavik Univ, Iceland
Monika Henzinger, Univ. Wien, Austria
Bhaskar Krishnamachari, USC, USAL
Fabian Kuhn, Freiburg, Germany
Michael Mitzenmacher, Harvard Univ, USA
Massimo Merro, Univ. Verona, Italy
Gopal Pandurangan, Univ. Houston, USA
Pino Persiano, Salerno, Italy
R. Ravi, CMU, USA
Ymir Vigfusson, Emory Univ., USA
Roger Wattenhofer, ETH Zurich, Switzerland
Masafumi Yamashita, Kyushu Univ., Japan
[View Less]