The asymptotic spectrum of tensors and the exponent of matrix multiplication
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Constructing normal bases in finite fields
Journal of Symbolic Computation
Processor efficient parallel solution of linear systems over an abstract field
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Computing Frobenius maps and factoring polynomials
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the all-pairs-shortest-path problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Supereffective slow-down of parallel computations
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
On computing determinants of matrices without divisions
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Parallel and output sensitive algorithms for combinatorial and linear algebra problems
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Efficient parallel shortest-paths in digraphs with a separator decomposition
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Fast computation of the Smith normal form of an integer matrix
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Subquadratic-time factoring of polynomials over finite fields
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Factoring modular polynomials (extended abstract)
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Efficient decomposition of associative algebras
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Asymptotically fast computation of Hermite normal forms of integer matrices
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Near optimal algorithms for computing Smith normal forms of integer matrices
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Convex drawings of graphs in two and three dimensions (preliminary version)
Proceedings of the twelfth annual symposium on Computational geometry
Generating random spanning trees more quickly than the cover time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Weighted Diagnosis with Asymmetric Invalidation
IEEE Transactions on Computers
A solution to the extended GCD problem with applications
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Fast polynomial factorization over high algebraic extensions of finite fields
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Fast rectangular matrix multiplications and improving parallel matrix computations
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
The Journal of Supercomputing - Special issue: high performance computing systems
A polynomial approximation algorithm for the minimum fill-in problem
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An O(n3) algorithm for the Frobenius normal form
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
IEEE Transactions on Parallel and Distributed Systems
All pairs lightest shortest paths
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A fully dynamic algorithm for maintaining the transitive closure
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Efficient parallel computations for singular band matrices
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast construction of irreducible polynomials over finite fields
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
On certificates and lookahead in dynamic graph problems
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Fast estimation of diameter and shortest paths (without matrix multiplication)
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Determinant algorithms for random planar structures
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A Las Vegas O(n2.38 algorithm for the cardinality of a maximum matching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Optimum parallel computations with banded matrices
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for the maximum subarray problem based on matrix multiplication
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
A subdivision-based algorithm for the sparse resultant
Journal of the ACM (JACM)
Black box Frobenius decompositions over small fields
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Fast practical algorithms for the Boolean-product-witness-matrix problem
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Cryptanalysis of the Matsumoto and Imai Public Key Schemeof Eurocrypt‘98
Designs, Codes and Cryptography
Fast approximation of centrality
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Pattern matching for sets of segments
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System
IEEE Transactions on Computers
Quantum computers that can be simulated classically in polynomial time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Fast context-free grammar parsing requires fast boolean matrix multiplication
Journal of the ACM (JACM)
FFT-like multiplication of linear differential operators
Journal of Symbolic Computation
Dynamic subgraph connectivity with geometric applications
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the complexity of matrix product
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An optimal algorithm for checking regularity: (extended abstract)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
Computation of Determinants, Adjoint Matrices, and Characteristic Polynomials without Division
Cybernetics and Systems Analysis
Computational Complexity for Physicists
Computing in Science and Engineering
Journal of Algorithms
On claw-free asteroidal triple-free graphs
Discrete Applied Mathematics
A fully dynamic algorithm for maintaining the transitive closure
Journal of Computer and System Sciences - STOC 1999
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Fast and Scalable Parallel Matrix Computations with Optical Buses
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Fast Boolean Matrix Multiplication for Highly Clustered Data
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
The Security of Hidden Field Equations (HFE)
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
All-Pairs Shortest Paths Computation in the BSP Model
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
A (5/2)n2-Lower Bound for the Multiplicative Complexity of n×n-Matrix Multiplication
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Approximating node connectivity problems via set covers
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Some Prospects for Efficient Fixed Parameter Algorithms
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
C*-+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Cryptanalysis of the TTM Cryptosystem
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Instruction Scheduling with Timing Constraints on a Single RISC Processor with 0/1 Latencies
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
DS '00 Proceedings of the Third International Conference on Discovery Science
Fast Algorithms for for Linear Algebra Modulo N
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
On the Security of HFE, HFEv- and Quartz
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
On p-adic Point Counting Algorithms for Elliptic Curves over Finite Fields
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
A Geometric Approach to Boolean Matrix Multiplication
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
The Point Algebra for Branching Time Revisited
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
On the complexity of the multiplication of matrices of small formats
Journal of Complexity
Theoretical Computer Science
Selected topics on assignment problems
Discrete Applied Mathematics
On parallel block algorithms for exact triangularizations
Parallel Computing
Polynomial time algorithms for network information flow
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
An output-sensitive variant of the baby steps/giant steps determinant algorithm
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
All Pairs Shortest Paths in Undirected Graphs with Integer Weights
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Nearly tight bounds on the learnability of evolution
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Efficient Parallel and Distributed Topological Sort Algorithms
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Detecting directed 4-cycles still faster
Information Processing Letters
A note on the hermite basis computation of large integer matrices
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Recognition of some perfectly orderable graph classes
Discrete Applied Mathematics
Fast computation of discrete invariants associated to a differential rational mapping
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Point algebras for temporal reasoning: algorithms and complexity
Artificial Intelligence
Self-adapting software for numerical linear algebra and LAPACK for clusters
Parallel Computing - Special issue: Parallel and distributed scientific and engineering computing
Consistency of Natural Relations on Sets
Combinatorics, Probability and Computing
Tree-adjoining grammar parsing and boolean matrix multiplication
Computational Linguistics
Acceleration of Computation of Determinants and Characteristic Polynomials without Divisions
Cybernetics and Systems Analysis
Computing all large sums-of-pairs in Rn and the discrete planar two-watchtower problem
Information Processing Letters
Fast context-free parsing requires fast Boolean matrix multiplication
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate distance oracles for unweighted graphs in Õ (n2) time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Recognizing quasi-triangulated graphs
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Linear FPT reductions and computational lower bounds
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
Theoretical Computer Science - Algebraic and numerical algorithm
External matrix multiplication and all-pairs shortest path
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Information and Computation
On the complexity of fixed parameter clique and dominating set
Theoretical Computer Science
Weak minimization of DFA: an algorithm and applications
Theoretical Computer Science - Implementation and application of automata
Fast and Scalable Parallel Matrix Computations on Distributed Memory Systems
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n2 barrier
Journal of the ACM (JACM)
Beyond the Alder-Strassen bound
Theoretical Computer Science - Automata, languages and programming
Computing minimal triangulations in time O(nα log n) = o(n2.376)
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Computing the rank and a small nullspace basis of a polynomial matrix
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Fast sparse matrix multiplication
ACM Transactions on Algorithms (TALG)
A framework of filtering, clustering and dynamic layout graphs for visualization
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Efficient parallel factorization and solution of structured and unstructured linear systems
Journal of Computer and System Sciences
Group-theoretic Algorithms for Matrix Multiplication
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Answering distance queries in directed graphs using fast matrix multiplication
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
The shifted number system for fast linear algebra on integer matrices
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Weighted isotonic regression under the L1 norm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Quantum verification of matrix products
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The complexity of matrix completion
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Finding a maximum weight triangle in n3-Δ time, with applications
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Linear time low tree-width partitions and algorithmic consequences
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A new algorithm for optimal 2-constraint satisfaction and its implications
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Colored intersection searching via sparse rectangular matrix multiplication
Proceedings of the twenty-second annual symposium on Computational geometry
Computing the Fréchet distance between simple polygons in polynomial time
Proceedings of the twenty-second annual symposium on Computational geometry
Optimal 2-constraint satisfaction via sum-product algorithms
Information Processing Letters
Efficient transitive closure of sparse matrices over closed semirings
Theoretical Computer Science - Algebraic methods in language processing
Counting triangles in data streams
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Group-theoretic algorithms for matrix multiplication
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Change of order for bivariate triangular sets
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Using structure indices for efficient approximation of network properties
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Fully dynamic all pairs shortest paths with real edge weights
Journal of Computer and System Sciences - Special issue on FOCS 2001
Finding and counting cliques and independent sets in r-uniform hypergraphs
Information Processing Letters
Solving structured linear systems of large displacement rank
ACM Communications in Computer Algebra
Implementing minimum cycle basis algorithms
Journal of Experimental Algorithmics (JEA)
Strong computational lower bounds via parameterized complexity
Journal of Computer and System Sciences
Communication-efficient parallel generic pairwise elimination
Future Generation Computer Systems - Special section: Information engineering and enterprise architecture in distributed computing environments
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
Theoretical Computer Science
Core Stability of Minimum Coloring Games
Mathematics of Operations Research
Fourier meets möbius: fast subset convolution
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
All-pairs bottleneck paths for general graphs in truly sub-cubic time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A queueing analysis for the denial of service (DoS) attacks in computer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Parallel and Distributed Systems
Dynamic connectivity for axis-parallel rectangles
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Dynamic programming and fast matrix multiplication
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
The schur aggregation for solving linear systems of equations
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Null space and eigenspace computations with additive preprocessing
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Solving toeplitz- and vandermonde-like linear systems with large displacement rank
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Faster inversion and other black box matrix computations using efficient block projections
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Computing the eigenvalue in the schoof-elkies-atkin algorithm using abelian lifts
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Temporal causal modeling with graphical granger methods
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Maximum matching in graphs with an excluded minor
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
All-pairs bottleneck paths in vertex weighted graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Finding a heaviest triangle is not harder than matrix multiplication
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Matrix-vector multiplication in sub-quadratic time: (some preprocessing required)
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The independent even factor problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A local approach to concept generation
Annals of Mathematics and Artificial Intelligence
Cycle bases of graphs and sampled manifolds
Computer Aided Geometric Design
Probabilistic algorithm for finding roots of linearized polynomials
Designs, Codes and Cryptography
ACM Transactions on Algorithms (TALG)
Open problems around exact algorithms
Discrete Applied Mathematics
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Grad and classes with bounded expansion II. Algorithmic aspects
European Journal of Combinatorics
Additive preconditioning and aggregation in matrix computations
Computers & Mathematics with Applications
Two Dimensional Aggregation Procedure: An Alternative to the Matrix Algebraic Algorithm
Computational Economics
All-pairs disjoint paths from a common ancestor in Õ(nω) time
Theoretical Computer Science
Finding large 3-free sets I: The small n case
Journal of Computer and System Sciences
Language constrained graph problems: a microcosm of engineering research and development
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
Fast polynomial factorization and modular composition in small characteristic
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Computing the Fréchet distance between simple polygons
Computational Geometry: Theory and Applications
Products of ordinary differential operators by evaluation and interpolation
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Expressing a fraction of two determinants as a determinant
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages
ACM Transactions on Mathematical Software (TOMS)
Fast multiplication of matrices over a finitely generated semiring
Information Processing Letters
Large margin vs. large volume in transductive learning
Machine Learning
Locally linear reconstruction for instance-based learning
Pattern Recognition
Efficient semi-streaming algorithms for local triangle counting in massive graphs
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast Stochastic Context-Free Parsing: A Stochastic Version of the Valiant Algorithm
IbPRIA '07 Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I
Efficient Disjointness Tests for Private Datasets
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
A Path Cover Technique for LCAs in Dags
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Computational Study on Dominating Set Problem of Planar Graphs
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
On Faster Integer Calculations Using Non-arithmetic Primitives
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Main-memory triangle computations for very large (sparse (power-law)) graphs
Theoretical Computer Science
Solving structured linear systems with large displacement rank
Theoretical Computer Science
Decision problem for shuffled genes
Information and Computation
Distributed, large-scale latent semantic analysis by index interpolation
Proceedings of the 3rd international conference on Scalable information systems
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
How to Write Fast Numerical Code: A Small Introduction
Generative and Transformational Techniques in Software Engineering II
An efficient cryptosystem Delta for stream cipher applications
Computers and Electrical Engineering
Faster multi-witnesses for Boolean matrix multiplication
Information Processing Letters
Efficient algorithms for clique problems
Information Processing Letters
Modular code generation from synchronous block diagrams: modularity vs. code size
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
All-pairs nearly 2-approximate shortest paths in O(n2polylogn) time
Theoretical Computer Science
Highly predictive blacklisting
SS'08 Proceedings of the 17th conference on Security symposium
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
Approximating Shortest Paths in Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Unconditionally secure disjointness tests for private datasets
International Journal of Applied Cryptography
A note on compressed sensing and the complexity of matrix multiplication
Information Processing Letters
On Effectiveness of Clock Control in Stream Ciphers
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Finding, minimizing, and counting weighted subgraphs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Generalized matrix inversion is not harder than matrix multiplication
Journal of Computational and Applied Mathematics
Finding the longest isometric cycle in a graph
Discrete Applied Mathematics
Efficient influence maximization in social networks
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Mind the gaps: weighting the unknown in large-scale one-class collaborative filtering
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
General spanning trees and reachability query evaluation
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
Fast algorithms for differential equations in positive characteristic
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Analyzing group based matrix multiplication algorithms
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Integer matrix rank certification
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Nearly optimal symbolic-numerical algorithms for structured integer matrices and polynomials
Proceedings of the 2009 conference on Symbolic numeric computation
Reconstruction of graphs based on random walks
Theoretical Computer Science
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function
ACM Transactions on Algorithms (TALG)
Homogeneous 2-hop broadcast in 2D
Computational Geometry: Theory and Applications
Theoretical Computer Science
The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Resolving Loads with Positive Interior Stresses
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Maximum weight bipartite matching in matrix multiplication time
Theoretical Computer Science
Efficient enumeration of words in regular languages
Theoretical Computer Science
Computational study on planar dominating set problem
Theoretical Computer Science
Segregating in- and other-cell interference with applications to decentralized admission control
IEEE Transactions on Communications
Matrix representation of solution concepts in multiple- decision-maker graph models
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans - Special section: Best papers from the 2007 biometrics: Theory, applications, and systems (BTAS 07) conference
On the memory complexity of the forward-backward algorithm
Pattern Recognition Letters
Multiuser scheduling in downlink MIMO systems using particle swarm optimization
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Minimum Cycle Bases of Weighted Outerplanar Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A Certifying Algorithm for 3-Colorability of P5-Free Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Complexity of checking the existence of a stabilizing decentralized controller
ACC'09 Proceedings of the 2009 conference on American Control Conference
Recognizing quasi-triangulated graphs
Discrete Applied Mathematics
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
Information and Computation
Optimal 2-constraint satisfaction via sum--product algorithms
Information Processing Letters
The shifted number system for fast linear algebra on integer matrices
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Proceedings of the 3rd Workshop on Social Network Mining and Analysis
Efficient computation in rational-valued p systems
Mathematical Structures in Computer Science
IEEE Transactions on Signal Processing
Fast computation of special resultants
Journal of Symbolic Computation
SNDocRank: a social network-based video search ranking framework
Proceedings of the international conference on Multimedia information retrieval
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
An approach to model building for accelerated cooling process using instance-based learning
Expert Systems with Applications: An International Journal
Grids: a domain for analyzing the distribution of numerical values
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Weak minimization of DFA: an algorithm and applications
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
New approximation algorithms for minimum cycle bases of graphs
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Finding paths with the right cost
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Higher order correlation attacks, XL algorithm and cryptanalysis of Toyocrypt
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Algebraic attacks on stream ciphers with linear feedback
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Efficient GF(pm) arithmetic architectures for cryptographic applications
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Efficient enumeration of regular languages
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Side channel attacks on irregularly decimated generators
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Unique lowest common ancestors in dags are almost as easy as matrix multiplication
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Estimating clustering indexes in data streams
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Fast lowest common ancestor computations in dags
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Enabling selective flooding to reduce P2P traffic
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Scheduling with precedence constraints: mixed graph coloring in series-parallel graphs
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
A fast algorithm to calculate powers of a Boolean matrix for diameter computation of random graphs
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Restricted global grammar constraints
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Finding heaviest H-subgraphs in real weighted graphs, with applications
ACM Transactions on Algorithms (TALG)
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
Proceedings of the forty-second ACM symposium on Theory of computing
Social network document ranking
Proceedings of the 10th annual joint conference on Digital libraries
Automatic reproduction of a genius algorithm: Strassen's algorithm revisited by genetic search
IEEE Transactions on Evolutionary Computation
Nondecreasing paths in a weighted graph or: How to optimally read a train schedule
ACM Transactions on Algorithms (TALG)
Typed and unambiguous pattern matching on strings using regular expressions
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Efficient algorithms for large-scale local triangle counting
ACM Transactions on Knowledge Discovery from Data (TKDD)
Fast hybrid matrix multiplication algorithms
Cybernetics and Systems Analysis
Minimum cycle bases of weighted outerplanar graphs
Information Processing Letters
Fast field solver for the simulation of large-area OLEDs
Microelectronics Journal
On reducing computational overhead in multi-objective genetic Takagi-Sugeno fuzzy systems
Applied Soft Computing
Uncertainty Propagation for Efficient Exploration in Reinforcement Learning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Generating a d-dimensional linear subspace efficiently
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
An improved construction of progression-free sets
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On the possibility of faster SAT algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Testing 2-vertex connectivity and computing pairs of vertex-disjoint s-t paths in digraphs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Fast parsing for Boolean grammars: a generalization of Valiant's algorithm
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Clustering coefficient queries on massive dynamic social networks
WAIM'10 Proceedings of the 11th international conference on Web-age information management
New developments in quantum algorithms
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Faster algorithms on branch and clique decompositions
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach
WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
The Journal of Supercomputing
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Improved Algorithms for Parsing ESLTAGs: A Grammatical Model Suitable for RNA Pseudoknots
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Mean-variance based QoS management in cognitive radio
IEEE Transactions on Wireless Communications
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Extended dynamic subgraph statistics using h-index parameterized data structures
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
A novel branching strategy for parameterized graph modification problems
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
On graphs without a C4 or a diamond
Discrete Applied Mathematics
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
SIAM Journal on Computing
On Computing the Frequencies of Induced Subhypergraphs
SIAM Journal on Discrete Mathematics
Optimization techniques for small matrix multiplication
Theoretical Computer Science
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Journal of Symbolic Computation
KS ring theoretic approach for matrix multiplication
Proceedings of the International Conference & Workshop on Emerging Trends in Technology
Vertex splitting and the recognition of trapezoid graphs
Discrete Applied Mathematics
Graph expansion and communication costs of fast matrix multiplication: regular submission
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Cover times, blanket times, and majorizing measures
Proceedings of the forty-third annual ACM symposium on Theory of computing
An LLL-reduction algorithm with quasi-linear time complexity: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
Geometric complexity theory and tensor rank
Proceedings of the forty-third annual ACM symposium on Theory of computing
An output-sensitive algorithm for persistent homology
Proceedings of the twenty-seventh annual symposium on Computational geometry
Zigzag persistent homology in matrix multiplication time
Proceedings of the twenty-seventh annual symposium on Computational geometry
All-pairs shortest paths with a sublinear additive error
ACM Transactions on Algorithms (TALG)
Mobile multimedia for multiuser environments
Journal of Mobile Multimedia
Linear solving for sign determination
Theoretical Computer Science
Constrained surface interpolation by means of a genetic algorithm
Computer-Aided Design
Recognizing sparse perfect elimination Bipartite graphs
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Driving with knowledge from the physical world
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Exact parameterized multilinear monomial counting via k-layer subset convolution and k-disjoint
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Computing the girth of a planar graph in linear time
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A shortest cycle for each vertex of a graph
Information Processing Letters
Multi-modal constraint propagation for heterogeneous image clustering
MM '11 Proceedings of the 19th ACM international conference on Multimedia
Dynamic Connectivity: Connecting to Networks and Geometry
SIAM Journal on Computing
Compressed matrix multiplication
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Algorithms and constraint programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Subquadratic time approximation algorithms for the girth
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Networks cannot compute their diameter in sublinear time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Efficient algorithms for maximum weight matchings in general graphs with small edge weights
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A scaling algorithm for maximum weight matching in bipartite graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the complexity of the “most general” firing squad synchronization problem
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Efficient computation of reachable sets of linear time-invariant systems with inputs
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Open problems related to algebraic attacks on stream ciphers
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
On optimal learning algorithms for multiplicity automata
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Some attacks on the bit-search generator
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
Approximate shortest paths in weighted graphs
Journal of Computer and System Sciences
Two algebraic attacks against the F-FCSRs using the IV mode
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Time reduction of stochastic parsing with stochastic context-free grammars
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Algebraic algorithms for linear matroid parity problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Finding the smallest H-Subgraph in real weighted graphs and related problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Exact algorithms for exact satisfiability and number of perfect matchings
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A polynomial time algorithm for minimum cycle basis in directed graphs
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
All-pairs shortest paths with real weights in O(n3/ log n) time
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Error compensation in leaf root problems
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
General principles of algebraic attacks and new design criteria for cipher components
AES'04 Proceedings of the 4th international conference on Advanced Encryption Standard
On efficient calculations for Bayesian variable selection
Computational Statistics & Data Analysis
Implementing minimum cycle basis algorithms
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Quantum and classical communication-space tradeoffs from rectangle bounds
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Algebraic attacks on combiners with memory and several outputs
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
A space and time efficient algorithm for SimRank computation
World Wide Web
Some results on approximate 1-median selection in metric spaces
Theoretical Computer Science
Arboricity, h-index, and dynamic algorithms
Theoretical Computer Science
Splitting Randomized Stationary Policies in Total-Reward Markov Decision Processes
Mathematics of Operations Research
Advancing matrix computations with randomized preprocessing
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Design and implementation of a robust sensor data fusion system for unknown signals
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Approximating average parameters of graphs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Partitioning based algorithms for some colouring problems
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
On exact algebraic [non-]immunity of s-boxes based on power functions
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Drawing 3-polytopes with good vertex resolution
GD'09 Proceedings of the 17th international conference on Graph Drawing
A relation-algebraic view on evolutionary algorithms for some graph problems
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Efficient deterministic algorithms for finding a minimum cycle basis in undirected graphs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Fast matrix rank algorithms and applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Multiplying matrices faster than coppersmith-winograd
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Research paper: Combinatorial and computational aspects of graph packing and graph decomposition
Computer Science Review
Modeling cooperation in multi-agent communities
Cognitive Systems Research
Extended dynamic subgraph statistics using h-index parameterized data structures
Theoretical Computer Science
Optimal distributed all pairs shortest paths and applications
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma
SIAM Journal on Discrete Mathematics
Explicit Dimension Reduction and Its Applications
SIAM Journal on Computing
Fast Polynomial Factorization and Modular Composition
SIAM Journal on Computing
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
ACM Transactions on Algorithms (TALG)
Improving the berlekamp algorithm for binomials xn-a
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
Parsing Boolean grammars over a one-letter alphabet using online convolution
Theoretical Computer Science
A more reliable greedy heuristic for maximum matchings in sparse random graphs
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Computing the rooted triplet distance between galled trees by counting triangles
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Annotating simplices with a homology basis and its applications
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Chip-firing games, potential theory on graphs, and spanning trees
Journal of Combinatorial Theory Series A
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
A landmark-bounded method for large-scale underground mine mapping
Journal of Field Robotics
Dynamic matchings in convex bipartite graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Speeding up HMM decoding and training by exploiting sequence repetitions
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Faster approximation of distances in graphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Graph expansion and communication costs of fast matrix multiplication
Journal of the ACM (JACM)
Computations in modules over commutative domains
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
All-pairs ancestor problems inweighted dags
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
On the complexity of computing with zero-dimensional triangular sets
Journal of Symbolic Computation
Experiments in parallel matrix multiplication on multi-core systems
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Fast parallel algorithms for blocked dense matrix multiplication on shared memory architectures
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Reachability and termination analysis of concurrent quantum programs
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
On the complexity of solving quadratic Boolean systems
Journal of Complexity
Fast monotone summation over disjoint sets
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Runtime guarantees for regression problems
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
An output-sensitive algorithm for persistent homology
Computational Geometry: Theory and Applications
Finding and listing induced paths and cycles
Discrete Applied Mathematics
Target Tracking Using Multiple Patches and Weighted Vector Median Filters
Journal of Mathematical Imaging and Vision
Sparse regularized local regression
Computational Statistics & Data Analysis
Hardware acceleration of matrix multiplication over small prime finite fields
ARC'13 Proceedings of the 9th international conference on Reconfigurable Computing: architectures, tools, and applications
Bisimplicial edges in bipartite graphs
Discrete Applied Mathematics
Complexity of the path avoiding forbidden pairs problem revisited
Discrete Applied Mathematics
Fast approximation algorithms for the diameter and radius of sparse graphs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Compressed matrix multiplication
ACM Transactions on Computation Theory (TOCT) - Special issue on innovations in theoretical computer science 2012
An efficient MapReduce algorithm for counting triangles in a very large graph
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Matrix sparsification and nested dissection over arbitrary fields
Journal of the ACM (JACM)
Faster algorithms for markov decision processes with low treewidth
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Fast matrix rank algorithms and applications
Journal of the ACM (JACM)
Technical Note: A fast parallel Gauss Jordan algorithm for matrix inversion using CUDA
Computers and Structures
Modular Composition Modulo Triangular Sets and Applications
Computational Complexity
Adaptive Information Coding for Secure and Reliable Wireless Telesurgery Communications
Mobile Networks and Applications
Algebraic attacks on a class of stream ciphers with unknown output function
Designs, Codes and Cryptography
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation
Theory of Computing Systems
Goodness-of-Fit Measures for Revealed Preference Tests: Complexity Results and Algorithms
ACM Transactions on Economics and Computation
Fast matrix decomposition in F2
Journal of Computational and Applied Mathematics
Parsing by matrix multiplication generalized to Boolean grammars
Theoretical Computer Science
| Hi-index | 0.03 |
We present a new method for accelerating matrix multiplication asymptotically. Thiswork builds on recent ideas of Volker Strassen, by using a basic trilinear form which is not a matrix product. We make novel use of the Salem-Spencer Theorem, which gives a fairly dense set of integers with no three-term arithmetic progression. Our resulting matrix exponent is 2.376.