Fast algorithms for Taylor shifts and certain difference equations
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Coping with Uncertainty in Map Learning
Machine Learning
Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Efficient Symbolic Analysis for Parallelizing Compilers and Performance Estimators
The Journal of Supercomputing
Approximate polynomial decomposition
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Computing the minimal telescoper for sums of hypergeometric terms
ACM SIGSAM Bulletin
NeT & CoT: translating relational schemas to XML schemas using semantic constraints
Proceedings of the eleventh international conference on Information and knowledge management
An Algorithm for General Set Unification and Its Complexity
Journal of Automated Reasoning
On the diameter of the rotation graph of binary coupling trees
Discrete Mathematics
The monadic theory of morphic infinite words and generalizations
Information and Computation
Kernel-based topographic map formation by local density modeling
Neural Computation
Asymptotic analysis of an optimized quicksort algorithm
Information Processing Letters
Joint entropy maximization in kernel-based topographic maps
Neural Computation
Counting with range concatenation grammars
Theoretical Computer Science - Algebraic methods in language processing
Formal Verification of Floating Point Trigonometric Functions
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Daubechies Filters for 2D Wavelet Transforms
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Counting Satisfying Assignments in 2-SAT and 3-SAT
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Using Nondeterminism to Design Deterministic Algorithms
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
On Learning Embedded Midbit Functions
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Kernel-based topographic map formation achieved with an information-theoretic approach
Neural Networks - New developments in self-organizing maps
On the maximum stable throughput problem in random networks with directional antennas
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
On the sample size of k-restricted min-wise independent permutations and other k-wise distributions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Fringe analysis of synchronized parallel insertion algorithms in 2-3 trees
Theoretical Computer Science
Carry propagation in signed digit representations
European Journal of Combinatorics
A Tool for Nesting and Clustering Large Objects
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Cyclic Just-In-Time Sequences Are Optimal
Journal of Global Optimization
Neutrality and self-adaptation
Natural Computing: an international journal
Computer algebra handbook
Parsing Without a Grammar: Making Sense of Unknown File Formats
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Competitive facility location: the Voronoi game
Theoretical Computer Science
Random Structures & Algorithms
Information Processing Letters
An efficient parameterized algorithm for m-set packing
Journal of Algorithms
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
Journal of Algorithms
Fast hierarchical importance sampling with blue noise properties
ACM SIGGRAPH 2004 Papers
Services within a Busy Period of an M/M/1 Queue and Dyck Paths
Queueing Systems: Theory and Applications
Distance Graphs on the Integers
Combinatorics, Probability and Computing
Contiguous Search in the Hypercube for Capturing an Intruder
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Lower bounds for sense of direction in regular graphs
Distributed Computing
Analysis of linear combination algorithms in cryptography
ACM Transactions on Algorithms (TALG)
XOR-based Visual Cryptography Schemes
Designs, Codes and Cryptography
Functional declarative language design and predicate calculus: a practical approach
ACM Transactions on Programming Languages and Systems (TOPLAS)
Program transformation by solving recurrences
Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Sharing Multiple Secrets: Models, Schemes and Analysis
Designs, Codes and Cryptography
Worst case constant time priority queue
Journal of Systems and Software
Queueing Systems: Theory and Applications
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
FUNCTIONAL PEARL: Enumerating the rationals
Journal of Functional Programming
ACM SIGCSE Bulletin
Theoretical Computer Science - Real numbers and computers
Efficient Detection of Network Motifs
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Detecting loop-carried dependences in programs with dynamic data structures
Journal of Parallel and Distributed Computing
Reversal and transposition medians
Theoretical Computer Science
The price of anarchy for polynomial social cost
Theoretical Computer Science
A Decision Procedure for Linear "Big O" Equations
Journal of Automated Reasoning
Exact arithmetic on the Stern-Brocot tree
Journal of Discrete Algorithms
On the enumeration of certain weighted graphs
Discrete Applied Mathematics
Analyzing the effects of module encapsulation on search space bias
Proceedings of the 9th annual conference on Genetic and evolutionary computation
An XOR-based erasure-recovered algorithm for tolerating double disk failure in disk array systems
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
Counting vertices and cubes in median graphs of circular split systems
European Journal of Combinatorics
Random walk based routing protocol for wireless sensor networks
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Modelling the navigation potential of a web page
Theoretical Computer Science
Tight bounds for the multiplicative complexity of symmetric functions
Theoretical Computer Science
Optimal delay for media-on-demand with pre-loading and pre-buffering
Theoretical Computer Science
RT oblivious erasure correcting
IEEE/ACM Transactions on Networking (TON)
Recursion versus iteration with the list as a data structure
Informatics in education
Using the Whittle Estimator for the Selection of an Autocorrelation Function Family
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
A Uniform Approach Towards Succinct Representation of Trees
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Recounting the Rationals: Twice!
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Sampling and discretization of the linear canonical transform
Signal Processing
Peak Shaving through Resource Buffering
Approximation and Online Algorithms
Explicit Formula for Predictive FIR Filters and Differentiators Using Hahn Orthogonal Polynomials
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Data Deletion with Provable Security
Information Security Applications
Algorithms for optimal outlier removal
Journal of Discrete Algorithms
Candle in the woods: asymptotic bounds on minimum blocking sets
Proceedings of the twenty-fifth annual symposium on Computational geometry
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Introducing abstraction and decomposition to novice programmers
ITiCSE '09 Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education
Universal Succinct Representations of Trees?
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Wireless Personal Communications: An International Journal
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Design and performance of wireless data gathering networks based on unicast random walk routing
IEEE/ACM Transactions on Networking (TON)
Discrete weighted Montgomery identityand discrete Ostrowski type inequalities
Computers & Mathematics with Applications
Characterization and Detection of Toric Loops in n-Dimensional Discrete Toric Spaces
Journal of Mathematical Imaging and Vision
Self-assembly of discrete self-similar fractals
Natural Computing: an international journal
Approximating rational numbers by fractions
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
In how many steps the k peg version of the towers of Hanoi game can be solved?
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Attacking unlinkability: the importance of context
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
Characterizing and detecting toric loops in n-dimensional discrete toric spaces
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Designing competitions between teams of individuals
Artificial Intelligence
A general framework for local pairwise alignment statistics with gaps
WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
Fine: fractal indexing based on neighborhood estimation
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Sending a bivariate Gaussian over a Gaussian MAC
IEEE Transactions on Information Theory
A theory of sampling for continuous-time metric temporal logic
ACM Transactions on Computational Logic (TOCL)
Enumeration results for alternating tree families
European Journal of Combinatorics
Riordan arrays and harmonic number identities
Computers & Mathematics with Applications
The square root law does not require a linear key
Proceedings of the 12th ACM workshop on Multimedia and security
Integral trees of arbitrarily large diameters
Journal of Algebraic Combinatorics: An International Journal
IEEE Transactions on Circuits and Systems Part I: Regular Papers
IEEE Transactions on Circuits and Systems Part I: Regular Papers
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Approximate self-assembly of the Sierpinski triangle
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Design and performance analysis of a DRAM-based statistics counter array architecture
Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Designing an algorithmic proof of the two-squares theorem
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Series transformations to improve and extend convergence
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
Ranking continuous probabilistic datasets
Proceedings of the VLDB Endowment
Greedy Algorithm with Weights for Decision Tree Construction
Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
The square root law in stegosystems with imperfect information
IH'10 Proceedings of the 12th international conference on Information hiding
On Euclid's algorithm and elementary number theory
Science of Computer Programming
Pointfree expression and calculation: from quantification to temporal logic
Formal Methods in System Design
An overview of the transmission capacity of wireless networks
IEEE Transactions on Communications
A heuristic approach for constructing ternary covering arrays using trinomial coefficients
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
Representing real numbers in a generalized numeration system
Journal of Computer and System Sciences
Bounds and trade-offs for Double-Base Number Systems
Information Processing Letters
Pattern Recognition and Image Analysis
An extension of Christoffel duality to a subset of Sturm numbers and their characteristic words
Theoretical Computer Science
Polynomial odes: examples, solutions, properties
Neural, Parallel & Scientific Computations
Asymptotic Moments of the Bottleneck Assignment Problem
Mathematics of Operations Research
Image simplification and vectorization
Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Non-Photorealistic Animation and Rendering
Self-assembling rulers for approximating generalized sierpinski carpets
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Hamilton cycles in restricted block-intersection graphs
Designs, Codes and Cryptography
Journal of Automated Reasoning
Counting subset sums of finite abelian groups
Journal of Combinatorial Theory Series A
Proceedings of the 9th ACM international symposium on Mobility management and wireless access
Probabilities of discrepancy between minima of cross-validation, Vapnik bounds and true risks
International Journal of Applied Mathematics and Computer Science
The combinatorics of neurite self-avoidance
Neural Computation
SIAM Journal on Imaging Sciences
Initialization for ad hoc radio networks with carrier sensing and collision detection
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Integrating discrete- and continuous-time metric temporal logics through sampling
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
The money changing problem revisited: computing the Frobenius number in time O(k a1)
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Stable multivariate Eulerian polynomials and generalized Stirling permutations
European Journal of Combinatorics
On the membership of invertible diagonal matrices
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Some new results on palindromic factors of billiard words
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Minimal chordal sense of direction and circulant graphs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Poset representation for gödel and nilpotent minimum logics
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
From post systems to the reachability problems for matrix semigroups and multicounter automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
MAX-SAT for formulas with constant clause density can be solved faster than in O(2n) time
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
A maple package for conditional event algebras
WCII'02 Proceedings of the 2002 international conference on Conditionals, Information, and Inference
A symbolic analysis framework for static analysis of imperative programming languages
Journal of Systems and Software
Convergence of a recombination-based elitist evolutionary algorithm on the royal roads test function
AI'11 Proceedings of the 24th international conference on Advances in Artificial Intelligence
Asymptotics of characters of symmetric groups: Structure of Kerov character polynomials
Journal of Combinatorial Theory Series A
Successful classroom deployment of a social document annotation system
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Locality-sensitive hashing scheme based on dynamic collision counting
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
On some expansions for the Euler Gamma function and the Riemann Zeta function
Journal of Computational and Applied Mathematics
Asymptotic behavior of average Lp -discrepancies
Journal of Complexity
Medical privacy protection based on granular computing
Artificial Intelligence in Medicine
PGSCM: A family of P-stable Boundary Value Methods for second-order initial value problems
Journal of Computational and Applied Mathematics
Approximating minimum label s-t cut via linear programming
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters
Operations Research Letters
On the average cost of order-preserving encryption based on hypergeometric distribution
Information Processing Letters
Journal of Computational Physics
Counter automata for parameterised timing analysis of box-based systems
FOPARA'11 Proceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
DRAM-based statistics counter array architecture with performance guarantee
IEEE/ACM Transactions on Networking (TON)
Daubechies Filters in Wavelet Image Compression
Fundamenta Informaticae
A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths
Fundamenta Informaticae - Lattice Path Combinatorics and Applications
The distribution of cycles in breakpoint graphs of signed permutations
Discrete Applied Mathematics
REGIMap: register-aware application mapping on coarse-grained reconfigurable architectures (CGRAs)
Proceedings of the 50th Annual Design Automation Conference
On Spieß's conjecture on harmonic numbers
Discrete Applied Mathematics
A combinatorial approach to a general two-term recurrence
Discrete Applied Mathematics
Proceedings of the 17th International Software Product Line Conference co-located workshops
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Counting paths in planar width 2 branching programs
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
The algorithmics of solitaire-like games
Science of Computer Programming
Stream processing coalgebraically
Science of Computer Programming
A note on the variance of the square components of a normal multivariate within a Euclidean ball
Journal of Multivariate Analysis
Discrete Applied Mathematics
Binary trees as a computational framework
Computer Languages, Systems and Structures
The complexity of minimum difference cover
Journal of Discrete Algorithms
Journal of Computational Physics
Iterative-deepening search with on-line tree size prediction
Annals of Mathematics and Artificial Intelligence
Optimal Collapsing Protocol for Multiparty Pointer Jumping
Theory of Computing Systems
Cubic Sieve Congruence of the Discrete Logarithm Problem, and fractional part sequences
Journal of Symbolic Computation
Stability of rootfinding for barycentric Lagrange interpolants
Numerical Algorithms
Hi-index | 0.08 |
From the Publisher:This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known authors is to provide a solid and relevant base of mathematical skills - the skills needed to solve complex problems, to evaluate horrendous sums, and to discover subtle patterns in data. It is an indispensable text and reference not only for computer scientists - the authors themselves rely heavily on it! - but for serious users of mathematics in virtually every discipline. Concrete Mathematics is a blending of CONtinuous and disCRETE mathematics. "More concretely," the authors explain, "it is the controlled manipulation of mathematical formulas, using a collection of techniques for solving problems." The subject matter is primarily an expansion of the Mathematical Preliminaries section in Knuth's classic Art of Computer Programming, but the style of presentation is more leisurely, and individual topics are covered more deeply. Several new topics have been added, and the most significant ideas have been traced to their historical roots. The book includes more than 500 exercises, divided into six categories. Complete answers are provided for all exercises, except research problems, making the book particularly valuable for self-study. Major topics include: Sums Recurrences Integer functions Elementary number theory Binomial coefficients Generating functions Discrete probability Asymptotic methods This second edition includes important new material about mechanical summation. In response to the widespread use ofthe first edition as a reference book, the bibliography and index have also been expanded, and additional nontrivial improvements can be found on almost every page. Readers will appreciate the informal style of Concrete Mathematics. Particularly enjoyable are the marginal graffiti contributed by students who have taken courses based on this material. The authors want to convey not only the importance of the techniques presented, but some of the fun in learning and using them.