research unit 1
 

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit Aigaion.nl.SourceForge.hetLogo
Top level

AMORE

   

 

AMORE is a

* Research Training Network (RTN) with contract no HPRN-CT-1999-00104. (The proposal no was RTN1-1999-00446.)

* The Community Research & Development Information Service (CORDIS) maintains databases of RTNs and their vacancies:

o RTN entry for AMORE

o Vacancy entry for AMORE

Research Training Networks are part of the programme

* Improving Human Potential & the Socio-Economic Knowledge base (IMPROVING).

This, in turn, is one of three "horizontal" programmes within the

* Fifth Framework Programme 1998-2002 (FP5):

o page by CORDIS

o alternate page by the Research Directorate General of the European Commission.

* Besides the 15 member states of the EU, of the states currently associated with FP5 the following 15 states were associated with FP5 when the AMORE contract was signed and are therefore considered associated with AMORE as listed in Article 6 of the contract: Bulgaria, Czech Republic, Republic of Cyprus, Estonia, Hungary, Iceland, Israel, Latvia, Liechtenstein, Lithuania, Norway, Poland, Romania, Slovakia, Slovenia.

 

Main website

   http://i11www.iti.uni-karlsruhe.de/algo/amore/administrative.html.

16 publications (0 read)

   Full list of references and notes.
    Change the membership of publications for this topic.

25 authors

   Authors on this topic.

0 subtopics

   

Export

   Export all publications in this topic to BibTeX or to RIS.



2007

[RACTI-RU1-2007-120] Hadjicharalambous, Georgia, Pop, Petrica, Pyrga, Evangelia, Tsaggouris, George and Zaroliagis, Christos, The Railway Traveling Salesman Problem, in: Algorithmic Methods for Railway Optimization, pages 264-275, Springer-Verlag, 2007.
 
[RACTI-RU1-2007-48] Pyrga, Evangelia, Schulz, Frank, Wagner, Dorothea and Zaroliagis, Christos, Efficient Models for Timetable Information in Public Trasportation Systems, in: ACM Journal of Experimental Algorithmics, volume 12, number 2.4, pages 1-39, 2007.
 

2006

[RACTI-RU1-2006-46] Di Stefano, G., Petricola, A. and Zaroliagis, Christos, On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer, in: International Symposium on Parallel and Distributed Processing and Applications, pages 406-417, Springer Berlin / Heidelberg, ISPA 2006, 2006.
 

2005

[RACTI-RU1-2005-56] Wagner, Dorothea, Willham, Thomas and Zaroliagis, Christos, Geometric Containers for Efficient Shortest Path Computation, in: ACM Journal of Experimental Algorithmics, volume 10, number 1.3, pages 1-30, 2005.
 

2004

[RACTI-RU1-2004-39] Pyrga, Evangelia, Schulz, Frank, Wagner, Dorothea and Zaroliagis, Christos, Experimental Comparison of Shortest Path Approaches for Timetable Information, in: Algorithm Engineering and Experiments, pages 88-99, ALENEX 2004, New Orleans, LA, 2004.
 

2003

[RACTI-RU1-2003-60] Wagner, Dorothea, Willham, Thomas and Zaroliagis, Christos, Dynamic Shortest Paths Containers, in: Electronic Notes in Theoretical Computer Science, pages 65-84, Elsevier, 2003. [DOI]
 
[RACTI-RU1-2003-29] Kaporis, Alexis, Makris, Christos, Sioutas, Spyros, Tsakalidis, Athanasios, Tsichlas, Kostas and Zaroliagis, Christos, Improved Bounds for Finger Search on a RAM, in: 11th Annual European Symposium on Algorithms (ESA 2003), pages 325-336, Springer Verlag, Budapest, Hungary, 2003.
 
[RACTI-RU1-2003-28] Konstantinou, Elisavet, Stamatiou, Yannis and Zaroliagis, Christos, On the Construction of Prime Order Elliptic Curves, in: 4th International Conference on Cryptology, pages 309-322, INDOCRYPT 2003, New Delhi, India, 2003.
 

2002

[RACTI-RU1-2002-21] Schulz, Frank, Wagner, Dorothea and Zaroliagis, Christos, Using Multi-Level Graphs for Timetable Information in Railway Systems, in: 4th Workshop on Algorithm Engineering and Experiments, pages 43-59, ALENEX 2002, San Francisco, California, 2002.
 
[RACTI-RU1-2002-18] Konstantinou, Elisavet, Stamatiou, Yannis and Zaroliagis, Christos, A Software Library for Elliptic Curve Cryptography, in: 10th European Symposium on Algorithms, pages 625-637, ESA 2002, 2002.
 
[RACTI-RU1-2002-17] Konstantinou, Elisavet, Stamatiou, Yannis and Zaroliagis, Christos, On the Efficient Generation of Elliptic Curves over Prime Fields, in: Workshop on Cryptographic Hardware and Embedded Systems, pages 333-348, CHES 2002, Redwood City, USA, 2002.
 
[RACTI-RU1-2002-5] Chatzigiannakis, Ioannis, Nikoletseas, Sotiris, Spirakis, Paul and Zaroliagis, Christos, Experimenting with Relay Protocols for Communication in Ad-hoc Mobile Networks, number ALCOMFT-TR-02-71, 2002.
 

2001

[RACTI-RU1-2001-28] Nikoletseas, Sotiris, Prasinos, Grigorios, Spirakis, Paul and Zaroliagis, Christos, Attack Propagation in Networks, in: 23rd ACM Symposium on Parallelism in Algorithms and Architectures, pages 67-76, SPAA 2001, 2001.
 
[RACTI-RU1-2001-22] Frigioni, D., Miller, T., Nanni, U. and Zaroliagis, Christos, An Experimental Study of Dynamic Algorithms for Transitive Closure', in: ACM Journal of Experimental Algorithmics, volume 6, number 9, pages 1-42, 2001.
 
[RACTI-RU1-2001-14] Nikoletseas, Sotiris, Prasinos, Grigorios, Spirakis, Paul and Zaroliagis, Christos, Attack propagation in networks, in: Symposium on Parallelism in Algorithms and Architectures, pages 67-76, SPAA, 2001.
 
[RACTI-RU1-2001-5] Chatzigiannakis, Ioannis, Nikoletseas, Sotiris, Paspalis, Nearchos, Spirakis, Paul and Zaroliagis, Christos, An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks, in: 5th Workshop on Algorithmic Engineering, pages 159-171, Springer-Verlag, WAE, Aarhus, Denmark, 2001. [DOI]