Zurück zur Übersicht
Exportieren als [feed] RSS 1.0 [feed] RSS 2.0

Zitation

Gruppieren nach: Dokumenttyp | Erscheinungsjahr | Keine Sortierung
Anzahl der Einträge: 13.

Egloffstein, Marc ORCID: https://orcid.org/0000-0002-2377-7889, Hünemohr, Holger and Ifenthaler, Dirk ORCID: https://orcid.org/0000-0002-2446-6548 Modularization of open online courses on the eGov-Campus : Prospects and challenges. Meinel, Christoph, Schweiger, Stefanie, Staubitz, Thomas, Conrad, Robert, Alario Hoyos, Carlos, Ebner, Martin, Sancassani, Susanna, Żur, Agnieszka, Friedl, Christian, Halawa, Sherif, Gamage, Dilrukshi, Cross, Jeffrey, Carlon, May, Deville, Yves, Gaebel, Michael, Delgado Kloos, Carlos and Schmieden, Karen von 105-112 In: EMOOCs 2023 (2023) Potsdam EMOOCs 2023 - The European MOOCs Stakeholder Summit (Potsdam, Germany) [Konferenzveröffentlichung]

Şahin, Muhittin, Egloffstein, Marc ORCID: https://orcid.org/0000-0002-2377-7889, Bothe, Max, Rohloff, Tobias, Schenk, Nathanael, Schwerer, Florian and Ifenthaler, Dirk ORCID: https://orcid.org/0000-0002-2446-6548 Behavioral patterns in enterprise MOOCs at openSAP. Meinel, Christoph, Staubitz, Thomas, Schweiger, Stefanie, Friedl, Christian, Kiers, Janine, Ebner, Martin, Lorenz, Anja, Ubachs, George, Mongenet, Catherine, Ruipérez Valiente, José A., Cortes Mendez, Manoel, Merceron, Agathe and Schmieden, Karen von 281-288 In: EMOOCs 2021 : 22 - 24 June, 2021, Hasso Plattner Institute, Online Conference (2021) Potsdam EMOOCs 2021 (Online) [Konferenzveröffentlichung]

Ludwig, Sabrina ORCID: https://orcid.org/0000-0002-2920-7561, Rausch, Andreas ORCID: https://orcid.org/0000-0002-0749-2496, Deutscher, Viola ORCID: https://orcid.org/0000-0002-9714-6465 and Seifried, Jürgen ORCID: https://orcid.org/0000-0002-9460-7721 Problem solving analytics (PSA) in the web-based office simulation LUCA. Meinel, Christoph 363-364 In: Proceedings of the Eighth ACM Conference on Learning Scale (2021) New York L@S '21, Learning at Scale (Online) [Konferenzveröffentlichung]

Damm, Carsten, Krause, Matthias, Meinel, Christoph and Waack, Stephan (2004) On relations between counting communication complexity classes. Journal of Computer and System Sciences : JCSS San Diego, CA [u.a.] 69 2 259-280 [Zeitschriftenartikel]

Damm, Carsten, Krause, Matthias, Meinel, Christoph and Waack, Stephan (1994) Separating oblivious linear length MODp-branching program classes. Journal of Information Processing and Cybernetics Giessen 30 2 63-75 [Zeitschriftenartikel]

Hromkovič, Juraj, Krause, Matthias, Meinel, Christoph and Waack, Stephan (1992) Branching programs provide lower bounds on the areas of multilective deterministic and nondeterministic VLSI-circuits. Information and Computation Amsterdam [u.a.] 96 2 168-178 [Zeitschriftenartikel]

Damm, Carsten, Krause, Matthias, Meinel, Christoph and Waack, Stephan Separating counting communication complexity classes. Finkel, Alain and Jantzen, Matthias Lecture Notes in Computer Science 577 279-292 In: STACS 92 : 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13 - 15, 1992, proceedings (1992) Berlin [u.a.] STACS 92 (Cachan, France) [Konferenzveröffentlichung]

Krause, Matthias, Meinel, Christoph and Waack, Stephan (1992) Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines. RAIRO. Theoretical Informatics and Applications Les Ulis 26 4 345-362 [Zeitschriftenartikel]

Damm, Carsten, Krause, Matthias, Meinel, Christoph and Waack, Stephan (1992) Separating counting communication complexity classes. Forschungsbericht / Universität Trier, Mathematik, Informatik Trier 92-01 [Arbeitspapier]

Krause, Matthias, Meinel, Christoph and Waack, Stephan (1991) Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe. Theoretical Computer Science Amsterdam [u.a.] 86 2 267-275 [Zeitschriftenartikel]

Krause, Matthias, Meinel, Christoph and Waack, Stephan Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines. Young, Paul 240-249 In: Structure in complexity theory : Fourth Annual Conference, June 19 - 22, 1989, University of Oregon, Eugene, Oregon, proceedings (1989) Washington, DC [u.a.] 4th Annual Conference on Structure in Complexity Theory (Eugene, OR) [Konferenzveröffentlichung]

Krause, Matthias, Meinel, Christoph and Waack, Stephan Separating complexity classes related to restricted logarithmic space-bounded Turing machines. Ritter, Gerhard X. IFIP congress series 11 287-292 In: Information Processing 89 : Proceedings of the IFIP 11th World Computer Congress, San Francisco, U.S.A., August 28 - September 1, 1989 (1989) Amsterdam [u.a.] IFIP '89 (San Francisco, CA) [Konferenzveröffentlichung]

Krause, Matthias, Meinel, Christoph and Waack, Stephan Separating the eraser turing machine classes Le, NLe, co-NLe and Pe. Chytil, Michal P., Janiga, Ladislav and Koubek, Václav Lecture Notes in Computer Science 324 405-413 In: Mathematical Foundations of Computer Science 1988 : proceedings of the 13th Symposium, Carlsbad, Czechoslovakia, August 29 – September 2, 1988 (1988) Berlin [u.a.] MFCS '88 (Carlsbad, Czechoslovakia) [Konferenzveröffentlichung]

Diese Liste wurde am Thu May 2 01:37:24 2024 CEST automatisch erstellt.