Difference between revisions of "ICALP 2019"

From Openresearch
Jump to: navigation, search
 
(7 intermediate revisions by 2 users not shown)
Line 3: Line 3:
 
|Title=46th International Colloquium on Automata, Languages, and Programming
 
|Title=46th International Colloquium on Automata, Languages, and Programming
 
|Series=ICALP
 
|Series=ICALP
|Type=Colloquium
+
|Type=Conference
 +
|Field=Theoretical computer science
 
|Start date=2019/07/08
 
|Start date=2019/07/08
 
|End date=2019/07/12
 
|End date=2019/07/12
Line 13: Line 14:
 
|Notification=2019/04/19
 
|Notification=2019/04/19
 
|Submitting link=https://easychair.org/conferences/?conf=icalp2019
 
|Submitting link=https://easychair.org/conferences/?conf=icalp2019
 +
|Has coordinator=Andreas Bardoutsos, Efstratios Gallopoulos, John Garofalakis, Christos Kaklamanis, Paraskevi Machaira, Sotiris Nikoletseas, Nikolaos Zacharatos, Christos Zaroliagis
 +
|has Keynote speaker=Michal Feldman, Martin Grohe, Ola Svensson, Frits Vaandrager, Mihalis Yannakakis
 +
|Submitted papers=490
 +
|Accepted papers=146
 +
|has Proceedings Link=https://drops.dagstuhl.de/opus/volltexte/lipics-complete/lipics-vol132-icalp2019-complete.pdf
 +
|has Proceedings DOI=https://doi.org/10.4230/LIPIcs.ICALP.2019.0
 +
|has Proceedings Bibliography=https://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=16111
 
}}
 
}}
 
The 46th International Colloquium on Automata, Languages, and Programming (ICALP) 2019
 
The 46th International Colloquium on Automata, Languages, and Programming (ICALP) 2019
  
 
==Topics==
 
==Topics==
Track A: Algorithms, complexity and games:
+
'''Track A:''' Algorithms, complexity and games:
 +
* Approximation Algorithms
 +
* Combinatorial Optimization
 +
* Combinatorics in Computer Science
 +
* Computational Biology
 +
* Computational Complexity
 +
* Computational Geometry
 +
* Cryptography
 +
* Data Structures
 +
* Design and Analysis of Algorithms
 +
* Foundations of Algorithmic Game Theory
 +
* Machine Learning
 +
* Parallel, Distributed and External Memory Computing
 +
* Quantum Computing
 +
* Randomness in Computation
  
    Approximation Algorithms
+
'''Track B:''' Automata, logic, semantics, and theory of programming:
    Combinatorial Optimization
+
* Algebraic and Categorical Models
    Combinatorics in Computer Science
+
* Automata, Games, and Formal Languages
    Computational Biology
+
* Emerging and Non-standard Models of Computation
    Computational Complexity
+
* Databases, Semi-Structured Data and Finite Model Theory
    Computational Geometry
+
* Logic in Computer Science, Theorem Proving and Model Checking
    Cryptography
+
* Models of Concurrent, Distributed, and Mobile Systems
    Data Structures
+
* Models of Reactive, Hybrid and Stochastic Systems
    Design and Analysis of Algorithms
+
* Principles and Semantics of Programming Languages
    Foundations of Algorithmic Game Theory
+
* Program Analysis and Transformation
    Machine Learning
+
* Specification, Verification and Synthesis
    Parallel, Distributed and External Memory Computing
+
* Type Systems and Theory, Typed Calculi
    Quantum Computing
 
    Randomness in Computation
 
  
Track B: Automata, logic, semantics, and theory of programming:
+
'''Track C:''' Foundations of networks and multi-agent systems: models, algorithms and information management:
 
+
* Algorithmic Aspects of Networks and Networking
    Algebraic and Categorical Models
+
* Algorithmic Game Theory
    Automata, Games, and Formal Languages
+
* Formal Methods for Network Information Management
    Emerging and Non-standard Models of Computation
+
* Foundations of Privacy, Trust and Reputation in Networks
    Databases, Semi-Structured Data and Finite Model Theory
+
* Foundations of Complex Networks
    Logic in Computer Science, Theorem Proving and Model Checking
+
* Message-Passing Models of Distributed Computing
    Models of Concurrent, Distributed, and Mobile Systems
+
* Mobile and Wireless Networks and Communication
    Models of Reactive, Hybrid and Stochastic Systems
+
* Network Economics and Incentive-Based Computing Related to Networks
    Principles and Semantics of Programming Languages
+
* Networks of Low Capability Devices
    Program Analysis and Transformation
+
* Network Mining and Analysis
    Specification, Verification and Synthesis
+
* Overlay Networks and P2P Systems
    Type Systems and Theory, Typed Calculi
+
* Specification, Semantics, Synchronization of Networked Systems
 
+
* Theory of Security in Networks
Track C: Foundations of networks and multi-agent systems: models, algorithms and information management:
 
 
 
    Algorithmic Aspects of Networks and Networking
 
    Algorithmic Game Theory
 
    Formal Methods for Network Information Management
 
    Foundations of Privacy, Trust and Reputation in Networks
 
    Foundations of Complex Networks
 
    Message-Passing Models of Distributed Computing
 
    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
 
  
  

Latest revision as of 06:42, 26 August 2020

ICALP 2019
46th International Colloquium on Automata, Languages, and Programming
Event in series ICALP
Dates 2019/07/08 (iCal) - 2019/07/12
Homepage: https://icalp2019.upatras.gr/
Submitting link: https://easychair.org/conferences/?conf=icalp2019
Location
Location: Patras, Greece
Loading map...

Important dates
Workshops: 2018/12/15
Submissions: 2019/02/18
Notification: 2019/04/19
Papers: Submitted 490 / Accepted 146 (29.8 %)
Committees
Organizers: Andreas Bardoutsos, Efstratios Gallopoulos, John Garofalakis, Christos Kaklamanis, Paraskevi Machaira, Sotiris Nikoletseas, Nikolaos Zacharatos, Christos Zaroliagis
Keynote speaker: Michal Feldman, Martin Grohe, Ola Svensson, Frits Vaandrager, Mihalis Yannakakis
Table of Contents


The 46th International Colloquium on Automata, Languages, and Programming (ICALP) 2019

Topics

Track A: Algorithms, complexity and games:

  • Approximation Algorithms
  • Combinatorial Optimization
  • Combinatorics in Computer Science
  • Computational Biology
  • Computational Complexity
  • Computational Geometry
  • Cryptography
  • Data Structures
  • Design and Analysis of Algorithms
  • Foundations of Algorithmic Game Theory
  • Machine Learning
  • Parallel, Distributed and External Memory Computing
  • Quantum Computing
  • Randomness in Computation

Track B: Automata, logic, semantics, 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
  • Logic in Computer Science, Theorem Proving and Model Checking
  • Models of Concurrent, Distributed, and Mobile Systems
  • Models of Reactive, Hybrid and Stochastic Systems
  • Principles and Semantics of Programming Languages
  • Program Analysis and Transformation
  • Specification, Verification and Synthesis
  • Type Systems and Theory, Typed Calculi

Track C: Foundations of networks and multi-agent systems: models, algorithms and information management:

  • Algorithmic Aspects of Networks and Networking
  • Algorithmic Game Theory
  • Formal Methods for Network Information Management
  • Foundations of Privacy, Trust and Reputation in Networks
  • Foundations of Complex Networks
  • Message-Passing Models of Distributed Computing
  • 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


Submissions

Authors are invited to submit an extended abstract of no more than 12 pages, excluding references presenting original research on the theory of computer science. All submissions must be formatted in the LIPIcs style and submitted via Easychair to the appropriate track of the conference, using the following link: https://easychair.org/conferences/?conf=icalp2019.

The use of pdflatex and the LIPIcs style are mandatory: papers that deviate significantly from the required format may be rejected without consideration of merit.

No prior publication and no simultaneous submission to other publication outlets (either a conference or a journal) is allowed.

Technical details necessary for a proper scientific evaluation of a submission must be included in the 12-page submission or in a clearly labelled appendix, to be consulted at the discretion of program committee members. Authors are strongly encouraged to also make full versions of their submissions freely accessible in an on-line repository such as ArXiv, HAL, ECCC.

It is imperative that if a paper is accepted then at least one of the authors must register at ICALP 2019, attend the conference, and present the paper.


Important Dates

Submission deadline: Monday 18 February 2019, 23:59 AoE
Notification: Friday 19 April 2019
Workshop submission deadline: Saturday 15 December 2018
Final manuscript due: Monday 29 April 2019
Early registration deadline: Sunday 9 June 2019
Workshops: 8 July 2019
Main conference: 9-12 July 2019