scientific article; zbMATH DE number 4170913

zbMATH Open0712.05008MaRDI QIDQ3496340FDOQ3496340

Authors: Antal Iványi, A. I. Makosii, G. P. Egorychev 

Publication date: 1987

Title of this publication is not available (Why is that?)

Recommendations

• The parallel complexity of integer prefix summation
• On a Constant Arising in the Analysis of Bit Comparisons in Quickselect
• The combinatorics of cache misses during matrix multiplication
• A note on Dekker's FastTwoSum algorithm
• scientific article; zbMATH DE number 4085015
• On the Linear Complexity of Combined Shift Register Sequences
• scientific article; zbMATH DE number 4179292

zbMATH Keywords

asymptotic behaviorcombinatorial sums

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Asymptotic enumeration (05A16) Combinatorial identities, bijective combinatorics (05A19) Theory of operating systems (68N25)

Cited In (2)

• Title not available (Why is that?)
• Generalized exponential sums and the power of computers

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3496340)