| 000692 (2007) |
Henning Fernau [Allemagne] | LEARNING TREE LANGUAGES FROM TEXT |
| 000406 (2010) |
Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne] ; Serge Gaspers [Autriche] ; Mathieu Liedloff [France] | Exact exponential-time algorithms for finding bicliques |
| 000687 (2007) |
Laurent Fousse [France] | Multiple-precision correctly rounded newton-cotes quadrature |
| 000695 (2007) |
Guillaume Melquiond [France] ; Sylvain Pion [France] | Formally certified floating-point filters for homogeneous geometric predicates |
| 000E83 (1998) |
C. Damm [Allemagne] | On Boolean vs. modular arithmetic for circuits and communication protocols |
| 001031 (1997) |
S. Jukna [Allemagne] ; A. Razborov [Russie] ; P. Savicky [République tchèque] ; I. Wegener [Allemagne] | On P versus NP∩co-NP for decision trees and read-once branching programs |
| 001334 (1994) |
J. Gergov [Allemagne] ; Christoph Meinel [Allemagne] | On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs |
| 000299 (2011) |
Michael R. Fellows [Australie] ; Henning Fernau [Allemagne] | Facility location problems: A parameterized view |
| 000333 (2011) |
Henning Fernau [Allemagne] ; Joachim Kneis [Allemagne] ; Dieter Kratsch [France] ; Alexander Langer [Allemagne] ; Mathieu Liedloff [France] ; Daniel Raible [Allemagne] ; Peter Rossmanith [Allemagne] | An exact algorithm for the Maximum Leaf Spanning Tree problem |
| 000375 (2010) |
Henning Fernau [Allemagne] | Parameterized algorithms for d-HITTING SET: The weighted case |
| 000497 (2009) |
Henning Fernau [Allemagne] ; Juan A. Rodriguez [Espagne] ; José M. Sigarreta [Mexique] | Offensive r-alliances in graphs |
| 000555 (2009) |
Henning Fernau [Allemagne] | Algorithms for learning regular expressions from positive data |
| 000601 (2008) |
Henning Fernau [Allemagne] | Parameterized algorithmics for linear arrangement problems |
| 000673 (2007) |
| Real numbers |
| 000679 (2007) |
Stef Graillat [France] ; Philippe Langlois [France] | Real and complex pseudozero sets for polynomials with applications |
| 000684 (2007) |
XIZHONG ZHENG [République populaire de Chine, Allemagne] | On the hierarchies of Δ02-real numbers |
| 000696 (2007) |
Florent De Dinechin [France] ; Christoph Lauter [France] ; Jean-Michel Muller [France] | Fast and correctly rounded logarithms in double-precision |
| 000700 (2007) |
Henning Fernau [Allemagne] ; Klaus Reinhardt [Allemagne] ; Ludwig Staiger [Allemagne] | Decidability of code properties |
| 000702 (2007) |
Nicolas Brisebarre [France] ; Jean-Michel Muller [France] | Correct rounding of algebraic functions |
| 000707 (2007) |
Benoit Cagnard [France] ; Pierre Simonnet [France] | Automata, borel functions and real numbers in pisot base |
| 000B86 (2001) |
Jürgen Forster [Allemagne] ; Matthias Krause [Allemagne] ; Satyanarayana V. Lokam [États-Unis] ; Rustam Mubarakzjanov [Allemagne] ; Niels Schmitt [Allemagne] ; Hans Ulrich Simon [Allemagne] | Relations between communication complexity, linear arrangements, and computational complexity |
| 000C06 (2001) |
Christoph Meinel [Allemagne] ; Christian Stangier [Allemagne] | Data structures for Boolean functions BDDs: Foundations and applications |
| 000C73 (2000) |
R. J. Gardner [États-Unis] ; P. Gritzmann [Allemagne] ; D. Prangenberg [Allemagne] | On the computational complexity of determining polyatomic structures by X-rays |
| 000C89 (2000) |
Christoph Meinel [Allemagne] ; F. Somenzi ; T. Theobald | Linear sifting of decision diagrams and its application in synthesis |
| 000D72 (1999) |
Christoph Meinel [Allemagne] ; T. Theobald [Allemagne] | On the influence of the state encoding on OBDD-representations of finite state machines |
| 000D73 (1999) |
A. Bernasconi [Allemagne] ; C. Damm [Allemagne] ; I. E. Shparlinski [Australie] | On the average sensitivity of testing square-free numbers |
| 000D98 (1999) |
C. Damm [Allemagne] | Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones |
| 000E59 (1998) |
C. W. Kessler [Allemagne] | Scheduling expression DAGs for minimal register need |
| 000E76 (1998) |
M. Mundhenk [Allemagne] ; A. Slobodova [Allemagne] | Optimal non-approximability of MAXCLIQUE |
| 000E79 (1998) |
A. Slobodova [Allemagne] | On the composition problem for OBDDs with multiple variable orders |
| 000F93 (1997) |
K. Jansen [Allemagne] | The optimum cost chromatic partition problem |
| 000F99 (1997) |
M. Mundhenk [Allemagne] ; J. Goldsmith [États-Unis] ; E. Allender [États-Unis] | The complexity of policy evaluation for finite-horizon partially-observable Markov decision processes |
| 001028 (1997) |
Christoph Meinel [Allemagne] ; T. Theobald [Allemagne] | On the influence of the state encoding on OBDD-representations of finite state machines |
| 001034 (1997) |
M. Mundhenk [Allemagne] | NP-hard sets have many hard instances |
| 001052 (1997) |
K. Jansen [Allemagne] ; P. Scheffler [Allemagne] | Generalized coloring for tree-like graphs |
| 001083 (1997) |
Christoph Meinel [Allemagne] ; A. Slobodova [Allemagne] | A reducibility concept for problems defined in terms of ordered binary decision diagrams |
| 001287 (1995) |
S. Jukna [Allemagne] | Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates |
| 001342 (1994) |
J. Gergov [Allemagne] ; Christoph Meinel [Allemagne] | Efficient boolean manipulation with OBDD's can be extended to FBDD's |
| 001397 (1993) |
K. Jansen [Allemagne] | Scheduling with constrained processor allocation for interval orders |
| 001420 (1993) |
P. Gritzmann [Allemagne] ; V. Klee | Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces |
| 000198 (2012) |
Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne] | Parameterized Measure & Conquer for Problems with No Small Kernels |
| 000334 (2011) |
Sushil Bikhchandani [États-Unis] ; Sven De Vries [Allemagne] ; James Schummer [États-Unis] ; Rakesh V. Vohra [États-Unis] | An Ascending Vickrey Auction for Selling Bases of a Matroid |
| 000339 (2011) |
Holger Heuer [Allemagne] ; Qodiah Solehati [Allemagne] ; Ute Zimmerling [Allemagne] ; Kristina Kleineidam [Allemagne] ; Michael Schloter [Allemagne] ; Tanja Müller [Allemagne] ; Andreas Focks [Allemagne] ; Soren Thiele-Bruhn [Allemagne] ; Kornelia Smalla [Allemagne] | Accumulation of Sulfonamide Resistance Genes in Arable Soils Due to Repeated Application of Manure Containing Sulfadiazine |
| 000394 (2010) |
T. Kalmes [Allemagne] | Hypercyclicity and mixing for cosine operator functions generated by second order partial differential operators |
| 000405 (2010) |
Niklaus Stulz [États-Unis] ; Robert Gallop [États-Unis] ; Wolfgang Lutz [Allemagne] ; Glenda L. Wrenn [États-Unis] ; Paul Crits-Christoph [États-Unis] | Examining differential effects of psychosocial treatments for cocaine dependence: An application of latent trajectory analyses |
| 000416 (2010) |
L. Bernal-Gonzalez [Espagne] ; M. C. Calderon-Moreno [Espagne] ; W. Luh [Allemagne] | Dense-lineability of sets of Birkhoff-universal functions with rapid decay |
| 000496 (2009) |
J. M. Sigarreta [Mexique] ; S. Bermudo [Espagne] ; Henning Fernau [Allemagne] | On the complement graph and defensive k-alliances |
| 000602 (2008) |
JIANER CHEN [États-Unis] ; Henning Fernau [Allemagne] ; Iyad A. Kanj [États-Unis] ; GE XIA [États-Unis] | PARAMETRIC DUALITY AND KERNELIZATION : LOWER BOUNDS AND UPPER BOUNDS ON KERNEL SIZE |
| 000605 (2008) |
Ralf Kiisters [Allemagne] ; Anupam Datta [États-Unis] ; John C. Mitchell [États-Unis] ; Ajith Ramanathan [États-Unis] | On the Relationships between Notions of Simulation-Based Security |
| 000611 (2008) |
L. Bernal-Gonzalez [Espagne] ; M. C. Calderon-Moreno [Espagne] ; W. Luh [Allemagne] | Large linear manifolds of noncontinuable boundary-regular holomorphic functions |
| 000617 (2008) |
JIONG GUO [Allemagne] ; Rolf Niedermeier [Allemagne] ; Daniel Raible [Allemagne] | Improved Algorithms and Complexity Results for Power Domination in Graphs |
| 000649 (2008) |
Jürgen Dassow [Allemagne] ; Henning Fernau [Allemagne] | Comparison of some descriptional complexities of 0L systems obtained by a unifying approach |
| 000755 (2006) |
Faisal N. Abu-Khzam [Liban] ; Henning Fernau [Allemagne] | Kernels : Annotated, proper and induced |
| 000756 (2006) |
Henning Bordihn [Allemagne] ; Henning Fernau [Allemagne] ; Markus Holzer [Allemagne] ; Vincenzo Manca [Italie] ; Carlos Martin-Vide [Espagne] | Iterated sequential transducers as language generating devices |
| 000895 (2004) |
Volker Schulz [Allemagne] | Simultaneous solution approaches for large optimization problems |
| 000A39 (2003) |
Rainer Hüsken [Allemagne] ; Robert Fechner [Allemagne] | Sehende" Roboter in der Giesserei: Anwendung und Nutzen |
| 000A57 (2002) |
Christoph Meinel [Allemagne] ; Harald Sack [Allemagne] ; Arno Wagner [Suisse] | WWW.BDD-Portal.ORG: An experimentation platform for binary decision diagram algorithms |
| 000A87 (2002) |
Flemming Nielson [Danemark] ; Hanne Riis Nielson [Danemark] ; Helmut Seidl [Allemagne] | Normalizable Horn clauses, strongly recognizable relations, and Spi |
| 000B03 (2002) |
Ivan Janotka [Slovaquie] ; Stefan Kiss [Slovaquie] ; Radovan Baslik [Slovaquie] | Geosynthetic mat Tatrabent-development, production and application |
| 000B14 (2002) |
Stefan N Her [Allemagne] ; Oliver Zlotowski [Allemagne] | Design and implementation of efficient data types for static graphs |
| 000C09 (2001) |
M. Fahl [Allemagne] | Computation of POD basis functions for fluid flows with Lanczos methods |
| 000C74 (2000) |
M. Mundhenk [Allemagne] | On hard instances |
| 000C85 (2000) |
V. Arvind [Inde] ; J. Köbler [Allemagne] ; M. Mundhenk [Allemagne] ; J. Toran [Allemagne] | Nondeterministic instance complexity and hard-to-prove tautologies |
| 000D09 (2000) |
H. Seidl [Allemagne] ; B. Steffen [Allemagne] | Constraint-based inter-procedural analysis of parallel programs |
| 000D10 (2000) |
M. Mundhenk [Allemagne] | Complexity of optimal small policies |
| 000D11 (2000) |
M. Mundhenk [Allemagne] ; J. Goldsmith ; C. Lusena ; E. Allender | Complexity of finite-horizon Markov decision process problems |
| 000D13 (2000) |
N. V. Thoai [Allemagne] | Class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem |
| 000D74 (1999) |
H. Seidl [Allemagne] ; A. Neumann [Allemagne] | On guarding nested fixpoints |
| 000D76 (1999) |
C. Damm [Allemagne] ; KI HANG KIM [États-Unis] ; F. Roush [États-Unis] | On covering and rank problems for Boolean matrices and their applications |
| 000D83 (1999) |
S. Jukna [Allemagne, Lituanie] | Linear codes are hard for oblivious read-once parity branching programs |
| 000D85 (1999) |
C. W. Kessler [Allemagne] ; J. L. Traeff | Language and library support for practical PRAM programming |
| 000E60 (1998) |
A. Slobodova [États-Unis, Slovaquie] ; Christoph Meinel [Allemagne] | Sample method for minimization of OBDDs |
| 000E81 (1998) |
S. Jukna [Allemagne, Lituanie] ; S. Zak [République tchèque] | On branching programs with bounded uncertainty |
| 000E89 (1998) |
A. Neumann [Allemagne] ; H. Seidl [Allemagne] | Locating matches of tree patterns in forests |
| 000F01 (1998) |
A. Czumaj [Allemagne] ; P. Kanarek [Pologne] ; M. Kutyłowski [Allemagne] ; K. Lorys [Allemagne] | Fast generation of random permutations via networks simulation |
| 000F13 (1998) |
H. Seidl [Allemagne] ; M. H. S Rensen [Danemark] | Constraints to stop deforestation |
| 000F88 (1997) |
Christoph Meinel [Allemagne] ; A. Slobodov | Unifying theoretical background for some BDD-based data structures |
| 001067 (1997) |
C. Kaklamanis [Grèce] ; P. Persiano [Italie] ; T. Erlebach [Allemagne] ; K. Jansen [Allemagne] | Constrained bipartite edge coloring with applications to wavelength routing |
| 001074 (1997) |
K. Jansen [Allemagne] | Approximation results for the optimum cost chromatic partition problem |
| 001075 (1997) |
K. Jansen [Allemagne] ; S. Öhring [États-Unis] | Approximation algorithms for time constrained scheduling |
| 001076 (1997) |
C. W. Kessler [Allemagne] | Applicability of program comprehension to sparse matrix computations |
| 001087 (1997) |
K. Jansen [Allemagne] ; J. Reiter [Allemagne] | A new approximation algorithm for the register allocation problem |
| 001191 (1996) |
J. Bern [Allemagne] ; Christoph Meinel [Allemagne] ; A. Slobodova [Allemagne] | Some heuristics for generating tree-like FBDD types |
| 001199 (1996) |
V. Arvind [Inde] ; J. Köbler [Allemagne] ; M. Mundhenk [Allemagne] | Monotonous and randomized reductions to sparse sets |
| 001203 (1996) |
M. Kutylowski [Allemagne] ; K. Lorys [Allemagne] | Limitations of the QRQW and EREW PRAM models |
| 001209 (1996) |
J. Bern [Allemagne] ; Christoph Meinel [Allemagne] ; A. Slobodova [Allemagne] | Global rebuilding of OBDD's avoiding memory requirement maxima |
| 001212 (1996) |
H. Seidl [Allemagne] | Fast and simple nested fixpoints |
| 001291 (1995) |
S. Jukna [Allemagne] | A note on read-k times branching programs |
| 001395 (1993) |
R. Hettich [Allemagne] ; K. O. Kortanek | Semi-infinite programming: theory, methods, and applications |
| 001408 (1993) |
P. Gritzmann [Allemagne] ; B. Sturmfels | Minkowski addition of polytopes: computational complexity and applications to Gröbner bases |
| 001470 (1992) |
P. Gritzmann [Allemagne] ; V. Klee | Deciding uniqueness in norm maximization |
| 001721 (1986) |
| Elektrochemische Analytik. |
