Le cluster Computational complexity - Computer theory
| 000219 (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 |
| 000236 (1999) | Anna Bernasconi [Allemagne] ; Carsten Damm [Allemagne] ; Igor E. Shparlinski [Australie] | On the Average Sensitivity of Testing Square-Free Numbers |
| 000249 (1998) | Carsten Damm [Allemagne] | On Boolean vs. Modular arithmetic for circuits and communication protocols |
| 000229 (2000) | Vikraman Arvind [Inde] ; Johannes Köbler [Allemagne] ; Martin Mundhenk [Allemagne] ; Jacobo Torán [Allemagne] | Nondeterministic Instance Complexity and Hard-to-Prove Tautologies |
| 000237 (1999) | Helmut Seidl [Allemagne] ; Andreas Neumann [Allemagne] | On Guarding Nested Fixpoints |
| 000238 (1999) | Carsten Damm [Allemagne] ; Ki Hang Kim [États-Unis] ; Fred Roush [États-Unis] | On Covering and Rank Problems for Boolean Matrices and Their Applications |
| 000248 (1998) | Stasys Jukna [Allemagne, Lituanie] ; Stanislav Žák [République tchèque] | On branching programs with bounded uncertainty |
| 000255 (1997) | Klaus Jansen [Allemagne] | The optimum cost chromatic partition problem |
| 000259 (1997) | S. Jukna [Allemagne] ; A. Razborov [Russie, Cuba] ; P. Savick [République tchèque, Swaziland] ; I. Wegener [Allemagne] | On P versus NP∩co-NP for decision trees and read-once branching programs |
| 000231 (2000) | Helmut Seidl [Allemagne] ; Bernhard Steffen [Allemagne] | Constraint-Based Inter-Procedural Analysis of Parallel Programs |
| 000247 (1998) | Anna Slobodová [Allemagne] | On the composition problem for OBDDs with multiple variable orders |
| 000254 (1998) | M. Mundhenk [Allemagne] ; A. Slobodova [Allemagne] | Optimal non-approximability of MAXCLIQUE |
| 000257 (1997) | Martin Mundhenk [Allemagne] ; Judy Goldsmith [États-Unis] ; Eric Allender [États-Unis] | The complexity of policy evaluation for finite-horizon partially-observable Markov decision processes |
| 000258 (1997) | Christoph Meinel [Allemagne] ; Thorsten Theobald [Allemagne] | On the influence of the state encoding on OBDD-representations of finite state machines |
| 000261 (1997) | Martin Mundhenk [Allemagne] | NP-hard sets have many hard instances |
| 000264 (1997) | Klaus Jansen [Allemagne] | Approximation results for the optimum cost chromatic partition problem |
| 000268 (1997) | Klaus Jansen [Allemagne] ; Joachim Reiter [Allemagne] | A new approximation algorithm for the register allocation problem |
| 000077 (2006) | Faisal N. Abu-Khzam [Liban] ; Henning Fernau [Allemagne] | Kernels: Annotated, Proper and Induced |
| 000205 (2002) | Michael Ley [Allemagne] | The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives |
| 000223 (2001) | Christoph Meinel [Allemagne] ; Christian Stangier [Allemagne] | Data Structures for Boolean Functions BDDs — Foundations and Applications |
| 000246 (1998) | Christian Fecht [Allemagne] ; Helmut Seidl [Allemagne] | Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems |
| 000251 (1998) | Andreas Neumann [Allemagne] ; Helmut Seidl [Allemagne] | Locating Matches of Tree Patterns in Forests |
| 000262 (1997) | Christos Kaklamanis [Grèce] ; Pino Persiano [Italie] ; Thomas Erlebach [Allemagne] ; Klaus Jansen [Allemagne] | Constrained bipartite edge coloring with applications to wavelength routing |
| 000267 (1997) | Christoph Meinel [Allemagne] ; Anna Slobodová [Allemagne] | A reducibility concept for problems defined in terms of ordered binary decision diagrams |
| 000285 (1996) | M. Kutylowski [Allemagne] ; K. Lorys [Allemagne] | Limitations of the QRQW and EREW PRAM models |
| This area was generated with Dilib version V0.6.31. |  |