The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "MFCS"( http://dblp.L3S.de/Venues/MFCS )

URL (DBLP): http://dblp.uni-trier.de/db/conf/mfcs

Publication years (Num. hits)
1973 (51) 1974 (44) 1975 (61) 1976 (79) 1977 (62) 1978 (52) 1979 (58) 1980 (54) 1981 (58) 1984 (58) 1986 (63) 1988 (54) 1989 (53) 1990 (63) 1991 (44) 1992 (51) 1993 (69) 1994 (55) 1995 (55) 1996 (46) 1997 (52) 1998 (83) 1999 (42) 2000 (66) 2001 (62) 2002 (54) 2003 (63) 2004 (71) 2005 (70) 2006 (70) 2007 (67) 2008 (51) 2009 (64) 2010 (62) 2011 (55) 2012 (72) 2013 (74) 2016 (91) 2017 (87) 2018 (86) 2019 (85)
Publication types (Num. hits)
inproceedings(2516) proceedings(41)
Venues (Conferences, Journals, ...)
MFCS(2557)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 309 occurrences of 239 keywords

Results
Found 2557 publication records. Showing 2557 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Victor Chepoi, Arnaud Labourel, Sébastien Ratel Distance Labeling Schemes for Cube-Free Median Graphs. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sandra Kiefer, Daniel Neuen The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Raphaël Clifford, Pawel Gawrychowski, Tomasz Kociumaka, Daniel P. Martin 0001, Przemyslaw Uznanski RLE Edit Distance in Near Optimal Time. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ziyuan Gao, Sanjay Jain 0001, Bakhadyr Khoussainov, Wei Li 0050, Alexander G. Melnikov, Karen Seidel 0001, Frank Stephan 0001 Random Subgroups of Rationals. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov Picking Random Vertices (Invited Talk). Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Titouan Carette, Dominic Horsman, Simon Perdrix SZX-Calculus: Scalable Graphical Quantum Reasoning. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Olivier Bournez, Arnaud Durand 0001 Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1C. Ramya, B. V. Raghavendra Rao Lower Bounds for Multilinear Order-Restricted ABPs. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Philip Bille, Inge Li Gørtz From Regular Expression Matching to Parsing. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jan Böker, Yijia Chen, Martin Grohe, Gaurav Rattan The Complexity of Homomorphism Indistinguishability. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Paul C. Bell, Mika Hirvensalo Acceptance Ambiguity for Quantum Automata. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Esther Galby, Paloma T. Lima, Bernard Ries Reducing the Domination Number of Graphs via Edge Contractions. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Emanuel Kieronski One-Dimensional Guarded Fragments. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Erich Grädel, Svenja Schalthöfer Choiceless Logarithmic Space. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Evripidis Bampis, Bruno Escoffier, Alexandre Teiller Multistage Knapsack. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen (eds.) 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  BibTeX  RDF
1Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi 0001, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa The Perfect Matching Reconfiguration Problem. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Athanasios L. Konstantinidis, Charis Papadopoulos Cluster Deletion on Interval Graphs and Split Related Graphs. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Christoph Berkholz, Nicole Schweikardt Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular Width. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Victor Lagerkvist, Gustav Nordh On the Strength of Uniqueness Quantification in Primitive Positive Formulas. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Markus Lohrey, Armin Weiß The Power Word Problem. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Amirhossein Kazeminia, Andrei A. Bulatov Counting Homomorphisms Modulo a Prime Number. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eva Fluck Tangles and Single Linkage Hierarchical Clustering. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pierre Clairambault, Andrzej S. Murawski On the Expressivity of Linear Recursion Schemes. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sankardeep Chakraborty, Kunihiko Sadakane Indexing Graph Search Trees and Applications. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Daniel Danielski, Emanuel Kieronski Finite Satisfiability of Unary Negation Fragment with Transitivity. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Christian Coester, Lukasz Jez, Elias Koutsoupias Better Bounds for Online Line Chasing. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Pallavi Jain 0001, Lawqueen Kanesh, Saket Saurabh 0001 Parameterized Complexity of Conflict-Free Matchings and Paths. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1 Front Matter, Table of Contents, Preface, Conference Organization. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mathieu Hoyrup, Donald M. Stull Semicomputable Points in Euclidean Spaces. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Henning Fernau, Vladimir V. Gusev, Stefan Hoffmann 0001, Markus Holzer 0001, Mikhail V. Volkov, Petra Wolf 0002 Computational Complexity of Synchronization under Regular Constraints. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Erhard Aichinger Solving Systems of Equations in Supernilpotent Algebras. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Carl Einarson, Felix Reidl Domination Above r-Independence: Does Sparseness Help? Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alberto Dennunzio, Enrico Formenti, Darij Grinberg, Luciano Margara Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno, Kunihiro Wasa Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Florent Koechlin, Cyril Nicaud, Pablo Rotondo Uniform Random Expressions Lack Expressivity. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Julian Dörfler, Marc Roth, Johannes Schmitt, Philip Wellnitz Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Surender Baswana, Shiv Kumar Gupta, Ayush Tulsyan Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Andrei A. Bulatov, Stanislav Zivny Approximate Counting CSP Seen from the Other Side. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Diego Figueira, Varun Ramanathan, Pascal Weil The Quantifier Alternation Hierarchy of Synchronous Relations. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alexandra Silva 0001 Guarded Kleene Algebra with Tests: Verification of Uninterpreted Programs in Nearly Linear Time (Invited Talk). Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Barnaby Martin, Daniël Paulusma, Siani Smith Colouring H-Free Graphs of Bounded Diameter. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski New Pumping Technique for 2-Dimensional VASS. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nathan Lhote, Vincent Michielini, Michal Skrzypczak Uniformisation Gives the Full Strength of Regular Languages. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Anantha Padmanabha, R. Ramanujam Two variable fragment of Term Modal Logic. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Torben Hagerup A Constant-Time Colored Choice Dictionary with Almost Robust Iteration. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Telikepalli Kavitha Popular Matchings: Good, Bad, and Mixed (Invited Talk). Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Titus Dose P-Optimal Proof Systems for Each NP-Set but no Complete Disjoint NP-Pairs Relative to an Oracle. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Ray Li Enumeration of Preferred Extensions in Almost Oriented Digraphs. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla Spectral Aspects of Symmetric Matrix Signings. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ke Chen 0011, Adrian Dumitrescu, Wolfgang Mulzer, Csaba D. Tóth On the Stretch Factor of Polygonal Chains. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marcin Bienkowski, Hsiang-Hsuan Liu An Improved Online Algorithm for the Traveling Repairperson Problem on a Line. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Haruka Mizuta, Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou Reconfiguration of Minimum Steiner Trees via Vertex Exchanges. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pawel Parys Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hoàng-Oanh Le, Van Bang Le Constrained Representations of Map Graphs and Half-Squares. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pierre Ganty, Elena Gutiérrez, Pedro Valero 0001 A Congruence-based Perspective on Automata Minimization Algorithms. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Zeev Nutov, Guy Kortsarz, Eli Shalom Approximating Activation Edge-Cover and Facility Location Problems. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Magnús M. Halldórsson, Murilo Santos de Lima Query-Competitive Sorting with Uncertainty. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jérôme Leroux Petri Net Reachability Problem (Invited Talk). Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Radovan Cervený, Ondrej Suchý Faster FPT Algorithm for 5-Path Vertex Cover. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Anselm Haak, Juha Kontinen, Fabian Müller 0003, Heribert Vollmer, Fan Yang 0004 Counting of Teams in First-Order Team Logics. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jessica Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mohammad Abdulaziz, Kurt Mehlhorn, Tobias Nipkow Trustworthy Graph Algorithms (Invited Talk). Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dusan Knop, Tomás Masarík, Tomás Toufar Parameterized Complexity of Fair Vertex Evaluation Problems. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Patricia Bouyer, Nathan Thomasset Nash Equilibria in Games over Graphs Equipped with a Communication Mechanism. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nathalie Aubrun, Sebastián Barbieri, Etienne Moutot The Domino Problem is Undecidable on Surface Groups. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Christian Konrad, Viktor Zamaraev Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Stefan Kiefer, Cas Widdershoven Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sougata Bose, Shankara Narayanan Krishna, Anca Muscholl, Vincent Penelle, Gabriele Puppis On Synthesis of Resynchronizers for Transducers. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ian Pratt-Hartmann, Lidia Tendera The Fluted Fragment with Transitivity. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lars Jaffke, Paloma T. Lima A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Manfred Droste, Paul Gastin Aperiodic Weighted Automata and Weighted First-Order Logic. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michal Garlík Resolution Lower Bounds for Refutation Statements. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner Finding Optimal Solutions With Neighborly Help. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Joel D. Day, Florin Manea, Dirk Nowotka Upper Bounds on the Length of Minimal Solutions to Certain Quadratic Word Equations. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nikhil Gupta, Chandan Saha 0001 On the Symmetries of and Equivalence Test for Design Polynomials. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michele Boreale On the Coalgebra of Partial Differential Equations. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ishay Haviv Approximating the Orthogonality Dimension of Graphs and Hypergraphs. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Paul C. Bell, Igor Potapov, Pavel Semukhin On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Théodore Lopez, Benjamin Monmege, Jean-Marc Talbot Determinisation of Finitely-Ambiguous Copyless Cost Register Automata. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Stéphane Bessy, Marin Bougeret, R. Krithika 0001, Abhishek Sahu, Saket Saurabh 0001, Jocelyn Thiebaut, Meirav Zehavi Packing Arc-Disjoint Cycles in Tournaments. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Guy Avni, Thomas A. Henzinger, Dorde Zikelic Bidding Mechanisms in Graph Games. Search on Bibsonomy MFCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Peter Dixon, Aduri Pavan, N. V. Vinodchandran On Pseudodeterministic Approximation Algorithms. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ninad Rajgopal, Rahul Santhanam, Srikanth Srinivasan 0001 Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Aris Pagourtzis, Tomasz Radzik Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bill Fefferman, Shelby Kimmel Quantum vs. Classical Proofs and Subset Verification. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi 0001, Subhash Suri Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Konrad K. Dabrowski, Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Pallavi Jain 0001, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh 0001 Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Léo Exibard, Emmanuel Filiot, Ismaël Jecker The Complexity of Transducer Synthesis from Multi-Sequential Specifications. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Andre Droschinsky, Nils M. Kriege, Petra Mutzel Largest Weight Common Subtree Embeddings with Distance Penalties. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger Graph Similarity and Approximate Isomorphism. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Cedric Berenger, Peter Niebert, Kévin Perrot Balanced Connected Partitioning of Unweighted Grid Graphs. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Christian Doczkal, Damien Pous Treewidth-Two Graphs as a Free Algebra. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Guillaume Burel Linking Focusing and Resolution with Selection. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Louis-Marie Dando, Sylvain Lombardy On Hadamard Series and Rotating Q-Automata. Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). Search on Bibsonomy MFCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 2557 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license