The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin Fürer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Martin Fürer
    Polynomiale Transformationen und Auswahlaxiom. [Citation Graph (0, 0)][DBLP]
    Komplexität von Entscheidungsproblemen 1976, 1976, pp:86-101 [Conf]
  4. Martin Fürer
    Simulation von Turingmaschinen mit logischen Netzen. [Citation Graph (0, 0)][DBLP]
    Komplexität von Entscheidungsproblemen 1976, 1976, pp:163-181 [Conf]
  5. 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]
  6. Martin Fürer
    Quadratic Convergence for Scaling of Matrices. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:216-223 [Conf]
  7. Martin Fürer
    Universal Hashing in VLSI. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:312-318 [Conf]
  8. Martin Fürer, Kurt Mehlhorn
    AT2-Optimal Galois Field Multiplier for VLSI. [Citation Graph (0, 0)][DBLP]
    Aegean Workshop on Computing, 1986, pp:217-225 [Conf]
  9. 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]
  10. Martin Fürer
    Improved Hardness Results for Approximating the Chromatic Number. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:414-421 [Conf]
  11. Martin Fürer
    Contracting Planar Graphs Efficiency in Parallel. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:319-335 [Conf]
  12. 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]
  13. 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]
  14. 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]
  15. Martin Fürer
    Deterministic and Las Vegas Primality Testing Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:199-209 [Conf]
  16. 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]
  17. 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]
  18. 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]
  19. Martin Fürer
    An Improved Communication-Randomness Tradeo. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:444-454 [Conf]
  20. 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]
  21. Piotr Berman, Martin Fürer
    Approximating Maximum Independent Set in Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:365-371 [Conf]
  22. 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]
  23. Martin Fürer
    Randomized Splay Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:903-904 [Conf]
  24. 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]
  25. 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]
  26. Rong-chii Duh, Martin Fürer
    Approximation of k-Set Cover by Semi-Local Optimization. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:256-264 [Conf]
  27. Martin Fürer
    Approximating permanents of complex matrices. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:667-669 [Conf]
  28. Martin Fürer
    The Tight Deterministic Time Hierarchy [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:8-16 [Conf]
  29. Martin Fürer
    The Power of Randomness for Communication Complexity (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:178-181 [Conf]
  30. 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]
  31. Martin Fürer, C. R. Subramanian
    Coloring Random Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:284-291 [Conf]
  32. Martin Fürer, Shiva Prasad Kasiviswanathan
    Approximate Distance Queries in Disk Graphs. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:174-187 [Conf]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. 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]
  38. 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]
  39. 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]
  40. 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]
  41. 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]
  42. 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]
  43. 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]
  44. Martin Fürer
    Faster integer multiplication. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:57-66 [Conf]
  45. Martin Fürer, Shiva Prasad Kasiviswanathan
    Spanners for Geometric Intersection Graphs. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:312-324 [Conf]
  46. Martin Fürer, Shiva Prasad Kasiviswanathan
    Spanners for Geometric Intersection Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  47. 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]

  48. Approximately Counting Embeddings into Random Graphs. [Citation Graph (, )][DBLP]


  49. Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks. [Citation Graph (, )][DBLP]


  50. An Exponential Time 2-Approximation Algorithm for Bandwidth. [Citation Graph (, )][DBLP]


  51. Solving NP-Complete Problems with Quantum Search. [Citation Graph (, )][DBLP]


  52. Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width. [Citation Graph (, )][DBLP]


  53. Approximately Counting Embeddings into Random Graphs [Citation Graph (, )][DBLP]


  54. An Exponential Time 2-Approximation Algorithm for Bandwidth [Citation Graph (, )][DBLP]


  55. Deterministic Autopoietic Automata [Citation Graph (, )][DBLP]


Search in 0.055secs, Finished in 0.058secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002