Einloggen

Thematische Bibliographien / GRAFIK (Computer program language) / Dissertationen

Dissertationen zum Thema „GRAFIK (Computer program language)“

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: GRAFIK (Computer program language).

Autor: Grafiati

Veröffentlicht am 25. Juli 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "GRAFIK (Computer program language)" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Stratton, David. „A program visualisation meta language“. Thesis, University of Ballarat, 2003. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/63588.

Der volle Inhalt der Quelle

Annotation:

The principle motivation of this work is to define an open PV architecture that will enable a variety of visualisation schemes to interoperate and that will encourage the generation of PV systems and research into their efficacy. Ultimately this may lead to more effective pedagogy in the field of computer programming and hence remove a barrier to students entering the profession.
Doctorate of Philosophy

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Shepherd, David. „Natural language program analysis combining natural language processing with program analysis to improve software maintenance tools /“. Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 176 p, 2007. http://proquest.umi.com/pqdweb?did=1397920371&sid=6&Fmt=2&clientId=8331&RQT=309&VName=PQD.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Chou, Robert Shih-pei. „A program design language for COBOL“. Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/13200.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Richardson, Joel E. „E a persistent systems implementation language /“. Madison, Wis. : University of Wisconsin-Madison, Computer Sciences Dept, 1989. http://catalog.hathitrust.org/api/volumes/oclc/20839601.html.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Gordon, Christopher Todd. „A visual language for ADA program unit specifications“. Thesis, This resource online, 1990. http://scholar.lib.vt.edu/theses/available/etd-06232009-063007/.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Martin, Walter E. „Cview, a graphical program generator for the C programming language /“. Online version of thesis, 1988. http://hdl.handle.net/1850/10224.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Leoutsarakos, Nikolaos. „A context sensitive command language /“. Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63274.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Yessenov, Kuat T. „A lightweight specification language for bounded program verification“. Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53184.

Der volle Inhalt der Quelle

Annotation:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 63-64).
This thesis presents a new light-weight specification language called JForge Specification Language (JFSL) for object-oriented languages such as Java. The language is amenable to bounded verification analysis by a tool called JForge that interprets JFSL specifications, fully integrates with a mainstream development environment, and assists programmers in examining counter example traces and debugging specifications. JFSL attempts to address challenges of specification languages such as inheritance, frame conditions, dynamic dispatch, and method calls inside specifications in the context of bounded verification. A collection of verification tasks illustrates the expressiveness and conciseness of JForge specifications and demonstrates effectiveness of the bounded verification technique.
by Kuat T. Yessenov.
M.Eng.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Gibson, Barbara Brunner. „Ada as a design specification language /“. Online version of thesis, 1988. http://hdl.handle.net/1850/10215.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Ouren, Leslie Serine. „Integrating computer software within the Houghton Mifflin Language Arts program“. CSUSB ScholarWorks, 2005. https://scholarworks.lib.csusb.edu/etd-project/2918.

Der volle Inhalt der Quelle

Annotation:

This project was created for third grade teachers who use the Houghton Mifflin Language Arts series and want to integrate computer software into their writing curriculum. The website created includes all the writing assignments that the students are to complete and the required software used to complete the assignment.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Trachsel, Anne Roberta. „L-EQUEL : an embedded query language for Franz LISP“. Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9884.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Koh, Kyu Han Seals Cheryl D. „PineHill a novel approach to computer aided language learning /“. Auburn, Ala., 2007. http://hdl.handle.net/10415/1365.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Yildiz, Faruk. „Implementation of a human avatar for the MARG project in networked virtual environments“. Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Mar%5FYildiz.pdf.

Der volle Inhalt der Quelle

Annotation:

Thesis (M.S. in Modeling, Virtual Environments and Simulation (MOVES))--Naval Postgraduate School, March 2004.
Thesis advisor(s): Xiaoping Yun. Includes bibliographical references (p. 61-62). Also available online.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Calnan, Paul W. „EXTRACT, Extensible Transformation and Compiler Technology“. Link to electronic thesis, 2003. http://www.wpi.edu/Pubs/ETD/Available/etd-0429103-152947.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Pimentel, Richard. „Direct Simulation from a Model Specification Language“. DigitalCommons@USU, 1986. https://digitalcommons.usu.edu/etd/6985.

Der volle Inhalt der Quelle

Annotation:

The purpose of this thesis was to develop a program that would accept, as input, a finite set of algebraic equations and simple if-then conditional expressions that model a natural system, and then produce a continuous computer simulation with graphics and tabular output. The equations and conditionals can be in any order and key elements can be missing. The program can be used to run existing models or as a development tool to produce immediate prototypic computer simulations through synergistic man-machine interactions. The theoretical aspects of automatic program generation were discussed, as well as the architectural design of the system. The simulation system was used to develop a computer simulation of an exploited Northern Utah pheasant population and the results were compared to the results from an earlier FORTRAN computer simulation of the same model. It was concluded that the simulation system developed for this thesis produces verified computer simulations from mathematical models that are at least as accurate as the corresponding simulation written in FORTRAN. The system was easy to use and should be useful for unsophisticated users. Some "tuning'' of the input was needed to produce a verified simulation and it was concluded that further work was needed here.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Miller, Ruane. „A study of PostScript as a graphics programming language /“. Online version of thesis, 1988. http://hdl.handle.net/1850/11483.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Chan, Chi-hown Johnny. „Implementation of computer simulation software in learning low-level computer language : a case study /“. Hong Kong : University of Hong Kong, 2001. http://sunzi.lib.hku.hk/hkuto/record.jsp?B24700770.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Kenyon, John L. „CHIMP the C/C++ hybrid imperative meta-programmer /“. abstract and full text PDF (free order & download UNR users only), 2008. http://0-gateway.proquest.com.innopac.library.unr.edu/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1453647.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Mosca, Peter. „A study of Ada and C in concurrent programming“. Instructions for remote access. Click here to access this electronic resource. Access available to Kutztown University faculty, staff, and students only, 1991. http://www.kutztown.edu/library/services/remote_access.asp.

Der volle Inhalt der Quelle

Annotation:

Thesis (M.S.)--Kutztown University of Pennsylvania, 1991.
Source: Masters Abstracts International, Volume: 45-06, page: 3190. Abstract precedes thesis as [1] preliminary leaf. Typescript. Includes bibliographical references (leaf 54).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Motwani, Manjula H. „An Occam2 implementation of Prolog /“. Online version of thesis, 1994. http://hdl.handle.net/1850/12175.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Bull, Tim. „Software maintenance by program transformation in a wide spectrum language“. Thesis, Durham University, 1994. http://etheses.dur.ac.uk/5494/.

Der volle Inhalt der Quelle

Annotation:

This thesis addresses the software maintenance problem of extracting high-level designs from code. The investigated solution is to use a mathematically-based formal program transformation system. The resulting tool, the Maintainer's Assistant, is based on Ward's [177] WSL (wide spectrum language) and method of proving program equivalence. The problems addressed include: how to reverse engineer from code alone (the only reliable source of information about a program [158]), how to express program transformations within the system, what kinds of transformations should be incorporated, how to make the tool simple to use, how to perform abstraction and how to create a tool suitable for use with large programs. Using the Maintainer's Assistant, the program code is automatically translated into WSL and the transformations, although tested for valid applicability by the system, are interactively applied by the user. Notable features include a mathematical simplifier, a large flexible transformation catalogue and, significantly, the use of an extension of WSL, A4etaWSL, for representing the transformations. MetaWSL expands WSL by incorporating a variety of extensions, including: program editing statements, pattern matching and template filling functions, symbolic mathematics and logic functions, statements for moving within the program’s syntax tree and statements for repeating an operation at each node of the tree. Using MetaWSL, 80% of the 601 transformations can be expressed in less than 20 program statements. The Maintainer's Assistant has been used on a wide variety of examples of up to several thousand lines, including commercial software written in IBM 370 assembler. It has been possible to transform initially unstructured programs into a hierarchy of procedures, facilitating subsequent design recovery. These results show that program transformation is a viable method of renovating old (370 assembler) code in a cost elective way, and that MetaWSL provides an effective basis for clearly and concisely expressing the required transformations.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Nagulakonda, Vikram. „Assertion seeding development of program instrumentation through iterative formal analysis /“. Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=1080.

Der volle Inhalt der Quelle

Annotation:

Thesis (M.S.)--West Virginia University, 1999.
Title from document title page. Document formatted into pages; contains v, 80 p. : ill. Includes abstract. Includes bibliographical references (p. 33-35).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Tollefson, Bradley A. „The J-shell command language interpreter“. Virtual Press, 1985. http://liblink.bsu.edu/uhtbin/catkey/506686.

Der volle Inhalt der Quelle

Annotation:

A command language interpreter (CLI) translates commands entered by the user into system actions. The shell is a specific type of CLI that was originally designed and used with UNIX operating systems.The author proposes to design and implement a shell-like CLI on top of the VMS operating system. The shell will enhance VMS features by providing an easier to use syntax and by providing features that are not currently available through VMS. These features include piping facilities and the ability to enter and/or reference multiple commands from a single command line. A language reference manual is provided with the J-shell. This manual explains the features and commands of the J-shell.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Barrett, Kirk. „A program development system using an attribute grammar“. Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9821.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Wright, Madeleine. „A detailed investigation of interoperability for web services“. Thesis, Rhodes University, 2006. http://hdl.handle.net/10962/d1004832.

Der volle Inhalt der Quelle

Annotation:

The thesis presents a qualitative survey of web services' interoperability, offering a snapshot of development and trends at the end of 2005. It starts by examining the beginnings of web services in earlier distributed computing and middleware technologies, determining the distance from these approaches evident in current web-services architectures. It establishes a working definition of web services, examining the protocols that now seek to define it and the extent to which they contribute to its most crucial feature, interoperability. The thesis then considers the REST approach to web services as being in a class of its own, concluding that this approach to interoperable distributed computing is not only the simplest but also the most interoperable. It looks briefly at interoperability issues raised by technologies in the wider arena of Service Oriented Architecture. The chapter on protocols is complemented by a chapter that validates the qualitative findings by examining web services in practice. These have been implemented by a variety of toolkits and on different platforms. Included in the study is a preliminary examination of JAX-WS, the replacement for JAX-RPC, which is still under development. Although the main language of implementation is Java, the study includes services in C# and PHP and one implementation of a client using a Firefox extension. The study concludes that different forms of web service may co-exist with earlier middleware technologies. While remaining aware that there are still pitfalls that might yet derail the movement towards greater interoperability, the conclusion sounds an optimistic note that recent cooperation between different vendors may yet result in a solution that achieves interoperability through core web-service standards.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Yu, Henry 1961. „HPSIMC: AHPL SIMULATOR IMPLEMENTED IN C LANGUAGE (PARSER, SOFTWARE)“. Thesis, The University of Arizona, 1986. http://hdl.handle.net/10150/291313.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Chow, Kent. „GPLOT : a language for plotting graphs“. Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66062.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Lindstrom, Lowell Richard. „The implementation of a SIMULA compiler on the Kansas State University Perkin-Elmer computers“. Thesis, Kansas State University, 1986. http://hdl.handle.net/2097/9934.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Firth, Michael Anthony. „A fold/unfold transformation system for a non-strict language“. Thesis, University of York, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.280416.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Pope, Bernard James. „A declarative debugger for Haskell /“. Connect to thesis, 2006. http://eprints.unimelb.edu.au/archive/00003290.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Vorvick, Janet. „Evaluable Functions in the Godel Programming Language: Parsing and Representing Rewrite Rules“. PDXScholar, 1995. https://pdxscholar.library.pdx.edu/open_access_etds/5195.

Der volle Inhalt der Quelle

Annotation:

The integration of a functional component into a logic language extends the expressive power of the language. One logic language which would benefit from such an extension is Godel, a prototypical language at the leading edge of the research in logic programming. We present a modification of the Godel parser which enables the parsing of evaluable functions in Godel. As the first part of an extended Godel, the parser produces output similar to the output from the original Godel parser, ensuring that Godel modules are properly handled by the extended-Godel parser. Parser output is structured to simplify, as much as possible, the future task of creating an extended compiler implementing evaluation of functions using narrowing. We describe the structure of the original Godel parser, the objects produced by it, the modifications made for the implementation of the extended Godel and the motivation for those modifications. The ultimate goal of this research is production of a functional component for Godel which evaluates user-defined functions with needed narrowing, a strategy which is sound, complete, and optimal for inductively sequential rewrite systems.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Parsa, Saeed. „Design and specification of a program specification language for engineering applications“. Thesis, University of Salford, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.357026.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Marsh, David William Roff. „Program refinement using a universal law : language specification and prototype tool“. Thesis, University of Southampton, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.312873.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Barrett, Mark Douglas. „Teaching language arts in third grade with HyperStudio, an interactive computer program“. CSUSB ScholarWorks, 1991. https://scholarworks.lib.csusb.edu/etd-project/849.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Coleman, Jesse J. „The design, construction, and implementation of an engineering software command processor and macro compiler /“. Online version of thesis, 1995. http://hdl.handle.net/1850/12219.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Widjaja, Hendra. „Visor++ : a software visualisation tool for task-parallel object-orientated programs“. Title page, abstract and contents only, 1998. http://web4.library.adelaide.edu.au/theses/09AS/09asw639.pdf.

Der volle Inhalt der Quelle

Annotation:

Bibliography: leaves 173-184. This thesis describes Visor++, a tool for visualising programs written in CC++, a task-parallel, object-orientated language derived from C++. Visor++ provides a framework of visualising task-parallel object-orientated programs in the absence of language support for visualisation, i.e. for programs such as CC++ which are written in languages which are not "visualisation-conscious". The development of techniques using a wide selection of language features are described and the effectiveness testified by experimentation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Haugh, J. Steven. „The design of a virtual fact base for Prolog“. Master's thesis, This resource online, 1991. http://scholar.lib.vt.edu/theses/available/etd-02022010-020103/.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Gunnlaugsson, Bjorgvin. „Concurrency and sharing in prolog and in a picture editor for aldat“. Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63864.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Duffy, Sandra Lee. „PEDIT-- a resident structure editor for PROLOG“. Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9833.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Librers, Joseph. „A module declaration generator“. Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9861.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Dodge, Nathan. „Course development for a college Java programming class“. [Denver, Colo.] : Regis University, 2005. http://165.236.235.140/lib/NDodge2005.pdf.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Schmitt, Susan M. „A critical examination of the relationship between the memory requirements of structured BASIC and unstructured BASIC“. Instructions for remote access. Click here to access this electronic resource. Access available to Kutztown University faculty, staff, and students only, 1985. http://www.kutztown.edu/library/services/remote_access.asp.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Wang, Jian. „Pointer analysis in Java programs using execution path information /“. View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?CSED%202008%20WANG.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Laliberté, Normand. „Design and implementation of a primary memory version of ALDAT, including recursive relations“. Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=65497.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

黃介亮 und Kai-leung Adam Wong. „On improving the alternation construct in occam“. Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1996. http://hub.hku.hk/bib/B31213741.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Radhakrishnan, Ramesh. „Microarchitectural techniques to enable efficient Java execution /“. Digital version accessible at:, 2000. http://wwwlib.umi.com/cr/utexas/main.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Wong, Kai-leung Adam. „On improving the alternation construct in occam /“. Hong Kong : University of Hong Kong, 1996. http://sunzi.lib.hku.hk/hkuto/record.jsp?B17537071.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Calnan, III Paul W. „EXTRACT: Extensible Transformation and Compiler Technology“. Digital WPI, 2003. https://digitalcommons.wpi.edu/etd-theses/484.

Der volle Inhalt der Quelle

Annotation:

Code transformation is widely used in programming. Most developers are familiar with using a preprocessor to perform syntactic transformations (symbol substitution and macro expansion). However, it is often necessary to perform more complex transformations using semantic information contained in the source code. In this thesis, we developed EXTRACT; a general-purpose code transformation language. Using EXTRACT, it is possible to specify, in a modular and extensible manner, a variety of transformations on Java code such as insertion, removal, and restructuring. In support of this, we also developed JPath, a path language for identifying portions of Java source code. Combined, these two technologies make it possible to identify source code that is to be transformed and then specify how that code is to be transformed. We evaluate our technology using three case studies: a type name qualifier which transforms Java class names into fully-qualified class names; a contract checker which enforces pre- and post-conditions across behavioral subtypes; and a code obfuscator which mangles the names of a class's methods and fields such that they cannot be understood by a human, without breaking the semantic content of the class.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Ballard, Mark B. „QUICKTALK : a Smalltalk-80 dialect for defining primitive methods /“. Full text open access at:, 1986. http://content.ohsu.edu/u?/etd,99.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Eitzen, Benjamin. „GpuPy : efficiently using a GPU with Python“. Online access for everyone, 2007. http://www.dissertations.wsu.edu/Thesis/Summer2007/b_eitzen_082307.pdf.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!