Martin Fürer

发表

Approximation of k-set cover by semi-local optimization

Rong-chii Duh, Martin Fürer, Martin Fürer, 1997, STOC '97.

The power of randomness for communication complexity

Martin Fürer, 1987, STOC '87.

Approximating the Minimum-Degree Steiner Tree to within One of Optimal

Martin Fürer, Balaji Raghavachari, Martin Fürer, 1994, J. Algorithms.

Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs

Xin He, Ming-Yang Kao, Martin Fürer, 1994, SIAM J. Discret. Math..

An Improved Communication-Randomness Tradeo

Martin Fürer, 2004, LATIN.

On Completeness and Soundness in Interactive Proof Systems

Oded Goldreich, Yishay Mansour, Stathis Zachos, 1989, Adv. Comput. Res..

Degree-Bounded Trees

Martin Fürer, 2016, Encyclopedia of Algorithms.

Contracting Planar Graphs Efficiency in Parallel

Martin Fürer, 1991, FSTTCS.

Parallel Computing: Complexity Classes

Martin Fürer, 2009, Encyclopedia of Optimization.

A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width pdf

Martin Fürer, Martin Fürer, 2014, LATIN.

The tight deterministic time hierarchy

Martin Fürer, Martin Fürer, 1982, STOC '82.

The Power of Randomness for Communication Complexity (Preliminary Version)

Martin Fürer, 1987, STOC 1987.

Characterizations of bipartite Steinhaus graphs

Gerard J. Chang, Bhaskar DasGupta, Martin Fürer, 1999, Discret. Math..

AT²-Optimal Galois Field Multiplier for VLSI

Kurt Mehlhorn, Martin Fürer, 1989, IEEE Trans. Computers.

Algorithms for Counting 2-SAT Solutions and Colorings with Applications

Martin Fürer, Shiva Prasad Kasiviswanathan, 2005, Electron. Colloquium Comput. Complex..

Spanners for geometric intersection graphs with applications

Martin Fürer, Shiva Prasad Kasiviswanathan, 2012, J. Comput. Geom..

Multi-Clique-Width pdf

Martin Fürer, Martin Fürer, 2015, ITCS.

Approximating maximum independent set in bounded degree graphs

Piotr Berman, Martin Fürer, P. Berman, 1994, SODA '94.

Universal Hashing in VLSI

Martin Fürer, 1988, AWOC.

Approximately Counting Embeddings into Random Graphs

Martin Fürer, Shiva Prasad Kasiviswanathan, 2008, APPROX-RANDOM.

Simulation von Turingmaschinen mit logischen Netzen

Martin Fürer, 1976, Komplexität von Entscheidungsproblemen 1976.

Approximating the minimum degree spanning tree to within one from the optimal degree

Martin Fürer, Balaji Raghavachari, Martin Fürer, 1992, SODA '92.

An optimal lower bound on the number of variables for graph identification

Neil Immerman, Jin-Yi Cai, Martin Fürer, 1992, Comb..

Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees

Piotr Berman, Alex Zelikovsky, Martin Fürer, 2006, CSR.

Approximately Counting Embeddings into Random Graphs† pdf

Martin Fürer, Shiva Prasad Kasiviswanathan, S. Kasiviswanathan, 2008, Combinatorics, Probability and Computing.

Approximately Counting Perfect Matchings in General Graphs

Martin Fürer, Shiva Prasad Kasiviswanathan, 2005, ALENEX/ANALCO.

Deterministic Autopoietic Automata

Martin Fürer, 2013, Int. J. Softw. Informatics.

Space Saving by Dynamic Algebraization pdf

Martin Fürer, Huiwen Yu, Martin Fürer, 2014, CSR.

Quadratic Convergence for Scaling of Matrices

Martin Fürer, 2004, ALENEX/ANALC.

Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks

Martin Fürer, Martin Fürer, 2012, Algorithmica.

Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth

Carlos Hoppen, Martin Fürer, Vilmar Trevisan, 2021, ICALP.

Saving Space by Dynamic Algebraization Based on Tree Decomposition: Minimum Dominating Set pdf

Martin Fürer, Mahdi Belbasi, Martin Fürer, 2017, ArXiv.

Improved Hardness Results for Approximating the Chromatic Number

Martin Fürer, Martin Fürer, 1995, FOCS.

Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations

Martin Fürer, Martin Fürer, 2001, ICALP.

Probabalistic Quantifiers vs. Distrustful Adversaries

Stathis Zachos, Martin Fürer, Martin Fürer, 1987, FSTTCS.

Solving NP-Complete Problems with Quantum Search

Martin Fürer, 2008, LATIN.

Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width

Martin Fürer, 2010, LATIN.

Coloring Random Graphs in Polynomial Expected Time

C. R. Subramanian, Martin Fürer, C. E. Veni Madhavan, 1993, ISAAC.

An Almost Linear Time Approximation Algorithm for the Permanen of a Random (0-1) Matrix

Martin Fürer, Shiva Prasad Kasiviswanathan, 2004, FSTTCS.

Counting Perfect Matchings in Graphs of Degree 3

Martin Fürer, 2012, FUN.

The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems)

Martin Fürer, Martin Fürer, 1983, Logic and Machines.

Polynomiale Transformationen und Auswahlaxiom

Martin Fürer, 1976, Komplexität von Entscheidungsproblemen 1976.

Data Structures for Distributed Counting

Martin Fürer, 1984, J. Comput. Syst. Sci..

Deterministic and Las Vegas Primality Testing Algorithms

Martin Fürer, 1985, ICALP.

Spanners for Geometric Intersection Graphs

Martin Fürer, Shiva Prasad Kasiviswanathan, 2007, WADS.

Faster integer multiplication

Martin Fürer, 2007, STOC '07.

Counting cliques and clique covers in random graphs pdf

Martin Fürer, Kashyap Dixit, 2014, ArXiv.

Locating the Eigenvalues for Graphs of Small Clique-Width

Carlos Hoppen, Martin Fürer, David Pokrass Jacobs, 2018, LATIN.

A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs

Martin Fürer, Martin Fürer, 2006, LATIN.

An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs

Martin Fürer, Balaji Raghavachari, 1995, J. Algorithms.

Faster integer multiplication

Martin Fürer, Martin Fürer, 2007, STOC '07.

Approximating permanents of complex matrices

Martin Fürer, 2000, STOC '00.

O(nlog log n)-work parallel algorithms for straight-line grid embeddings of planar graphs

Xin He, Ming-Yang Kao, Martin Fürer, 1992, SPAA '92.

On the Combinatorial Power of the Weisfeiler-Lehman Algorithm pdf

Martin Fürer, Martin Fürer, 2017, CIAC.

An Improvement of Reed's Treewidth Approximation pdf

Martin Fürer, Mahdi Belbasi, 2020, ArXiv.

The Complexity of the Inequivalence Problem for Regular Expressions with Intersection

Martin Fürer, 1980, ICALP.

Faster Computation of Path-Width pdf

Martin Fürer, 2016, IWOCA.

Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width

Martin Fürer, 2012, LATIN.

Approximate Distance Queries in Disk Graphs

Martin Fürer, Shiva Prasad Kasiviswanathan, 2006, WAOA.

The Complexity of Presburger Arithmetic with Bounded Quantifier Alternation Depth

Martin Fürer, Martin Fürer, 1982, Theor. Comput. Sci..

Parallel Algorithms and Complexity

Martin Fürer, 1997 .

An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs

Martin Fürer, Martin Fürer, 1991, ICALP.

How Fast Can We Multiply Large Integers on an Actual Computer?

Martin Fürer, 2014, LATIN.

An exponential time 2-approximation algorithm for bandwidth pdf

Serge Gaspers, Martin Fürer, Shiva Prasad Kasiviswanathan, 2009, Theor. Comput. Sci..

An optimal lower bound on the number of variables for graph identification

Neil Immerman, Jin-Yi Cai, Martin Fürer, 1989, 30th Annual Symposium on Foundations of Computer Science.

An Exponential Time 2-Approximation Algorithm for Bandwidth

Serge Gaspers, Martin Fürer, Shiva Prasad Kasiviswanathan, 2009, IWPEC.

Efficient computation of the characteristic polynomial of a threshold graph

Martin Fürer, Martin Fürer, 2015, Theor. Comput. Sci..

Algorithms for coloring semi-random graphs

C. R. Subramanian, Martin Fürer, C. E. Veni Madhavan, 1998, Random Struct. Algorithms.

Efficient computation of the characteristic polynomial of a threshold graph pdf

Martin Fürer, Martin Fürer, M. Furer, 2015, Theor. Comput. Sci..

A Space-efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraziation

Martin Fürer, Mahdi Belbasi, Martin Fürer, 2019, CSR.

Coloring Random Graphs

C. R. Subramanian, Martin Fürer, 1992, SWAT.

Normal forms for trivalent graphs and graphs of bounded valence

Martin Fürer, Ernst Specker, Walter Schnyder, 1983, STOC.

Approximating the k -Set Packing Problem by Local Improvements

Martin Fürer, Huiwen Yu, 2014, ISCO.

Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks

Martin Fürer, Martin Fürer, 2009, ESA.

AT2-Optimal Galois Field Multiplier for VLSI

Kurt Mehlhorn, Martin Fürer, 1986, Aegean Workshop on Computing.

VLSI Algorithms and Architectures

Paul G. Spirakis, Fillia Makedon, Kurt Mehlhorn, 1986, Lecture Notes in Computer Science.

Stathis Zachos at 70!

Euripides Markou, Katerina Potika, Christos H. Papadimitriou, 2017, CIAC.

Exact Max 2-Sat: Easier and Faster

Martin Fürer, Shiva Prasad Kasiviswanathan, 2007, SOFSEM.

Packing-Based Approximation Algorithm for the k-Set Cover Problem

Martin Fürer, Huiwen Yu, 2011, ISAAC.

Space Saving by Dynamic Algebraization Based on Tree-Depth

Martin Fürer, Huiwen Yu, Martin Fürer, 2017, Theory of Computing Systems.

Finding All Leftmost Separators of Size ≤k

Martin Fürer, Mahdi Belbasi, Martin Fürer, 2021, COCOA.

Algorithms for coloring semi-random graphs

C. R. Subramanian, Martin Fürer, C. E. Veni Madhavan, 1998 .

Eigenvalue location in graphs of small clique-width

Carlos Hoppen, Martin Fürer, Vilmar Trevisan, 2017, Linear Algebra and its Applications.

On the power of combinatorial and spectral invariants

Martin Fürer, Martin Fürer, 2010 .