2.4k citations
- P. Zoller5 profiles42 · h 121
- H. Briegel31 · h 62
- H. Ritsch30 · h 47
- S. Schindler5 profiles27 · h 40
- R. Grimm2 profiles25 · h 52
- O. Reimer2 profiles20 · h 108
- A. Reimer2 profiles19 · h 120
- J. Denschlag19 · h 35
- R. Blatt4 profiles18 · h 76
- C. Cecchi3 profiles16 · h 110
- C. Favuzzi3 profiles16 · h 115
- D. Bastieri3 profiles16 · h 128
- Austrian Academy of SciencesAT122 papers
- Institute for Quantum Optics and Quantum Information InnsbruckAT119 papers
- Centre National de la Recherche ScientifiqueFR37 papers
- Université Paris CitéFR28 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR27 papers
- CEA Paris-SaclayFR26 papers
- Stockholm UniversitySE25 papers
- École PolytechniqueFR24 papers
- Institut de Recherche sur les Lois Fondamentales de l'UniversFR24 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR23 papers
- Heidelberg UniversityDE21 papers
- Laboratoire Leprince-RinguetFR21 papers
Showing 2011 · cs.LOShow all
3 papers · 2 filters
cs.LO2011★ 2 cited
Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity
Georg Moser, Andreas Schnabl
We study the derivational complexity of rewrite systems whose termination is provable in the dependency pair framework using the processors for reduction pairs, dependency graphs,…
cs.LO2011★ 4 cited
Uncurrying for Innermost Termination and Derivational Complexity
Harald Zankl, Nao Hirokawa, Aart Middeldorp
First-order applicative term rewriting systems provide a natural framework for modeling higher-order aspects. In earlier work we introduced an uncurrying transformation which is te…
cs.LO2011
Automated Complexity Analysis Based on the Dependency Pair Method
Nao Hirokawa, Georg Moser
This article is concerned with automated complexity analysis of term rewrite systems. Since these systems underlie much of declarative programming, time complexity of functions def…