TY  - CHAP
AU  - Benz, Dominik
AU  - Hotho, Andreas
AU  - Jäschke, Robert
AU  - Stumme, Gerd
AU  - Halle, Axel
AU  - Gerlach Sanches Lima, Angela
AU  - Steenweg, Helge
AU  - Stefani, Sven
A2  - Lalmas, Mounia
A2  - Jose, Joemon
A2  - Rauber, Andreas
A2  - Sebastiani, Fabrizio
A2  - Frommholz, Ingo
T1  - Academic Publication Management with PUMA – Collect, Organize and Share Publications
T2  - Research and Advanced Technology for Digital Libraries
PB  - Springer Berlin Heidelberg
CY  - 
PY  - 2010/
VL  - 6273
IS  - 
SP  - 417
EP  - 420
UR  - http://dx.doi.org/10.1007/978-3-642-15464-5_46
M3  - 10.1007/978-3-642-15464-5_46
KW  - latexkurs
KW  - puma
L1  - 
SN  - 978-3-642-15463-8
N1  - Academic Publication Management with PUMA – Collect, Organize and Share Publications - Springer
N1  - 
AB  - The PUMA project fosters the Open Access movement und aims at a better support of the researcher’s publication work. PUMA stands for an integrated solution, where the upload of a publication results automatically in an update of both the personal and institutional homepage, the creation of an entry in a social bookmarking systems like BibSonomy, an entry in the academic reporting system of the university, and its publication in the institutional repository. In this poster, we present the main features of our solution.
ER  -

TY  - BOOK
AU  - Knappen, Jörg
A2  - 
T1  - Schnell ans Ziel mit LaTeX
PB  - Oldenburg Wissenschaftsverlag
AD  - 
PY  - 2009/
VL  - 
IS  - 
SP  - 
EP  - 
UR  - 
M3  - 
KW  - kurs
KW  - latex
KW  - latexkurs
KW  - tex
L1  - 
SN  - 
N1  - 
N1  - 
AB  - 
ER  -

TY  - JOUR
AU  - Wegener, Ingo
T1  - BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)
JO  - Theoretical Computer Science
PY  - 1993/10
VL  - 118
IS  - 1
SP  - 81
EP  - 98
UR  - 
M3  - 
KW  - 2013
KW  - algorithm
KW  - heapsort
KW  - latexkurs
KW  - puma
KW  - sorting
L1  - 
SN  - 
N1  - 
N1  - 
AB  - 
ER  -

TY  - JOUR
AU  - Martin, W. A.
T1  - Sorting
JO  - ACM Comput. Surv.
PY  - 1971/
VL  - 3
IS  - 4
SP  - 147
EP  - 174
UR  - http://portal.acm.org/citation.cfm?id=356593.356594&coll=Portal&dl=GUIDE&CFID=89172762&CFTOKEN=95662085
M3  - 10.1145/356593.356594
KW  - 2013
KW  - latexkurs
KW  - seminar
KW  - sorting
L1  - 
SN  - 
N1  - Sorting
N1  - 
AB  - The bibliography appearing at the end of this article lists 37 sorting algorithms and 100 books and papers on sorting published in the last 20 years. The basic ideas presented here have been abstracted from this body of work, and the best algorithms known are given as examples. As the algorithms are explained, references to related algorithms and mathematical or experimental analyses are given. Suggestions are then made for choosing the algorithm best suited to a given situation.
ER  -

TY  - JOUR
AU  - Hoare, C. A. R.
T1  - Algorithm 64: Quicksort.
JO  - Commun. ACM
PY  - 1961/
VL  - 4
IS  - 7
SP  - 
EP  - 
UR  - http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b
M3  - 
KW  - 64
KW  - algorithm
KW  - algorithmen
KW  - latexkurs
KW  - quicksort
L1  - 
SN  - 
N1  - dblp
N1  - 
AB  - 
ER  -