| 2009 |
|---|
| 52 | EE | Martin Fürer:
Parallel Computing: Complexity Classes.
Encyclopedia of Optimization 2009: 2900-2903 |
| 2008 |
|---|
| 51 | EE | Martin Fürer,
Shiva Prasad Kasiviswanathan:
Approximately Counting Embeddings into Random Graphs.
APPROX-RANDOM 2008: 416-429 |
| 50 | EE | Martin Fürer:
Solving NP-Complete Problems with Quantum Search.
LATIN 2008: 784-792 |
| 49 | EE | Martin Fürer:
Degree-Bounded Trees.
Encyclopedia of Algorithms 2008 |
| 48 | EE | Martin Fürer,
Shiva Prasad Kasiviswanathan:
Approximately Counting Embeddings into Random Graphs
CoRR abs/0806.2287: (2008) |
| 2007 |
|---|
| 47 | EE | Martin Fürer,
Shiva Prasad Kasiviswanathan:
Algorithms for Counting 2-SatSolutions and Colorings with Applications.
AAIM 2007: 47-57 |
| 46 | EE | Martin Fürer,
Shiva Prasad Kasiviswanathan:
Exact Max 2-Sat: Easier and Faster.
SOFSEM (1) 2007: 272-283 |
| 45 | EE | Martin Fürer:
Faster integer multiplication.
STOC 2007: 57-66 |
| 44 | EE | Martin Fürer,
Shiva Prasad Kasiviswanathan:
Spanners for Geometric Intersection Graphs.
WADS 2007: 312-324 |
| 2006 |
|---|
| 43 | EE | Piotr Berman,
Martin Fürer,
Alexander Zelikovsky:
Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees.
CSR 2006: 70-79 |
| 42 | EE | Martin Fürer:
A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs.
LATIN 2006: 491-501 |
| 41 | EE | Martin Fürer,
Shiva Prasad Kasiviswanathan:
Approximate Distance Queries in Disk Graphs.
WAOA 2006: 174-187 |
| 40 | EE | Martin Fürer,
Shiva Prasad Kasiviswanathan:
Spanners for Geometric Intersection Graphs
CoRR abs/cs/0605029: (2006) |
| 2005 |
|---|
| 39 | EE | Martin Fürer,
Shiva Prasad Kasiviswanathan:
Approximately Counting Perfect Matchings in General Graphs.
ALENEX/ANALCO 2005: 263-272 |
| 38 | EE | Martin Fürer,
Shiva Prasad Kasiviswanathan:
Algorithms for Counting 2-SAT Solutions and Colorings with Applications
Electronic Colloquium on Computational Complexity (ECCC)(033): (2005) |
| 2004 |
|---|
| 37 | | Martin Fürer:
Quadratic Convergence for Scaling of Matrices.
ALENEX/ANALC 2004: 216-223 |
| 36 | EE | Martin Fürer,
Shiva Prasad Kasiviswanathan:
An Almost Linear Time Approximation Algorithm for the Permanen of a Random (0-1) Matrix.
FSTTCS 2004: 263-274 |
| 35 | EE | Martin Fürer:
An Improved Communication-Randomness Tradeo.
LATIN 2004: 444-454 |
| 2001 |
|---|
| 34 | EE | Martin Fürer:
Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations.
ICALP 2001: 322-333 |
| 2000 |
|---|
| 33 | EE | Martin Fürer:
Approximating permanents of complex matrices.
STOC 2000: 667-669 |
| 1999 |
|---|
| 32 | EE | Martin Fürer:
Randomized Splay Trees.
SODA 1999: 903-904 |
| 31 | EE | Gerard J. Chang,
Bhaskar DasGupta,
Wayne M. Dymàcek,
Martin Fürer,
Matthew Koerlin,
Yueh-Shin Lee,
Tom Whaley:
Characterizations of bipartite Steinhaus graphs.
Discrete Mathematics 199(1-3): 11-25 (1999) |
| 1998 |
|---|
| 30 | | C. R. Subramanian,
Martin Fürer,
C. E. Veni Madhavan:
Algorithms for coloring semi-random graphs.
Random Struct. Algorithms 13(2): 125-158 (1998) |
| 1997 |
|---|
| 29 | EE | Rong-chii Duh,
Martin Fürer:
Approximation of k-Set Cover by Semi-Local Optimization.
STOC 1997: 256-264 |
| 1996 |
|---|
| 28 | | Martin Fürer,
W. Miller:
Alignment-to-Alignment Editing with "Move Gap" Operations.
Int. J. Found. Comput. Sci. 7(1): 23- (1996) |
| 1995 |
|---|
| 27 | | Martin Fürer:
Improved Hardness Results for Approximating the Chromatic Number.
FOCS 1995: 414-421 |
| 26 | | Martin Fürer:
Graph Isomorphism Testing without Numberics for Graphs of Bounded Eigenvalue Multiplicity.
SODA 1995: 624-631 |
| 25 | | Martin Fürer,
Balaji Raghavachari:
An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs.
J. Algorithms 18(2): 203-220 (1995) |
| 1994 |
|---|
| 24 | | Piotr Berman,
Martin Fürer:
Approximating Maximum Independent Set in Bounded Degree Graphs.
SODA 1994: 365-371 |
| 23 | | Martin Fürer,
Balaji Raghavachari:
Approximating the Minimum-Degree Steiner Tree to within One of Optimal.
J. Algorithms 17(3): 409-423 (1994) |
| 22 | EE | Ming-Yang Kao,
Martin Fürer,
Xin He,
Balaji Raghavachari:
Optimal Parallel Algorithms forStraight-Line Grid Embeddings of Planar Graphs.
SIAM J. Discrete Math. 7(4): 632-646 (1994) |
| 1993 |
|---|
| 21 | | Martin Fürer,
C. R. Subramanian,
C. E. Veni Madhavan:
Coloring Random Graphs in Polynomial Expected Time.
ISAAC 1993: 31-37 |
| 1992 |
|---|
| 20 | EE | Martin Fürer,
Balaji Raghavachari:
Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree.
SODA 1992: 317-324 |
| 19 | EE | Martin Fürer,
Xin He,
Ming-Yang Kao,
Balaji Raghavachari:
O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs.
SPAA 1992: 410-419 |
| 18 | | Martin Fürer,
C. R. Subramanian:
Coloring Random Graphs.
SWAT 1992: 284-291 |
| 17 | | Jin-yi Cai,
Martin Fürer,
Neil Immerman:
An optimal lower bound on the number of variables for graph identifications.
Combinatorica 12(4): 389-410 (1992) |
| 1991 |
|---|
| 16 | | Martin Fürer:
Contracting Planar Graphs Efficiency in Parallel.
FSTTCS 1991: 319-335 |
| 15 | | Martin Fürer:
An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs.
ICALP 1991: 429-440 |
| 1989 |
|---|
| 14 | | Jin-yi Cai,
Martin Fürer,
Neil Immerman:
An Optimal Lower Bound on the Number of Variables for Graph Identification
FOCS 1989: 612-617 |
| 13 | | Martin Fürer,
Kurt Mehlhorn:
AT²-Optimal Galois Field Multiplier for VLSI.
IEEE Trans. Computers 38(9): 1333-1336 (1989) |
| 1988 |
|---|
| 12 | | Martin Fürer:
Universal Hashing in VLSI.
AWOC 1988: 312-318 |
| 1987 |
|---|
| 11 | | Martin Fürer:
The Power of Randomness for Communication Complexity (Preliminary Version)
STOC 1987: 178-181 |
| 1986 |
|---|
| 10 | | Martin Fürer,
Kurt Mehlhorn:
AT2-Optimal Galois Field Multiplier for VLSI.
Aegean Workshop on Computing 1986: 217-225 |
| 1985 |
|---|
| 9 | | Martin Fürer:
Deterministic and Las Vegas Primality Testing Algorithms.
ICALP 1985: 199-209 |
| 1984 |
|---|
| 8 | | Martin Fürer:
Data Structures for Distributed Counting.
J. Comput. Syst. Sci. 28(2): 231-243 (1984) |
| 1983 |
|---|
| 7 | | Martin Fürer:
The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems).
Logic and Machines 1983: 312-319 |
| 6 | | Martin Fürer,
Walter Schnyder,
Ernst Specker:
Normal Forms for Trivalent Graphs and Graphs of Bounded Valence
STOC 1983: 161-170 |
| 1982 |
|---|
| 5 | | Martin Fürer:
The Tight Deterministic Time Hierarchy
STOC 1982: 8-16 |
| 4 | | Martin Fürer:
The Complexity of Presburger Arithmetic with Bounded Quantifier Alternation Depth.
Theor. Comput. Sci. 18: 105-111 (1982) |
| 1980 |
|---|
| 3 | | Martin Fürer:
The Complexity of the Inequivalence Problem for Regular Expressions with Intersection.
ICALP 1980: 234-245 |
| 1976 |
|---|
| 2 | | Martin Fürer:
Simulation von Turingmaschinen mit logischen Netzen.
Komplexität von Entscheidungsproblemen 1976 1976: 163-181 |
| 1 | | Martin Fürer:
Polynomiale Transformationen und Auswahlaxiom.
Komplexität von Entscheidungsproblemen 1976 1976: 86-101 |
