The SCEAS System
| |||||||

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

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |