Wikibooks:Vorlagen/ Quellenangaben
Quellenangaben InterWiki
BearbeitenBibliographische Quellenangaben
BearbeitenFür das Zitieren gedruckter oder anderweitig erschienener Werke, stehen die folgenden Vorlagen zur Verfügung. Deren Namensgebung und deren Parameter orientieren sich an den üblichen BibTEX Makros. Es existieren verschiedene Bibtex-Styles. Als Ausgangspunkt für die Formatierung diente "alpha.bst". In Online Medien sind darüber hinaus weitere Möglichkeiten vorhanden, die sich durch die HTML-Syntax ergeben. Das Ziel ist eine möglichst hohe Kompatibilität zu BibTEX, insbesondere bei den Vorlagenparametern zu erreichen. Dieses Vorgehen soll insbesondere eine Migration in Richtung gedruckter Bücher vereinfachen.
Was man eintippt | Was daraus entsteht |
---|---|
{{Cite article}} | author. “title”. journal, year. |
{{Cite article |author=C. E. Shannon |title=Probability of error for optimal codes in a Gaussian channel |year=1959 |journal=Bell Syst. Tech. J. |month=May |volume=38 |pages=611–656}} | C. E. Shannon. “Probability of error for optimal codes in a Gaussian channel”. Bell Syst. Tech. J., 38:611–656, May 1959. |
{{Cite article |author=Marco A. Marra et al |title=The Genome Sequence of the SARS-Associated coronavirus |url=http://www.sciencemag.org/cgi/content/full/300/5624/1399 |journal=Science |year=2003 |month=May |volume=300 |number=5624 |pages=1399–1404 |doi=10.1126/science.1085953 }} | Marco A. Marra et al. “The Genome Sequence of the SARS-Associated coronavirus”. Science, 300(5624):1399–1404, May 2003. DOI:10.1126/science.1085953. |
{{Cite book| }} | author or editor. title. publisher, year. |
{{Cite book|author=Randolph Nelson |title = Probability, Stochastic Processes and Queueing Theory |year = 1995 |publisher = Springer }} | Randolph Nelson. Probability, Stochastic Processes and Queueing Theory. Springer, 1995. |
{{Cite book| title = Proceedings of the Sixth International Workshop on Inductive Logic Programming |url=http://www.springer.de/cgi-bin/bag_generate.pl?ISBN=3-540-63494-0 |editor = S. Muggleton |year=1997 |publisher=Springer-Verlag |note = LNAI 1314 |address = Berlin}} | S. Muggleton. Proceedings of the Sixth International Workshop on Inductive Logic Programming. Springer-Verlag, Berlin, 1997. |
{{Cite booklet}} | title., . |
{{Cite booklet |author = Alan Cox |title = Declaration in the United States District Court for the District of New Jersey |month = Aug |year = 2001 |url = http://www.eff.org/IP/DMCA/Felten_v_RIAA/20010813_cox_decl.html |note = Case No.~CV-01-2669~(GEB)}} | Alan Cox. Declaration in the United States District Court for the District of New Jersey., Aug 2001. |
{{Cite conference| }} | author. title. booktitle, year. |
{{Cite inbook| }} | author or editor. title, chapter and/or pages. publisher, year. |
{{Cite inbook|author =Donald E. Knuth |title =Fundamental Algorithms |publisher =Addison-Wesley |year = 1973 |chapter = 1.2}} | Donald E. Knuth. Fundamental Algorithms, 1.2. Addison-Wesley, 1973. |
{{Cite inbook|author = Donald E. Knuth |title = Fundamental Algorithms |volume = 1 |series = The Art of Computer Programming |publisher = Addison-Wesley |address = Reading, Massachusetts |edition = Second |month = Jan, |year = 1973 |type = Section |chapter = 1.2 |pages = 10–119 |note=This is a full INBOOK entry (language = english), |language = english}} | Donald E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming, Section 1.2, pages 10–119. Addison-Wesley, Reading, Massachusetts, Second edition, Jan, 1973. |
{{Cite incollection| }} |
|
{{Cite inproceedings| }} | author. title. booktitle, year. |
{{Cite inproceedings|author = Alfred V. Oaho and Jeffrey D. Ullman and Mihalis Yannakakis |title = On Notions of Information Transfer in VLSI Circuits |booktitle = Proc. Fifteenth Annual ACM Symposium on the Theory of Computing |year = 1983}} | Alfred V. Oaho and Jeffrey D. Ullman and Mihalis Yannakakis. ”On Notions of Information Transfer in VLSI Circuits”. In Proc. Fifteenth Annual ACM Symposium on the Theory of Computing, 1983. |
{{Cite inproceedings|author = Alfred V. Oaho and Jeffrey D. Ullman and Mihalis Yannakakis |title = On Notions of Information Transfer in VLSI Circuits |editor = Wizard V. Oz and Mihalis Yannakakis |booktitle = Proc. Fifteenth Annual ACM Symposium on the Theory of Computing |number = 17 |series = All ACM Conferences |pages = 133—139 |month = March |year = 1983 |address = Boston |organization = The Association for Computing Machinery |publisher = Academic Press |note = This is a full INPROCEDINGS entry }} | Alfred V. Oaho and Jeffrey D. Ullman and Mihalis Yannakakis. ”On Notions of Information Transfer in VLSI Circuits”. In Wizard V. Oz and Mihalis Yannakakis, editor(s), Proc. Fifteenth Annual ACM Symposium on the Theory of Computing, number 17 in All ACM Conferences, pages 133—139, Boston, March 1983. The Association for Computing Machinery, Academic Press. This is a full INPROCEDINGS entry. |
{{Cite journal| }} | author. “title”. journal, year. (Siehe unter: cite article) |
{{Cite journal| |author=Nunez E, Kwon YS, Hutt KR, ''et al'' |title=Nuclear receptor-enhanced transcription requires motor- and LSD1-dependent gene networking in interchromatin granules |journal=Cell |volume=134 |issue=1 |pages=189 |year=2008 |month=July |pmid=18630350 |doi= |url= }} | Nunez E, Kwon YS, Hutt KR, et al. “Nuclear receptor-enhanced transcription requires motor- and LSD1-dependent gene networking in interchromatin granules”. Cell, 134:189, July 2008. PMID 18630350. |
{{Cite manual| }} | Cite manual (todo) |
{{Cite masterthesis| }} | Cite masterthesis (todo) |
{{Cite phdthesis| }} | Cite phdthesis (todo) |
{{Cite proceedings| }} | Cite proceedings (todo) |
{{Cite techreport| }} | author. “title”. Technical report, institution, year. |
{{Cite techreport| author = Tom Térrific | title = An <math>O(n \log n / \! \log\log n)</math> Sorting Algorithm | institution = Fanstord University | year = 1988}} | Tom Térrific. “An Sorting Algorithm”. Technical report, Fanstord University, 1988. |
{{Cite techreport| author = Tom Térrific | title = An <math>O(n \log n / \! \log\log n)</math> Sorting Algorithm | institution = Fanstord University | type = Wishful Research Result | number = 7 | address = Computer Science Department, Fanstord, California | month = oct | year = 1988 | note = This is a full TECHREPORT entry}} | Tom Térrific. “An Sorting Algorithm”. Wishful Research Result 7, Fanstord University, Computer Science Department, Fanstord, California, oct 1988. This is a full TECHREPORT entry. |
{{DOI|10.1000/182}} | DOI:10.1000/182 |
{{ISSN|0938-8303}} | ISSN 0938-8303 |