Publikation: 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX)
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
The aim of ALENEX is to provide a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical submissions will include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice. We also invite submissions that address methodological issues and standards in the experimental evaluation of algorithms and data structures. Some possible areas of applied algorithmic research include but are not limited to databases; networks, including web applications; operations research; and computational problems in the natural sciences or engineering. Submissions are encouraged that address algorithms and data structures for advanced models of computing including memory hierarchies and parallel computing, ranging from instruction parallelism over multicore computing to exascale and cloud computing. The annual Meeting on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical contributions include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
EPPSTEIN, David, ed., Ulrik BRANDES, ed., 2015. 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX). ALENEX15 : Meeting on Algorithm Engineering & Experiments ; January 5 2015, Westin San Diego Gaslamp Quarter, San Diego, California, USA. San Diego, California, 5. Jan. 2015 - 5. Jan. 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics. ISBN 978-1-61197-375-4BibTex
@proceedings{Eppstein2015Proce-33973,
year={2015},
doi={10.1137/1.9781611973754},
publisher={Society for Industrial and Applied Mathematics},
address={Philadelphia, PA},
title={2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX)},
editor={Eppstein, David and Brandes, Ulrik}
}RDF
<rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/33973">
<dc:publisher>Society for Industrial and Applied Mathematics</dc:publisher>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2016-05-18T08:26:18Z</dcterms:available>
<bibo:issn>978-1-61197-375-4</bibo:issn>
<dc:publisher>Philadelphia, PA</dc:publisher>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dcterms:abstract xml:lang="eng">The aim of ALENEX is to provide a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical submissions will include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice. We also invite submissions that address methodological issues and standards in the experimental evaluation of algorithms and data structures. Some possible areas of applied algorithmic research include but are not limited to databases; networks, including web applications; operations research; and computational problems in the natural sciences or engineering. Submissions are encouraged that address algorithms and data structures for advanced models of computing including memory hierarchies and parallel computing, ranging from instruction parallelism over multicore computing to exascale and cloud computing. The annual Meeting on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical contributions include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice.</dcterms:abstract>
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/33973"/>
<dc:contributor>Eppstein, David</dc:contributor>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dc:language>eng</dc:language>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2016-05-18T08:26:18Z</dc:date>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:contributor>Brandes, Ulrik</dc:contributor>
<dcterms:title>2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX)</dcterms:title>
<dcterms:issued>2015</dcterms:issued>
</rdf:Description>
</rdf:RDF>
