BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Spain
2 × Greece
6 × USA
Collaborated with:
R.Duh W.Schnyder E.Specker
Talks about:
complex (3) graph (3) determinist (2) algorithm (2) approxim (2) hamiltonian (1) intersect (1) inequival (1) hierarchi (1) weisfeil (1)

Person: Martin Fürer

DBLP DBLP: F=uuml=rer:Martin

Contributed to:

STOC 20072007
ICALP 20012001
STOC 20002000
STOC 19971997
ICALP 19911991
STOC 19871987
ICALP 19851985
STOC 19831983
STOC 19821982
ICALP 19801980

Wrote 10 papers:

STOC-2007-Furer #integer #multi #performance
Faster integer multiplication (MF), pp. 57–66.
ICALP-2001-Furer #linear #refinement
Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations (MF), pp. 322–333.
STOC-2000-Furer #approximate #matrix
Approximating permanents of complex matrices (MF), pp. 667–669.
STOC-1997-DuhF #approximate #optimisation
Approximation of k-Set Cover by Semi-Local Optimization (RcD, MF), pp. 256–264.
ICALP-1991-Furer #algorithm #graph #performance
An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs (MF), pp. 429–440.
STOC-1987-Furer #communication #complexity #power of
The Power of Randomness for Communication Complexity (MF), pp. 178–181.
ICALP-1985-Furer #algorithm #testing
Deterministic and Las Vegas Primality Testing Algorithms (MF), pp. 199–209.
STOC-1983-FurerSS #bound #graph #normalisation
Normal Forms for Trivalent Graphs and Graphs of Bounded Valence (MF, WS, ES), pp. 161–170.
The Tight Deterministic Time Hierarchy (MF), pp. 8–16.
ICALP-1980-Furer #complexity #problem #regular expression
The Complexity of the Inequivalence Problem for Regular Expressions with Intersection (MF), pp. 234–245.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.