Conferences in DBLP
Eric Allender , Vivek Gore On Strong Separations from AC0 (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Johannes Buchmann Number Theoretic Algorithms and Cryptology. [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai Computations Over Infinite Groups. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Heinrich Efficiency of Monte Carlo Algorithms in Numerical Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Karpinski Approximation Algorithms for Counting Problems in Finite Fields. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander A. Razborov Lower Bounds for Deterministic and Nondeterministic Branching Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Rüdiger Reischuk Graph Theoretical Methods for the Design of Parallel Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Claus-Peter Schnorr , M. Euchner Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems. [Citation Graph (0, 0)][DBLP ] Conf ] J. F. Traub Information-Based Complexity: Recent Results and Open Problems. [Citation Graph (0, 0)][DBLP ] Conf ] György Turán A Survey of Some Aspects of Computational Learning Theory (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao Recent Progress in Circuit and Communication Complexity (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Christel Baier , Mila E. Majster-Cederbaum The Consistency of a Noninterleaving and an Interleaving Model for Full TCSP. [Citation Graph (0, 0)][DBLP ] Conf ] Bernd Bank , Teresa Krick , Reinhard Mandel , Pablo Solernó A Gemometrical Bound for Integer Programming with Polynomial Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Elena Barcucci , Renzo Pinzani , E. Rodella , Renzo Sprugnoli A Characterization of Binary Search Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Danièle Beauquier , Maurice Nivat , Damian Niwinski About the Effect of the Number of Successful Paths in an Infinite Tree on the Recognizability by a Finite Automaton with Büchi Conditions. [Citation Graph (0, 0)][DBLP ] Conf ] Luca Breveglieri , Claudio Citrini , Stefano Crespi-Reghizzi Deterministic Dequeue Automata and LL(1) Parsing of Breadth-Depth Grammars. [Citation Graph (0, 0)][DBLP ] Conf ] Danilo Bruschi , Giovanni Pighizzini The Complexity of Computing Maximal Word Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Gerhard Buntrock , Birgit Jenner , Klaus-Jörn Lange , Peter Rossmanith Unambiguity and Fewness for Logarithmic Space. [Citation Graph (0, 0)][DBLP ] Conf ] Marc Chardin Differential Resultants and Subresultants. [Citation Graph (0, 0)][DBLP ] Conf ] Bogdan S. Chlebus , Imrich Vrto Unifying Binary-Search Trees and Permutations. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Dassow , Klaus-Jörn Lange Computational Calculus and Hardest Languages of Automata with Abstract Storages. [Citation Graph (0, 0)][DBLP ] Conf ] Emanuela Fachini , Angelo Monti , Margherita Napoli , Domenico Parente Systolic Y-Tree Automata: Closure Properties and Decision Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Hans Dietmar Gröger A New Partition Lemma for Planar Graphs and Its Application to Circuit Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Hofmeister , Walter Hohberg , Susanne Köhling Some Notes on Threshold Circuits, and Multiplication in Depth 4. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Hromkovic Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Oscar H. Ibarra , Nicholas Q. Trân On Space-bounded Synchronized Alternating Turing Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Antoine Joux , Jacques Stern Improving the Critical Density of the Lagarias-Odlyzko Attack Against Subset Sum Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Stasys Jukna Optimal versus Stable in Boolean Formulae. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Kaib The Gauß Lattice Basis Reduction Algorithm Succeeds With Any Norm. [Citation Graph (0, 0)][DBLP ] Conf ] Janis Kaneps Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Peter M. W. Knijnenburg , Joost N. Kok On the Semantics of Atomized Statements - the Parallel-Choice Option (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Emmanuel Kounalis , Michaël Rusinowitch Automatic Proof Methods for Algebraic Specifications. [Citation Graph (0, 0)][DBLP ] Conf ] Dieter Kratsch , Lane A. Hemachandra On the Complexity of Graph Reconstruction. [Citation Graph (0, 0)][DBLP ] Conf ] Christos Levcopoulos , Ola Petersson An Optimal Adaptive In-place Sorting Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Guy Louchard , Claire Kenyon , René Schott Data Structures Maxima. [Citation Graph (0, 0)][DBLP ] Conf ] Conrado Martinez Average-case Analysis of Equality of Binary Trees Under the BST Probability Model. [Citation Graph (0, 0)][DBLP ] Conf ] Jean Neraud On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Wojciech Plandowski , Wojciech Rytter , Tomasz Szymacha Exact Analysis of Three Tree Contraction Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Kai Salomaa , Sheng Yu Degrees of Nondeterminism for Pushdown Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Heiko Schröder , Ondrej Sýkora , Imrich Vrto Optimal Embedding of a Toroidal Array in a Linear Array. [Citation Graph (0, 0)][DBLP ] Conf ] Dietmar Uhlig Boolean Functions with a Large Number of Subfunctions and Small Complexity and Depth. [Citation Graph (0, 0)][DBLP ] Conf ] Radhakrishna S. Valiveti , B. John Oommen , Jack R. Zgierski Adaptive Linear List Reorganization for a System Processing Set Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Egon Wanke On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages. [Citation Graph (0, 0)][DBLP ] Conf ] 