Andreas Krebs Authors: Add personal information
 Affiliation history
Bibliometrics: publication history
SEARCH
ROLE
Author only

AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas

BOOKMARK & SHARE

 #resultstats2 { width:100%; padding: 10px; background-color:#ECE9D8; /*background:#9c9;*/ } #resultstats { width:100%; /*background-color:#ECE9D8;*/ font-size: 12px; /*background:#9c9;*/ } #resultstats a:link { text-decoration: none; } #resultstats div { padding-bottom: 5px; padding-top: 5px; } #resfound { background-color: #ece9d8; padding-left:5px } #searchtools { display:inline; float:right; padding-right: 10px; } #refinements { padding-top: 5px; } #refinements table { margin-left: 10px; } #refinements tr { vertical-align:top; } #refinements span { font-size: 12px; } .rectots { font-size:12px; } .problem { font-size:12px; color: red; } div.problem { height: 400px; } #results { /* float:right; */ /* width:80%; */ color: #000000; font-family: Verdana,Arial,Helvetica,sans-serif; font-size: 12px; padding-top: 10px; /*background:#9c9;*/ } #aggs { float:left; width:20%; font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; } #pagelogic { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:right; padding-bottom: 10px; } #pagerange { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:left; padding-bottom: 10px; } #resultmenu { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:right; padding-bottom: 10px; } #resultmenu label { margin-right: 0px; vertical-align:bottom; } #resultmenu input { margin-right: 0px; vertical-align:bottom; } #resultmenu select { margin-right: 0px; background-color: #aff; border: 0; border-radius: 0; font-size: 12px; } #resultmenu option { font-size: 12px; background-color: white; } .aggHead { font-weight: bold; padding-bottom: 0; padding-top: 10px; } #aggs ul{ list-style-type: none; margin-top: 0.25em; padding-left: 0; font-size: 1em; } #upcevents li{ padding-bottom: 1.25em; } #upcevents div{ margin-top: 25px; } a.showhide:link { text-decoration: none; } #results .numbering{ font-size: 12px; font-weight:bold; width:30px; float:left; text-align: right; padding-top: 2px; } #results .details{ font-size: 12px; width:92%; float:right; padding-bottom: 20px; } #results .title{ font-size: 14px; padding-bottom:5px; } #results .authors{ font-size: 12px; padding-bottom:5px; } #results .source{ font-size: 12px; padding-bottom:5px; } #results .publisher{ font-size: 12px; padding-bottom:5px; } #results .metrics{ font-size: 12px; padding-bottom:5px; } #results .metricsCol1{ float: left; display:inline; padding-bottom:5px; } #results .metricsCol2{ float: right; display: inline; width: 590px; padding-bottom:5px; } #results .ft{ font-size: 12px; padding-bottom:5px; } #results .abstract{ font-size: 12px; padding-bottom:5px; } #results .kw{ font-size: 12px; padding-bottom:5px; } #results .pubother{ font-size: 12px; padding-bottom:5px; } .izers { margin-top: 10px; margin-bottom:10px; } .highlights em{ background-color: #FFFF00; font-style: normal; } .publicationDate { background-color: #aff; } .citedCount { } .download6Weeks { } .download12Months { } .downloadAll { } 29 results found Export Results: bibtex | endnote | acmref | csv Result 1 – 20 of 29 Result page: 1 2 Sort by: relevance publication date citation count downloads (6 Weeks) downloads (12 months) downloads (overall) 1 July 2018 LICS '18: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science Publisher: ACM Bibliometrics: Citation Count: 0 Downloads (6 Weeks): 2,   Downloads (12 Months): 17,   Downloads (Overall): 17 Full text available: PDF It is an open problem whether definability in Propositional Dynamic Logic (PDL) on forests is decidable. Based on an algebraic characterization by Bojańczyk, et. al., (2012) in terms of forest algebras, Straubing (2013) described an approach to PDL based on a k-fold iterated distributive law. A proof that all languages ... 2 July 2018 Theory of Computing Systems: Volume 62 Issue 5, July 2018 Publisher: Springer-Verlag Bibliometrics: Citation Count: 0 The Parikh automaton model equips a finite automaton with integer registers and imposes a semilinear constraint on the set of their final settings. Here the theories of typed monoids and of rational series are used to characterize the language classes that arise algebraically. Complexity bounds are derived, such as containment ... Keywords: Automata, Circuits, Algebra, Monoids, Semilinear sets, Typed monoids 3 November 2017 ACM Transactions on Computational Logic (TOCL): Volume 18 Issue 4, December 2017 Publisher: ACM Bibliometrics: Citation Count: 0 Downloads (6 Weeks): 2,   Downloads (12 Months): 34,   Downloads (Overall): 34 Full text available: PDF We give an algebraic characterization, based on the bilateral semidirect product of finite monoids, of the quantifier alternation hierarchy in two-variable first-order logic on finite words. As a consequence, we obtain a new proof that this hierarchy is strict. Moreover, by application of the theory of finite categories, we are ... Keywords: Identities, FO2, J, Pseudovarities, Quantifier Alternation 4 May 2017 ACM SIGLOG News: Volume 4 Issue 2, April 2017 Publisher: ACM Bibliometrics: Citation Count: 0 Downloads (6 Weeks): 3,   Downloads (12 Months): 23,   Downloads (Overall): 66 Full text available: PDF Complexity theory and the theory of regular languages both belong to the branch of computer science where the use of resources in computing is the main focus. However, they operate at different levels. While complexity theory seeks to classify computational problems by resource use, such as space and time, regular ... 5 December 2016 Computational Complexity: Volume 25 Issue 4, December 2016 Publisher: Birkhauser Verlag Bibliometrics: Citation Count: 0 The problem of determining whether several finite automata accept a word in common is closely related to the well-studied membership problem in transformation monoids. We raise the issue of limiting the number of final states in the automata intersection problem. For automata with two final states, we show the problem ... Keywords: 68Q15, 68Q17, 68Q25, NP-complete, intersection problem, monoids, point-spread problem, 03D15, 68Q70, Finite automata, logspace 6 October 2016 ACM Transactions on Computation Theory (TOCT): Volume 9 Issue 1, December 2016 Publisher: ACM Bibliometrics: Citation Count: 0 Downloads (6 Weeks): 3,   Downloads (12 Months): 16,   Downloads (Overall): 85 Full text available: PDF A proof system for a language L is a function f such that Range( f ) is exactly L . In this article, we look at proof systems from a circuit complexity point of view and study proof systems that are computationally very restricted. The restriction we study is proof ... Keywords: Proof complexity, circuit complexity, proof circuits, small depth proofs 7 July 2016 DLT 2016: Proceedings of the 20th International Conference on Developments in Language Theory - Volume 9840 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 0 Logical formulas are naturally decomposed into their subformulas and circuits into their layers. How are these decompositions expressed in a purely language-theoretical setting? We address that question, and in doing so, introduce a product directly on languages that parallels formula composition. This framework makes an essential use of languages of ... Keywords: Circuits, Logic, Hyperwords, Descriptive complexity, Languages 8 July 2016 LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science Publisher: ACM Bibliometrics: Citation Count: 0 Downloads (6 Weeks): 1,   Downloads (12 Months): 20,   Downloads (Overall): 46 Full text available: PDF We study an extension of FO2[<], first-order logic interpreted in finite words, in which formulas are restricted to use only two variables. We adjoin to this language two-variable atomic formulas that say, 'the letter a appears between positions x and y'. This is, in a sense, the simplest property that ... 9 January 2016 Theoretical Computer Science: Volume 610 Issue PA, January 2016 Publisher: Elsevier Science Publishers Ltd. Bibliometrics: Citation Count: 1 We give a method for specifying ultrafilter equations and identify their projections on the set of profinite words. Let B be the set of languages captured by first-order sentences using unary predicates for each letter, arbitrary uniform unary numerical predicates and a predicate for the length of a word. We ... Keywords: Profinite equations, Regular languages, Ultrafilters, Formal languages, Stone duality 10 January 2016 Theoretical Computer Science: Volume 610 Issue PA, January 2016 Publisher: Elsevier Science Publishers Ltd. Bibliometrics: Citation Count: 0 We extend the # operator in a natural way and derive new types of counting complexity classes. While in the case of # C classes (where C could be some circuit-based class like NC 1 ) only proofs for acceptance of some input are being counted, one can also count ... Keywords: Branching programs, Arithmetization, Circuits, Counting 11 July 2015 LICS '15: Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Publisher: IEEE Computer Society Bibliometrics: Citation Count: 4 Downloads (6 Weeks): 0,   Downloads (12 Months): 4,   Downloads (Overall): 9 Full text available: PDF 12 April 2015 ACM Transactions on Computational Logic (TOCL): Volume 16 Issue 3, July 2015 Publisher: ACM Bibliometrics: Citation Count: 0 Downloads (6 Weeks): 2,   Downloads (12 Months): 14,   Downloads (Overall): 66 Full text available: PDF Given two structures G and H distinguishable in FO k (first-order logic with k variables), let A k ( G , H ) denote the minimum alternation depth of a FO k formula distinguishing G from H . Let A k ( n ) be the maximum value of A ... Keywords: Alternation hierarchy, finite-variable logic 13 September 2014 Designs, Codes and Cryptography: Volume 72 Issue 3, September 2014 Publisher: Kluwer Academic Publishers Bibliometrics: Citation Count: 0 We describe a new way to construct finite geometric objects. For every $$k$$ we obtain a symmetric configuration $$\mathcal{E }(k-1)$$ with $$k$$ points on a line. In particular, we have a constructive existence proof for such configurations. The method is very simple and purely geometric. It also produces interesting periodic ... Keywords: Lexicographic codes, 05B15, Configurations, Projective planes, 51E15, Greedy algorithms 14 August 2013 Theoretical Computer Science: Volume 501, August, 2013 Publisher: Elsevier Science Publishers Ltd. Bibliometrics: Citation Count: 0 Following recent works that connect two-variable logic to circuits and monoids, as well as recent techniques for obtaining algebraic and logical characterizations of threshold circuits, we present an algebraic and logical characterization of the language recognition power of uniform linear threshold circuits. More specifically, for numerical predicate sets P satisfying ... Keywords: Linear ciruits, Weakly blocked monoids, Two-variable logic, Bounded-depth circuits 15 May 2013 ACM Transactions on Computation Theory (TOCT): Volume 5 Issue 1, May 2013 Publisher: ACM Bibliometrics: Citation Count: 1 Downloads (6 Weeks): 3,   Downloads (12 Months): 14,   Downloads (Overall): 137 Full text available: PDF In this paper we initiate the study of proof systems where verification of proofs proceeds by NC 0 circuits. We investigate the question which languages admit proof systems in this very restricted model. Formulated alternatively, we ask which languages can be enumerated by NC 0 functions. Our results show that ... Keywords: Proof circuits, Proof complexity, small depth proofs, circuit complexity 16 October 2012 Algorithmica: Volume 64 Issue 2, October 2012 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 0 We give a #NC 1 upper bound for the problem of counting accepting paths in any fixed visibly pushdown automaton. Our algorithm involves a non-trivial adaptation of the arithmetic formula evaluation algorithm of Buss, Cook, Gupta and Ramachandran (SIAM J. Comput. 21:755---780, 1992). We also show that the problem is ... 17 October 2012 Algorithmica - Special Issue: Computing and Combinatorics: Volume 64 Issue 2, October 2012 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 0 We give a #NC 1 upper bound for the problem of counting accepting paths in any fixed visibly pushdown automaton. Our algorithm involves a non-trivial adaptation of the arithmetic formula evaluation algorithm of Buss, Cook, Gupta and Ramachandran (SIAM J. Comput. 21:755–780, 1992). We also show that the problem is ... 18 August 2012 MFCS'12: Proceedings of the 37th international conference on Mathematical Foundations of Computer Science Publisher: Springer-Verlag Bibliometrics: Citation Count: 0 The effect of severely tightening the uniformity of Boolean circuit families is investigated. The impact on NC 1 and its subclasses is shown to depend on the characterization chosen for the class, while classes such as P appear to be more robust. Tightly uniform subclasses of NC 1 whose separation ... 19 June 2012 LICS '12: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science Publisher: IEEE Computer Society Bibliometrics: Citation Count: 1 Downloads (6 Weeks): 1,   Downloads (12 Months): 7,   Downloads (Overall): 70 Full text available: PDF We consider first-order logic with monoidal quantifiers over words. We show that all languages with a neutral letter, definable using the addition predicate are also definable with the order predicate as the only numerical predicate. Let S be a subset of monoids. Let L be the logic closed under quantification ... Keywords: descriptive complexity, logic on words, crane-beach conjecture, extended first-order logic 20 August 2011 MFCS'11: Proceedings of the 36th international conference on Mathematical foundations of computer science Publisher: Springer-Verlag Bibliometrics: Citation Count: 0 We study the streaming complexity of the membership problem of 1-turn-Dyck 2 and Dyck 2 when there are a few errors in the input string. 1-turn-Dyck 2 with errors: We prove that there exists a randomized one-pass algorithm that given x checks whether there exists a string x ′ ∈ ...