The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Markus Holzer" ( http://dblp.L3S.de/Authors/Markus_Holzer )

URL (Homepage):  http://www.informatik.uni-giessen.de/staff/holzer/  Author page on DBLP  Author page in RDF  Community of Markus Holzer in ASPL-2

Publication years (Num. hits)
1992-1997 (16) 1998-2000 (15) 2001-2002 (15) 2003-2004 (20) 2005-2006 (20) 2007 (15) 2008-2009 (25) 2010-2011 (32) 2012 (1)
Publication types (Num. hits)
article(67) inproceedings(88) proceedings(4)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 6 occurrences of 3 keywords

Results
Found 159 publication records. Showing 159 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Markus Holzer, Sebastian Jakobi, Martin Kutrib The Magic Number Problem for Subregular Language Families. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Martin Beaudry, Markus Holzer On the size of inverse semigroups given by generators. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Felix Brandt, Felix A. Fischer, Markus Holzer Equilibria of graphical games with symmetries. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Martin Kutrib, Andreas Malcher Complexity of multi-head finite automata: Origins and directions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Martin Kutrib The Complexity of Regular(-like) Expressions. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Martin Kutrib Descriptional and computational complexity of finite automata - A survey. Search on Bibsonomy Inf. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Henning Bordihn, Markus Holzer, Martin Kutrib Decidability of operation problems for T0L languages and subclasses. Search on Bibsonomy Inf. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto Preface. Search on Bibsonomy Fundam. Inform. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Andreas Klein, Martin Kutrib, Oliver Ruepp Computational Complexity of NURIKABE. Search on Bibsonomy Fundam. Inform. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Sebastian Jakobi Chop Operations and Expressions: Descriptional Complexity Considerations. Search on Bibsonomy Developments in Language Theory The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Martin Kutrib, Ursula Leiter Nodes Connected by Path Languages. Search on Bibsonomy Developments in Language Theory The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Maurice H. ter Beek, Erzsébet Csuhaj-Varjú, Markus Holzer, György Vaszil Cooperating Distributed Grammar Systems: Components with Nonincreasing Competence. Search on Bibsonomy Computation, Cooperation, and Life The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Sebastian Haas, Rene Donner, Andreas Burner, Markus Holzer, Georg Langs Superpixel-Based Interest Points for Effective Bags of Visual Words Medical Image Retrieval. Search on Bibsonomy MCBR-CDS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1René Donner, Sebastian Haas, Andreas Burner, Markus Holzer, Horst Bischof, Georg Langs Evaluation of Fast 2D and 3D Medical Image Retrieval Approaches Based on Image Miniatures. Search on Bibsonomy MCBR-CDS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andreas Burner, Rene Donner, Marius Mayerhoefer, Markus Holzer, Franz Kainberger, Georg Langs Texture Bags: Anomaly Retrieval in Medical Images Based on Local 3D-Texture Similarity. Search on Bibsonomy MCBR-CDS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano (eds.) Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18 - July 19, 2011. Proceedings Search on Bibsonomy NCMA The full citation details ... 2011 DBLP  BibTeX  RDF
1Markus Holzer, Sebastian Jakobi, Martin Kutrib The Chop of Languages. Search on Bibsonomy AFL The full citation details ... 2011 DBLP  BibTeX  RDF
1Markus Holzer, Martin Kutrib, Giovanni Pighizzini (eds.) Descriptional Complexity of Formal Systems - 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings Search on Bibsonomy DCFS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Martin Kutrib Gaining Power by Input Operations: Finite Automata and Beyond. Search on Bibsonomy CIAA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Martin Kutrib, Katja Meckel Nondeterministic State Complexity of Star-Free Languages. Search on Bibsonomy CIAA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Andreas Maletti An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Henning Bordihn, Jürgen Dassow, Markus Holzer Extending regular expressions with homomorphic replacement. Search on Bibsonomy RAIRO - Theor. Inf. and Applic. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Sebastian Jakobi, Martin Kutrib The Magic Number Problem for Subregular Language Families Search on Bibsonomy DCFS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Felix Brandt, Felix A. Fischer, Markus Holzer On Iterated Dominance, Matrix Elimination, and Matched Paths Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Felix Brandt, Felix A. Fischer, Markus Holzer On Iterated Dominance, Matrix Elimination, and Matched Paths. Search on Bibsonomy STACS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Martin Kutrib Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata. Search on Bibsonomy RP The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Martin Kutrib The Complexity of Regular(-Like) Expressions. Search on Bibsonomy Developments in Language Theory The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Pierre McKenzie The Computational Complexity of RaceTrack. Search on Bibsonomy FUN The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Oliver Ruepp, Markus Holzer The Computational Complexity of the Kakuro Puzzle, Revisited. Search on Bibsonomy FUN The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Henning Bordihn, Rudolf Freund, Markus Holzer, Thomas Hinze, Martin Kutrib, Friedrich Otto (eds.) Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23 - August 24, 2010. Proceedings Search on Bibsonomy NCMA The full citation details ... 2010 DBLP  BibTeX  RDF
1Markus Holzer, Frank Schumacher, Thomas Greiner, Wolfgang Rosenstiel Shape independent VLSI-architecture design approach for 2D morphological operations with non-flat structuring elements. Search on Bibsonomy ICECS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Martin Kutrib Cellular Automata and the Quest for Nontrivial Artificial Self-Reproduction. Search on Bibsonomy Int. Conf. on Membrane Computing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Ruben Bartholomä, Thomas Greiner, Wolfgang Rosenstiel Orthogonal shift level comparison reuse for structuring element shape independent VLSI-Architectures of 2D morphological operations. Search on Bibsonomy SoCC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Henning Bordihn, Markus Holzer, Martin Kutrib Determination of finite automata accepting subregular languages. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer Language operations with regular expressions of polynomial size. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Franziska Biegler, Mark Daley, Markus Holzer, Ian McQuillan On the uniqueness of shuffle on words and finite languages. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Martin Kutrib Nondeterministic Finite Automata - Recent Results on the Descriptional and Computational Complexity. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib On input-revolving deterministic and nondeterministic finite automata. Search on Bibsonomy Inf. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer, Martin Kutrib More on the Size of Higman-Haines Sets: Effective Constructions. Search on Bibsonomy Fundam. Inform. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer, Martin Kutrib On Measuring Non-Recursive Trade-Offs Search on Bibsonomy DCFS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Felix Brandt, Felix A. Fischer, Markus Holzer Symmetries and the complexity of pure Nash equilibrium. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Henning Bordihn, Markus Holzer, Martin Kutrib Undecidability of Operation Problems for T0L Languages and Subclasses. Search on Bibsonomy LATA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Martin Kutrib Descriptional and Computational Complexity of Finite Automata. Search on Bibsonomy LATA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer Tight Bounds on the Descriptional Complexity of Regular Expressions. Search on Bibsonomy Developments in Language Theory The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Henning Bordihn, Rudolf Freund, Markus Holzer, Martin Kutrib, Friedrich Otto (eds.) Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31 - September 1, 2009. Proceedings Search on Bibsonomy NCMA The full citation details ... 2009 DBLP  BibTeX  RDF
1Hermann Gruber, Markus Holzer, Michael Tautschnig Short Regular Expressions from Finite Automata: Empirical Results. Search on Bibsonomy CIAA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Andreas Maletti An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton. Search on Bibsonomy CIAA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Henning Bordihn, Markus Holzer A note on cooperating distributed grammar systems working in combined modes. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Felix Brandt, Felix A. Fischer, Markus Holzer On Iterated Dominance, Matrix Elimination, and Matched Paths. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2008 DBLP  BibTeX  RDF
1Markus Holzer, Martin Kutrib, Andreas Malcher Multi-Head Finite Automata: Characterizations, Concepts and Open Problems Search on Bibsonomy CSP The full citation details ... 2008 DBLP  BibTeX  RDF
1Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib Deterministic Input-Reversal and Input-Revolving Finite Automata. Search on Bibsonomy LATA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Henning Bordihn, Markus Holzer Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems. Search on Bibsonomy LATA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Felix Brandt, Felix A. Fischer, Markus Holzer Equilibria of Graphical Games with Symmetries. Search on Bibsonomy WINE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer Finite Automata, Digraph Connectivity, and Regular Expression Size. Search on Bibsonomy ICALP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer Provably Shorter Regular Expressions from Deterministic Finite Automata. Search on Bibsonomy Developments in Language Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer Language Operations with Regular Expressions of Polynomial Size. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Henning Bordihn, Markus Holzer, Martin Kutrib State Complexity of NFA to DFA Conversion of Subregular Language Families. Search on Bibsonomy DCFS The full citation details ... 2008 DBLP  BibTeX  RDF
1Markus Holzer, Martin Kutrib Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity. Search on Bibsonomy CIAA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Felix Brandt, Felix A. Fischer, Markus Holzer Equilibria of Graphical Games with Symmetries. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Hermann Gruber, Markus Holzer, Martin Kutrib The size of Higman-Haines sets. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer On the average state and transition complexity of finite languages. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Maurice H. ter Beek, Erzsébet Csuhaj-Varjú, György Vaszil, Markus Holzer On Competence in CD Grammar Systems with Parallel Rewriting. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Henning Bordihn, Markus Holzer, Martin Kutrib Hybrid Extended Finite Automata. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Henning Bordihn, Markus Holzer Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited. Search on Bibsonomy Fundam. Inform. The full citation details ... 2007 DBLP  BibTeX  RDF
1Martin Beaudry, Markus Holzer The Complexity of Tensor Circuit Evaluation. Search on Bibsonomy Computational Complexity The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Subject classification. 15A69, 68Q70, 68Q17, 68Q15, 68Q05
1Markus Holzer, Martin Kutrib, Jens Reimann Non-Recursive Trade-Offs for Deterministic Restarting Automata. Search on Bibsonomy Journal of Automata, Languages and Combinatorics The full citation details ... 2007 DBLP  BibTeX  RDF
1Hermann Gruber, Markus Holzer Computational Complexity of NFA Minimization for Finite and Unary Languages. Search on Bibsonomy LATA The full citation details ... 2007 DBLP  BibTeX  RDF
1Felix Brandt, Felix A. Fischer, Markus Holzer Symmetries and the Complexity of Pure Nash Equilibrium. Search on Bibsonomy STACS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer, Martin Kutrib More on the Size of Higman-Haines Sets: Effective Constructions. Search on Bibsonomy MCU The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Henning Bordihn, Markus Holzer, Martin Kutrib Hairpin Finite Automata. Search on Bibsonomy Developments in Language Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP. Search on Bibsonomy Developments in Language Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer, Oliver Ruepp Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms. Search on Bibsonomy FUN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Oliver Ruepp The Troubles of Interior Design-A Complexity Analysis of the Game Heyawake. Search on Bibsonomy FUN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Felix A. Fischer, Markus Holzer, Stefan Katzenbeisser The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer Finding Lower Bounds for Nondeterministic State Complexity is Hard. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Felix Brandt, Felix A. Fischer, Markus Holzer Symmetries and the Complexity of Pure Nash Equilibrium. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Henning Bordihn, Henning Fernau, Markus Holzer, Vincenzo Manca, Carlos Martín-Vide Iterated sequential transducers as language generating devices. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Henning Bordihn, Markus Holzer Programmed grammars and their relation to the LBA problem. Search on Bibsonomy Acta Inf. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Programmed grammars, Accepting grammars, LBA problem, Degree of non-regulation, Leftmost derivations
1Markus Holzer, Martin Kutrib Variable Complexity of Simple Programs. Search on Bibsonomy Fundam. Inform. The full citation details ... 2006 DBLP  BibTeX  RDF
1Erzsébet Csuhaj-Varjú, Jürgen Dassow, Markus Holzer CD grammar systems with competence based entry conditions in their cooperation protocols. Search on Bibsonomy Int. J. Comput. Math. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer Finding Lower Bounds for Nondeterministic State Complexity Is Hard. Search on Bibsonomy Developments in Language Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract). Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Markus Holzer, Martin Kutrib The Size of Higman-Haines Sets. Search on Bibsonomy DCFS The full citation details ... 2006 DBLP  BibTeX  RDF
1Henning Bordihn, Markus Holzer, Martin Kutrib Hybrid Extended Finite Automata. Search on Bibsonomy CIAA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Martin Beaudry, José M. Fernandez, Markus Holzer A common algebraic description for probabilistic and quantum computations, . Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Martin Kutrib On the descriptional complexity of finite automata with modified acceptance conditions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Henning Bordihn, Markus Holzer, Martin Kutrib Unsolvability levels of operation problems for subclasses of context-free languages. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Jürgen Dassow, Markus Holzer Language families defined by a ciliate bio-operation: hierarchies and decision problems. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Henning Fernau, Rudolf Freund, Markus Holzer Representations of Recursively Enumerable Array Languages by Contextual Array Grammars. Search on Bibsonomy Fundam. Inform. The full citation details ... 2005 DBLP  BibTeX  RDF
1Markus Holzer, Friedrich Otto Shrinking Multi-pushdown Automata. Search on Bibsonomy FCT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Henning Bordihn, Markus Holzer, Martin Kutrib Revolving-Input Finite Automata. Search on Bibsonomy Developments in Language Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Hermann Gruber, Markus Holzer, Astrid Kiehn, Barbara König On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization. Search on Bibsonomy Developments in Language Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Martin Kutrib, Jens Reimann Descriptional Complexity of Deterministic Restarting Automata. Search on Bibsonomy DCFS The full citation details ... 2005 DBLP  BibTeX  RDF
1Markus Holzer, Barbara König On deterministic finite automata and syntactic monoid size. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Stefan Schwoon Assembling molecules in ATOMIX is hard. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Henning Bordihn, Markus Holzer, Martin Kutrib Economy of Description for Basic Constructions on Rational Transductions. Search on Bibsonomy Journal of Automata, Languages and Combinatorics The full citation details ... 2004 DBLP  BibTeX  RDF
1Markus Holzer, Barbara König Regular Languages, Sizes of Syntactic Monoids, Graph Colouring, State Complexity Results, and How These Topics are Related to Each Other (Column: Formal Language Theory). Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2004 DBLP  BibTeX  RDF
1Markus Holzer, Waltraud Holzer TantrixTM rotation puzzles are intractable. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Martin Beaudry, José M. Fernandez, Markus Holzer A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract). Search on Bibsonomy MFCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Markus Holzer, Martin Kutrib Register Complexity of LOOP-, WHILE-, and GOTO-Programs. Search on Bibsonomy MCU The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 159 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.