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.

@incollection{benz2010academic, author = {Benz, Dominik and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd and Halle, Axel and Gerlach Sanches Lima, Angela and Steenweg, Helge and Stefani, Sven}, title = {Academic Publication Management with PUMA – Collect, Organize and Share Publications}, editor = {Lalmas, Mounia and Jose, Joemon and Rauber, Andreas and Sebastiani, Fabrizio and Frommholz, Ingo}, booktitle = {Research and Advanced Technology for Digital Libraries}, series = {Lecture Notes in Computer Science}, publisher = {Springer Berlin Heidelberg}, year = {2010}, volume = {6273}, pages = {417-420}, url = {http://dx.doi.org/10.1007/978-3-642-15464-5_46}, doi = {10.1007/978-3-642-15464-5_46}, isbn = {978-3-642-15463-8}, keywords = {latexkurs, puma}, abstract = {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.} }

%0 = incollection %A = Benz, Dominik and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd and Halle, Axel and Gerlach Sanches Lima, Angela and Steenweg, Helge and Stefani, Sven %B = Research and Advanced Technology for Digital Libraries %D = 2010 %I = Springer Berlin Heidelberg %T = Academic Publication Management with PUMA – Collect, Organize and Share Publications %U = http://dx.doi.org/10.1007/978-3-642-15464-5_46

@book{knappen2009schnell, author = {Knappen, Jörg}, title = {Schnell ans Ziel mit LaTeX}, publisher = {Oldenburg Wissenschaftsverlag}, year = {2009}, edition = {3}, keywords = {kurs, latex, latexkurs, tex} }

%0 = book %A = Knappen, Jörg %D = 2009 %I = Oldenburg Wissenschaftsverlag %T = Schnell ans Ziel mit LaTeX

@article{wegener1993bottomupheapsort, author = {Wegener, Ingo}, title = {BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)}, journal = {Theoretical Computer Science}, year = {1993}, volume = {118}, number = {1}, pages = {81-98}, keywords = {2013, algorithm, heapsort, latexkurs, puma, sorting} }

%0 = article %A = Wegener, Ingo %D = 1993 %T = BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)

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.

@article{356594, author = {Martin, W. A.}, title = {Sorting}, journal = {ACM Comput. Surv.}, publisher = {ACM}, address = {New York, NY, USA}, year = {1971}, volume = {3}, number = {4}, pages = {147--174}, url = {http://portal.acm.org/citation.cfm?id=356593.356594&coll=Portal&dl=GUIDE&CFID=89172762&CFTOKEN=95662085}, doi = {10.1145/356593.356594}, issn = {0360-0300}, keywords = {2013, latexkurs, seminar, sorting}, abstract = {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.} }

%0 = article %A = Martin, W. A. %C = New York, NY, USA %D = 1971 %I = ACM %T = Sorting %U = http://portal.acm.org/citation.cfm?id=356593.356594&coll=Portal&dl=GUIDE&CFID=89172762&CFTOKEN=95662085

@article{Hoare1961, author = {Hoare, C. A. R.}, title = {Algorithm 64: Quicksort.}, journal = {Commun. ACM}, year = {1961}, volume = {4}, number = {7}, pages = {321}, url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b}, keywords = {64, algorithm, algorithmen, latexkurs, quicksort} }

%0 = article %A = Hoare, C. A. R. %D = 1961 %T = Algorithm 64: Quicksort. %U = http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b