|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 749 occurrences of 570 keywords
|
|
|
Results
Found 2853 publication records. Showing 2852 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
97 | Jean-Marc Deshouillers, François Hennecart, Bernard Landreau |
Do Sums of 4 Biquadrates Have a Positive Density? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANTS ![In: Algorithmic Number Theory, Third International Symposium, ANTS-III, Portland, Oregon, USA, June 21-25, 1998, Proceedings, pp. 196-203, 1998, Springer, 3-540-64657-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
63 | Xiwang Cao |
Some New Identities on Kloosterman Sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(3), pp. 1230-1234, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
63 | Yutaka Hata, Naotake Kamiura, Kazuharu Yamato |
Multiple-Valued Product-of-Sums Expression with Truncated Sum. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 27th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1997, Antigonish, Nova Scotia, Canada, May 28-30, 1997, Proceedings, pp. 103-110, 1997, IEEE Computer Society, 0-8186-7910-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
63 | Marc J. van Kreveld, A. Frank van der Stappen |
Approximate Unions of Lines and Minkowski Sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 45(1), pp. 91-107, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Algorithms, Approximation, Minkowski sums, Combinatorial complexity |
54 | Chunjiang J. Duanmu, M. Omair Ahmad, M. N. S. Swamy |
Fast Block Motion Estimation With 8-Bit Partial Sums Using SIMD Architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Circuits Syst. Video Technol. ![In: IEEE Trans. Circuits Syst. Video Technol. 17(8), pp. 1041-1053, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
54 | Gerth Stølting Brodal, Allan Grønlund Jørgensen |
A Linear Time Algorithm for the k Maximal Sums Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, pp. 442-453, 2007, Springer, 978-3-540-74455-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
54 | Cristina Bazgan, Miklos Santha, Zsolt Tuza |
Efficient Approximation Algorithms for the Subset-Sums Equality Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings, pp. 387-396, 1998, Springer, 3-540-64781-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
54 | Kurt Mehlhorn |
Some Remarks on Boolean Sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1979, Proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979, pp. 375-380, 1979, Springer, 0-387-09526-8. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
|
54 | Tien-Ching Lin, D. T. Lee |
Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 460-473, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
k maximum sums problem, sum selection problem, maximum sum problem, maximum sum subarray problem |
54 | Angelo Ciaramella, Witold Pedrycz, Roberto Tagliaferri |
OR/AND Neurons for Fuzzy Set Connectives Using Ordinal Sums and Genetic Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WILF ![In: Fuzzy Logic and Applications, 6th International Workshop, WILF 2005, Crema, Italy, September 15-17, 2005, Revised Selected Papers, pp. 188-194, 2005, Springer, 3-540-32529-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Fuzzy Logic Connectives, t-norms (t-conorms), Ordinal Sums, Experiments with Logic Connectives, Genetic Algorithms |
54 | Christian Costermans, Jean-Yves Enjalbert, Vincel Hoang Ngoc Minh, Michel Petitot |
Structure and asymptotic expansion of multiple harmonic sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, pp. 100-107, 2005, ACM, 1-59593-095-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Lyndon words, multiple harmonic sums, polylogarithms, polyzêtas |
54 | Eyal Flato, Efi Fogel, Dan Halperin, Eran Leiserowitz |
Exact minkowski sums and applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, Spain, June 5-7, 2002, pp. 273-274, 2002, ACM, 1-58113-504-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
geometric software, robustness and precision, motion planning, arrangements, Minkowski sums |
54 | Alan A. Bertossi, Alessandro Mei |
A Residue Number System on Reconfigurable Mesh with Applications to Prefix Sums and Approximate String Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 11(11), pp. 1186-1199, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
string matching with $k$ mismatches, VLSI, residue number system, reconfigurable mesh, prefix sums, Number representation |
54 | Rong Lin, Koji Nakano, Stephan Olariu, Maria Cristina Pinotti, James L. Schwing, Albert Y. Zomaya |
Scalable Hardware-Algorithms for Binary Prefix Sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 11(8), pp. 838-850, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
shift switching, binary prefix sums, binary counting, pipelining, scalable architectures, Hardware-algorithms |
54 | Tor Helleseth, Thomas Johansson 0001 |
Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO '96, 16th Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 1996, Proceedings, pp. 31-44, 1996, Springer, 3-540-61512-1. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
exponential sums, Galois rings, authentication codes, Universal hash functions |
51 | Irfan Al-Hussaini, Ahmed Imtiaz Humayun, Samiul Alam, Shariful Islam Foysal, Abdullah Al Masud, Arafat Mahmud, Rakibul Islam Chowdhury, Nabil Ibtehaz, Sums Uz Zaman, Rakib Hyder, Sayeed Shafayet Chowdhury, Mohammad Ariful Haque |
Predictive Real-Time Beat Tracking from Music for Embedded Application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MIPR ![In: IEEE 1st Conference on Multimedia Information Processing and Retrieval, MIPR 2018, Miami, FL, USA, April 10-12, 2018, pp. 297-300, 2018, IEEE, 978-1-5386-1857-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
51 | Rida T. Farouki, Hwan Pyo Moon, Bahram Ravani |
Algorithms for Minkowski products and implicitly-defined complex sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 13(3), pp. 199-229, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Minkowski geometric algebra, Minkowski sums and products, logarithmic Gauss map, logarithmic curvature, implicitly-defined complex sets, families of curves, set inclusion, boundary evaluation algorithms, envelopes |
51 | Sihem Mesnager |
A New Family of Hyper-Bent Boolean Functions in Polynomial Form. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMACC ![In: Cryptography and Coding, 12th IMA International Conference, Cryptography and Coding 2009, Cirencester, UK, December 15-17, 2009. Proceedings, pp. 402-417, 2009, Springer, 978-3-642-10867-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hyper-bent functions, Maximum nonlinearity, Kloosterman sums, Cubic sums, Boolean function, Bent functions, Walsh-Hadamard transformation |
51 | Gerardo Vega |
Determining the Number of One-Weight Cyclic Codes When Length and Dimension Are Given. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAIFI ![In: Arithmetic of Finite Fields, First International Workshop, WAIFI 2007, Madrid, Spain, June 21-22, 2007, Proceedings, pp. 284-293, 2007, Springer, 978-3-540-73073-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
One-weight cyclic codes, linear recurring sequences, exponential sums and Gaussian sums |
46 | Qingping Tao, Stephen D. Scott 0001 |
Improved MCMC sampling methods for estimating weighted sums in Winnow with application to DNF learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 73(2), pp. 107-132, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Markov chain Monte Carlo, DNF, Winnow |
46 | Marc P. C. Fossorier, Kazukuni Kobara, Hideki Imai |
Modeling Bit Flipping Decoding Based on Nonorthogonal Check Sums With Application to Iterative Decoding Attack of McEliece Cryptosystem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(1), pp. 402-411, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
46 | Zhibin Pan, Tadahiro Ohmi, Koji Kotani |
Constructing Better Partial Sums Based on Energy-Maximum Criterion for Fast Encoding of VQ. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APCCAS ![In: IEEE Asia Pacific Conference on Circuits and Systems 2006, APCCAS 2006, Singapore, 4-7 December 2006, pp. 1563-1566, 2006, IEEE, 1-4244-0387-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
46 | Matthias Beck, Sinai Robins |
Explicit and Efficient Formulas for the Lattice Point Count in Rational Polygons Using Dedekind - Rademacher Sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 27(4), pp. 443-459, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
46 | Feng Zhou, Peter Kornerup |
Computing Moments by Prefix Sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. VLSI Signal Process. ![In: J. VLSI Signal Process. 25(1), pp. 5-17, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
46 | Norbert Völker |
Disjoint Sums over Type Classes in HOL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TPHOLs ![In: Theorem Proving in Higher Order Logics, 12th International Conference, TPHOLs'99, Nice, France, September, 1999, Proceedings, pp. 5-18, 1999, Springer, 3-540-66463-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
46 | Rong Lin, Koji Nakano, Stephan Olariu, Albert Y. Zomaya |
An Efficient Parallel Prefix Sums Architecture with Domino Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 14(9), pp. 922-931, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
shift switching, binary prefix sums, binary counting, VLSI design, scalable architectures, domino logic, Hardware-algorithms |
46 | Koji Chinen, Toyokazu Hiramatsu |
Hyper-Kloosterman Sums and their Applications to the Coding Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 12(5), pp. 381-390, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Hyper-Kloosterman sums, Trace code, Weight distribution of codes |
46 | Ali Uzer, T. Ege |
On the Convergence Acceleration of Slowly Convergent Sums Involving Oscillating Terms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 75(4), pp. 311-318, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
slowly convergent sums, infinite sums, Fourier series, zeta functions, Convergence acceleration |
42 | Ivona Bezáková, Nayantara Bhatnagar, Eric Vigoda |
Sampling binary contingency tables with a greedy start. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 414-423, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
42 | Kin-Fai Kan, David W. Cheung, Ben Kao |
Maintenance of Partial-Sum-Based Histograms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA ![In: Eighth International Conference on Database Systems for Advanced Applications (DASFAA '03), March 26-28, 2003, Kyoto, Japan, pp. 149-156, 2003, IEEE Computer Society, 0-7695-1895-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
42 | Wei Li 0024, Sara McMains |
A GPU-based voxelization approach to 3D Minkowski sum computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symposium on Solid and Physical Modeling ![In: ACM Symposium on Solid and Physical Modeling, Proceedings of the 15th ACM Symposium on Solid and Physical Modeling, SPM 2010, Haifa, Israel, September 1-3, 2010, pp. 31-40, 2010, ACM, 978-1-60558-984-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
GPU, path planning, voxelization, Minkowski sums, penetration depth |
42 | Matthias Blume, Umut A. Acar, Wonseok Chae |
Extensible programming with first-class cases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the 11th ACM SIGPLAN International Conference on Functional Programming, ICFP 2006, Portland, Oregon, USA, September 16-21, 2006, pp. 239-250, 2006, ACM, 1-59593-309-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
first-class cases, duality, records, sums |
42 | Tien-Ching Lin, D. T. Lee |
Randomized Algorithm for the Sum Selection Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 515-523, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
order-statistic tree, k maximum sums problem, sum selection problem, maximum sum problem, maximum sum subarray problem, computational geometry, randomized algorithm, random sampling |
42 | Parampalli Udaya, Serdar Boztas |
On the Aperiodic Correlation Function of Galois Ring m-Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 14th International Symposium, AAECC-14, Melbourne, Australia November 26-30, 2001, Proceedings, pp. 229-238, 2001, Springer, 3-540-42911-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Quadriphase sequences, Aperiodic correlations, Gauss sums over Galois rings, Galois Rings |
37 | Petr Lisonek |
On the Connection between Kloosterman Sums and Elliptic Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SETA ![In: Sequences and Their Applications - SETA 2008, 5th International Conference, Lexington, KY, USA, September 14-18, 2008, Proceedings, pp. 182-187, 2008, Springer, 978-3-540-85911-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Kloosterman sum, finite field, elliptic curve |
37 | Masakazu Kojima, Masakazu Muramatsu |
An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 110(2), pp. 315-336, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Polynomial optimization problem, Symmetric cone, Euclidean Jordan algebra, Global optimization, Semidefinite program, Sum of squares, Conic program |
37 | Gilles Lachaud |
Exponential Sums as Discrete Fourier Transform with Invariant Phase Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 10th International Symposium, AAECC-10, San Juan de Puerto Rico, Puerto Rico, May 10-14, 1993, Proceedings, pp. 231-243, 1993, Springer, 3-540-56686-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
37 | Martin Dietzfelbinger |
Lower Bounds for Sorting of Sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings, pp. 457-466, 1987, Springer, 3-540-18088-5. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
37 | Itamar Francez |
No i-Sums for Nissim (and Shalom). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Languages: From Formal to Natural ![In: Languages: From Formal to Natural, Essays Dedicated to Nissim Francez on the Occasion of His 65th Birthday, pp. 97-106, 2009, Springer, 978-3-642-01747-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Donkey anaphora, E-type pronouns, strong and weak readings, i-sums |
37 | Yoshinori Hamahata |
Finite Dedekind Sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAIFI ![In: Arithmetic of Finite Fields, 2nd International Workshop, WAIFI 2008, Siena, Italy, July 6-9, 2008, Proceedings, pp. 11-18, 2008, Springer, 978-3-540-69498-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Dedekind sums, Drinfeld modules, lattices |
37 | Masakazu Kojima, Sunyoung Kim, Hayato Waki |
Sparsity in sums of squares of polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 103(1), pp. 45-62, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Sums of squares of polynomial, Polynomial optimization problem, Semidefinite program, Sparsity |
37 | Vincent Balat, Roberto Di Cosmo, Marcelo P. Fiore |
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2004, Venice, Italy, January 14-16, 2004, pp. 64-76, 2004, ACM, 1-58113-729-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Grothendieck logical relations, strong sums, type-directed partial evaluation, typed lambda calculus, normalisation |
37 | Sung Eun Bae, Tadao Takaoka |
Algorithms for the Problem of K Maximum Sums and a VLSI Algorithm for the K Maximum Subarrays Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 7th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2004), 10-12 May 2004, Hong Kong, SAR, China, pp. 247-253, 2004, IEEE Computer Society, 0-7695-2135-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
maximum subarray, maximum subsequence, VLSI, prefix sums |
37 | Peter J. Grabner, Tamás Herendi, Robert F. Tichy |
Fractal digital sums and codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 8(1), pp. 33-39, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Thue-Morse sequence, Digital expansions, Codes, Exponential sums |
37 | Rong Lin, Stephan Olariu |
A simple array processor for binary prefix sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASAP ![In: The International Conference on Application Specific Array Processors (ASAP'95), July 24-26, 1995, Strasbourg, France, pp. 113-, 1995, IEEE Computer Society, 0-8186-7109-2. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
binary prefix sums, storage compaction, routing, computational complexity, parallel processing, VLSI, network routing, circuit CAD, array processor, binary sequence, special-purpose architecture, processor assignment, operating system design |
36 | Liqin Qian, Xiwang Cao |
Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 34(2), pp. 211-244, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
34 | Mary Cryan, Martin E. Dyer |
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 240-249, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
34 | Daciana Bochis, Francisco Santos |
On the Number of Facets of Three-Dimensional Dirichlet Stereohedra I: Groups with Reflections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 25(3), pp. 419-444, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Alessandro Mei, Romeo Rizzi |
Hypercube Computations on Partitioned Optical Passive Stars Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 17(6), pp. 497-507, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
partitioned optical passive stars network, hypercube simulation, Parallel architectures, permutation routing, prefix sums |
34 | Igor E. Shparlinski, Arne Winterhof |
Noisy interpolation of sparse polynomials in finite fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 16(5), pp. 307-317, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Noisy interpolation, Finite fields, Lattice reduction, Exponential sums, Sparse polynomials, Hidden number problem |
34 | Young J. Kim, Ming C. Lin, Dinesh Manocha |
Incremental Penetration Depth Estimation between Convex Polytopes Using Dual-Space Expansion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 10(2), pp. 152-163, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
haptic rendering, incremental algorithm, Minkowski sums, Gauss map, Penetration depth |
34 | Patrick Solé, Dmitrii Zinoviev |
Weighted Degree Trace Codes for PAPR Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SETA ![In: Sequences and Their Applications - SETA 2004, Third International Conference, Seoul, Korea, October 24-28, 2004, Revised Selected Papers, pp. 406-413, 2004, Springer, 3-540-26084-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
hybrid character sums, PSK, Correlation, CDMA, PAPR, Galois Rings |
34 | Andreas Klappenecker, Martin Rötteler |
Constructions of Mutually Unbiased Bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Finite Fields and Applications ![In: Finite Fields and Applications, 7th International Conference, Fq7, Toulouse, France, May 5-9, 2003, Revised Papers, pp. 137-144, 2003, Springer, 3-540-21324-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
quantum state estimation, Weil sums, finite fields, Quantum cryptography, Galois rings |
34 | Edwin El Mahassni, Phong Q. Nguyen, Igor E. Shparlinski |
The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CaLC ![In: Cryptography and Lattices, International Conference, CaLC 2001, Providence, RI, USA, March 29-30, 2001, Revised Papers, pp. 97-109, 2001, Springer, 3-540-42488-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Exponential Sums, DSA, Hidden Number Problem, Closest Vector Problem |
34 | Francis Clarke |
The Discrete Fourier Transform of a Recurrent Sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 8(6), pp. 485-489, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Recurrent sequences, Finite fields, Character sums, Signal theory |
34 | Serge G. Vladut |
Two applications of Weil-Serre's explicit formula. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 7(4), pp. 279-288, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Curves over finite fields, Exponential sums, Algebraic geometry codes |
29 | Victor Milenkovic, Elisha Sacks, Min-Ho Kyung |
Robust Minkowski sums of polyhedra via controlled linear perturbation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symposium on Solid and Physical Modeling ![In: ACM Symposium on Solid and Physical Modeling, Proceedings of the 15th ACM Symposium on Solid and Physical Modeling, SPM 2010, Haifa, Israel, September 1-3, 2010, pp. 23-30, 2010, ACM, 978-1-60558-984-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
perturbation methods, robust computational geometry |
29 | Peter Hachenberger |
Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra into Convex Pieces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(2), pp. 329-345, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Decomposition of polyhedra into convex pieces, Nef polyhedra, Tight passage, Exact arithmetic, Minkowski sum |
29 | Gerth Stølting Brodal, Allan Grønlund Jørgensen |
Selecting Sums in Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 100-111, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Yan Gérard |
Reconstructing a Matrix with a Given List of Coefficients and Prescribed Row and Column Sums Is NP-Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCIA ![In: Combinatorial Image Analysis, 12th International Workshop, IWCIA 2008, Buffalo, NY, USA, April 7-9, 2008. Proceedings, pp. 363-371, 2008, Springer, 978-3-540-78274-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
combinatorial matrix theory, NP-completeness, discrete tomography |
29 | Jacek Izydorczyk, Jan Chojcan |
Invariant sums of higher order sensitivities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS ![In: International Symposium on Circuits and Systems (ISCAS 2008), 18-21 May 2008, Sheraton Seattle Hotel, Seattle, Washington, USA, pp. 1284-1287, 2008, IEEE, 978-1-4244-1683-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Peter Hachenberger |
Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 669-680, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Honggang Hu, Dengguo Feng, Wenling Wu |
Incomplete exponential sums over galois rings with applications to some binary sequences derived from Z2l. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(5), pp. 2260-2265, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Christian Elsholtz |
A Short Survey on Upper and Lower Bounds for Multidimensional Zero Sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GTIT-C ![In: General Theory of Information Transfer and Combinatorics, pp. 1079-1080, 2006, Springer, 3-540-46244-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Ron Wein |
Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 829-840, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao |
Improved Algorithms for the k Maximum-Sums Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 799-808, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Efi Fogel, Dan Halperin |
Exact Minkowski sums of convex polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 382-383, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Marc J. van Kreveld, A. Frank van der Stappen |
Approximate Unions of Lines and Minkowski Sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 448-459, 2004, Springer, 3-540-23025-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Andrzej Skowron, Jaroslaw Stepaniuk |
Constrained Sums of Information Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Rough Sets and Current Trends in Computing ![In: Rough Sets and Current Trends in Computing, 4th International Conference, RSCTC 2004, Uppsala, Sweden, June 1-5, 2004, Proceedings, pp. 300-309, 2004, Springer, 3-540-22117-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Ha Q. Le |
Simplification of definite sums of rational functions by creative symmetrizing method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2002, Lille, France, July 7-10, 2002, Proceedings, pp. 161-167, 2002, ACM, 1-58113-484-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Olga Caprotti |
An Object-Oriented Approach to Indexed Mathematical Objects for the Manipulation of Sums and Series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISCO ![In: Design and Implementation of Symbolic Computation Systems, International Symposium, DISCO '92, Bath, UK, April 13-15, 1992, Proceedings, pp. 203-214, 1992, Springer, 3-540-57272-4. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
29 | Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister |
Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 42(1), pp. 22-36, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Interval problems, Convex hulls, Computational biology, Minkowski sums |
29 | Rajeev Raman, Venkatesh Raman 0001, Srinivasa Rao Satti |
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(4), pp. 43, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Dictionaries, sets, perfect hashing, multisets, prefix sums, tries, succinct data structures |
29 | Haripriyan Hampapuram, Michael L. Fredman |
Optimal Bi-Weighted Binary Trees and the Complexity of Maintaining Partial Sums ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 480-485, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
optimal bi-weighted binary trees, maintaining partial sums, complexity, data structure, lower bounds, upper bounds, weighting scheme, query operation |
29 | Johannes Blömer |
Computing Sums of Radicals in Polynomial Time ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 670-677, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
positive rational integer, probabilistic checking, sums of radicals, coefficient representation, subalgorithm, real algebraic number field, polynomial time algorithm, decidability, Monte Carlo algorithm |
29 | Sally G. Smith |
Incremental Computation of Squares and Sums of Squares. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 38(9), pp. 1325-1328, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
bit-sequential operation, symmetry properties, incremental multipliers, hardware modules, digit-on-line algorithm, magnitude extraction operations, plane vectors, digital arithmetic, scalar multiplication, hardware architectures, incremental algorithm, sums of squares |
25 | Bahman Kalantari, Isabella Lari, Federica Ricca, Bruno Simeone |
On the complexity of general matrix scaling and entropy minimization via the RAS algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 112(2), pp. 371-401, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Young Gil Kim, Norman C. Beaulieu |
Comparison of Erasure Tests with Diversity Reception for Noncoherent M-ary FSK Signaling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICC ![In: Proceedings of IEEE International Conference on Communications, ICC 2008, Beijing, China, 19-23 May 2008, pp. 1339-1344, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Matthias Blume, Umut A. Acar, Wonseok Chae |
Exception Handlers as Extensible Cases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems, 6th Asian Symposium, APLAS 2008, Bangalore, India, December 9-11, 2008. Proceedings, pp. 273-289, 2008, Springer, 978-3-540-89329-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Mokshay M. Madiman, Andrew R. Barron |
Generalized Entropy Power Inequalities and Monotonicity Properties of Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(7), pp. 2317-2329, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Benjamin Doerr, Tobias Friedrich 0001, Christian Klein 0001, Ralf Osbild |
Rounding of Sequences and Matrices, with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers, pp. 96-109, 2005, Springer, 3-540-32207-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Brett A. Tangedal |
Lagrange Resolvents Constructed from Stark Units. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANTS ![In: Algorithmic Number Theory, 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings, pp. 426-441, 2004, Springer, 3-540-22156-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Olivier Danvy, Karoline Malmkjær, Jens Palsberg |
Eta-Expansion Does The Trick. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 18(6), pp. 730-751, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
binding-time analysis and improvement, eta-expansion, static reduction, partial evaluation, program specialization |
25 | Rong Lin, Stephan Olariu |
Reconfigurable Buses with Shift Switching: Concepts and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 6(1), pp. 93-102, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
25 | Carlo Harpes, Gerhard Kramer, James L. Massey |
A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-Up Lemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '95, International Conference on the Theory and Application of Cryptographic Techniques, Saint-Malo, France, May 21-25, 1995, Proceeding, pp. 24-38, 1995, Springer, 3-540-59409-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
piling-up lemma, SAFER K-64, differential cryptanalysis, Linear cryptanalysis, IDEA |
25 | Günter Kemnitz |
Synthesis of locally exhaustive test pattern generators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTS ![In: 13th IEEE VLSI Test Symposium (VTS'95), April 30 - May 3, 1995, Princeton, New Jersey, USA, pp. 440-447, 1995, IEEE Computer Society, 0-8186-7000-2. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
locally exhaustive TPG, linear sum computation, TPG synthesis, logic testing, integrated circuit testing, automatic testing, test pattern generators |
25 | Anand Srivastav, Peter Stangier |
Algorthmic Chernoff-Hoeffding Inequalitiers in Integer Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, pp. 226-233, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
25 | Norman D. Thomson |
Understanding ANOVA the APL way. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APL ![In: Proceedings of the International Conference on APL 1993, Toronto, Ontario, Canada, August 15-19, 1993., pp. 295-303, 1993, ACM, 0-89791-612-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
APL |
25 | Álvar Ibeas, Arne Winterhof |
Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 18th International Symposium, AAECC-18 2009, Tarragona, Catalonia, Spain, June 8-12, 2009. Proceedings, pp. 169-178, 2009, Springer, 978-3-642-02180-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Noisy interpolation, Lattice reduction, Exponential sums, Sparse polynomials, Hidden number problem |
25 | Markus Schweighofer |
Describing convex semialgebraic sets by linear matrix inequalities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings, pp. 385-386, 2009, ACM, 978-1-60558-609-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
determinantal representation, moment relaxation, polynomial inequality, quadratic module, semialgebraic set, spectrahedron, semidefinite programming, linear matrix inequality, convex set, sums of squares, preordering |
25 | Veli Mäkinen, Gonzalo Navarro 0001 |
Dynamic entropy-compressed sequences and full-text indexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(3), pp. 32:1-32:38, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Compressed dynamic data structures, compressed text databases, partial sums, entropy, sequences |
25 | Stanley C. Eisenstat |
O(log* n) algorithms on a Sum-CRCW PRAM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 79(1), pp. 93-97, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
parallel prefix sums, linear integer sorting, Parallel random access machine |
25 | Zhixiong Chen 0002, Ning Zhang, Guozhen Xiao |
Pseudo-Randomness of Discrete-Log Sequences from Elliptic Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inscrypt ![In: Information Security and Cryptology, Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers, pp. 231-245, 2007, Springer, 978-3-540-79498-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
elliptic curves, discrete logarithm, discrepancy, linear complexity, pseudo-random sequences, character sums |
25 | Wolfgang Hackbusch, Boris N. Khoromskij |
Low-rank Kronecker-product Approximation to Multi-dimensional Nonlocal Operators. Part I. Separable Approximation of Multi-variate Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 76(3-4), pp. 177-202, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Kronecker tensor-product, sinc interpolation, sinc quadrature, approximation by exponential sums, Hierarchical matrices |
25 | Pierre-Alain Fouque, David Pointcheval, Jacques Stern, Sébastien Zimmer |
Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II, pp. 240-251, 2006, Springer, 3-540-35907-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Diffie-Hellman transform, exponential sums, least significant bits, randomness extraction |
25 | Mario Szegedy |
The DLT priority sampling is essentially optimal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 150-158, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
integral formula, priority sampling, subset sum estimate, telescopic sums, network measurement, Internet traffic |
25 | Stephen D. Cohen |
Finite Field Elements with Specified Order and Traces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 36(3), pp. 331-340, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
specified traces, finite field, primitive element, character sums |
25 | Naga K. Govindaraju, Ming C. Lin, Dinesh Manocha |
Fast and reliable collision detection using graphics processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 384-385, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
collision detection, deformable models, graphics hardware, Minkowski sums |
25 | Denis Denisov, Serguei Foss, Dima Korshunov |
Tail Asymptotics for the Supremum of a Random Walk when the Mean Is not Finite. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 46(1-2), pp. 15-33, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
supremum of sums of random variables, large deviation probabilities, integrated weighted tail distribution, subexponential distribution |
25 | Mihai Patrascu, Erik D. Demaine |
Lower bounds for dynamic connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 546-553, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
cell-probe complexity, dynamic connectivity, dynamic graph problems, lower bounds for data structures, partial sums problem |
Displaying result #1 - #100 of 2852 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|