( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
AT²-Optimal Galois Field Multiplier for VLSI.

, и . IEEE Trans. Computers, 38 (9): 1333-1336 (1989)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Carola Fürer

Bernhard Fürer

Adalbert Fürer

Sabine Ulrike Fürer

Dietrich Fürer

 

Другие публикации лиц с тем же именем

Quadratic Convergence for Scaling of Matrices.. ALENEX/ANALC, стр. 216-223. SIAM, (2004)Deterministic Autopoietic Automata.. Int. J. Softw. Informatics, 7 (4): 605-613 (2013)The Tight Deterministic Time Hierarchy. STOC, стр. 8-16. ACM, (1982)Simulation von Turingmaschinen mit logischen Netzen.. Komplexität von Entscheidungsproblemen 1976, том 43 из Lecture Notes in Computer Science, стр. 163-181. Springer, (1976)Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks.. ESA, том 5757 из Lecture Notes in Computer Science, стр. 11-22. Springer, (2009)Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width.. LATIN, том 6034 из Lecture Notes in Computer Science, стр. 49-59. Springer, (2010)Deterministic and Las Vegas Primality Testing Algorithms.. ICALP, том 194 из Lecture Notes in Computer Science, стр. 199-209. Springer, (1985)AT2-Optimal Galois Field Multiplier for VLSI., и . Aegean Workshop on Computing, том 227 из Lecture Notes in Computer Science, стр. 217-225. Springer, (1986)Approximating Maximum Independent Set in Bounded Degree Graphs., и . SODA, стр. 365-371. ACM/SIAM, (1994)Graph Isomorphism Testing without Numberics for Graphs of Bounded Eigenvalue Multiplicity.. SODA, стр. 624-631. ACM/SIAM, (1995)