Skip to search formSkip to main contentSkip to account menu

ICALP

ICALP, the International Colloquium on Automata, Languages and Programming is an academic conference organized annually by the European Association… 
Wikipedia (opens in a new tab)

Related topics

Related topics

24 relations
ACM SIGACTApex graphClaire MathieuCycle rank

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Structural sparseness and complex networks
The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational… 
2009
2009
Dependency Tree Automata
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of… 
2006
2006
Optimal 2-constraint satisfaction via sum-product algorithms
2004
2004
Sublinear-Time Approximation for Clustering Via Random Sampling
In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median… 
2001
2001
Lossy Dictionaries
Bloom filtering is an important technique for space efficient storage of a conservative approximation of a set S. The set stored… 
1996
1996
Relating CHAM descriptions of software architectures
We propose an approach to compare descriptions of software architectures based on the CHAM formalism. The need to compare… 
Highly Cited
1996
Highly Cited
1996
Pulsars : problems and progress : IAU Colloquium 160, proceedings held at the Research Centre for Theoretical Astrophysics University of Sydney, Australia, 8-12 January 1996
1993
1993
Inside the stars : IAU Colloquium 137
1992
1992
Der historische Horizont der Götterbild-Amulette aus der Übergangsepoche von der Spätantike zum Frühmittelalter : Bericht über das Colloquium vom 28. 11.-1. 12. 1988 in der Werner-Reimers-Stiftung…
1992
1992
Methods Of Analysis Of IVHS Safety
This is the final and primary report of a PATH project which focused on developing and demonstrating methods by which the safety… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)