Call for Papers for a Special Issue of
Algorithms and Complexity at the
Interface of Mathematics and Computer Science
Theoretical algorithms and their complexity are central
in foundational research at the interface between mathematics and
computer science. This will be the focus of this special issue of
Mathematics in Computer Science (MCS).
There are many current challenges at the interface of continuous and
discrete computation. For instance, how can we faithfully and efficiently
discretize a continuous geometric object, or a continuous problem?
Efficient new algorithmic techniques must be developed and analyzed.
The inherent complexity of such problems needs to be characterized.
Such considerations are central to current research areas such as:
- robust geometric algorithms
- the surface-surface intersection (SSI) challenge in geometric
- mesh generation with topological guarantees
- the development of a theory of real computation
- the emerging field of numeric-algebraic computation
- Deadline for paper submission: January 15, 2010
- Notification of acceptance/rejection: April 1, 2010
- Deadline for camera-ready submission: June, 2010
- Publication of special issue: November 1, 2010
- It is recommended that papers be prepared using LaTeX.
For details please look at the instructions
for authors (pdf, 50kB).
- While there is no strict page limit, we expect the length of papers to be
approximately 20 pages on average.
- A submission should contain
- the title and abstract of the paper in plain text
- the name and e-mail address of the communicating
a PDF as e-mail attachment and be sent to Gert Vegter
(G.Vegter - at - rug.nl)
with subject line "mcs-issue".
- All submitted papers will be refereed according to the usual
MCS refereeing process.