The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase i-sums (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1958-1973 (19) 1974-1977 (16) 1978-1980 (17) 1981-1983 (15) 1984-1985 (18) 1986-1987 (18) 1988 (15) 1989 (19) 1990 (16) 1991-1992 (36) 1993 (29) 1994 (15) 1995 (35) 1996 (40) 1997 (27) 1998 (40) 1999 (46) 2000 (44) 2001 (57) 2002 (71) 2003 (73) 2004 (94) 2005 (103) 2006 (140) 2007 (122) 2008 (148) 2009 (121) 2010 (90) 2011 (89) 2012 (76) 2013 (123) 2014 (82) 2015 (105) 2016 (99) 2017 (101) 2018 (110) 2019 (106) 2020 (109) 2021 (103) 2022 (115) 2023 (111) 2024 (39)
Publication types (Num. hits)
article(2004) book(2) incollection(20) inproceedings(815) phdthesis(11)
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
97Jean-Marc Deshouillers, François Hennecart, Bernard Landreau Do Sums of 4 Biquadrates Have a Positive Density? Search on Bibsonomy ANTS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
63Xiwang Cao Some New Identities on Kloosterman Sums. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
63Yutaka Hata, Naotake Kamiura, Kazuharu Yamato Multiple-Valued Product-of-Sums Expression with Truncated Sum. Search on Bibsonomy ISMVL The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
63Marc J. van Kreveld, A. Frank van der Stappen Approximate Unions of Lines and Minkowski Sums. Search on Bibsonomy Algorithmica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Algorithms, Approximation, Minkowski sums, Combinatorial complexity
54Chunjiang J. Duanmu, M. Omair Ahmad, M. N. S. Swamy Fast Block Motion Estimation With 8-Bit Partial Sums Using SIMD Architectures. Search on Bibsonomy IEEE Trans. Circuits Syst. Video Technol. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
54Gerth Stølting Brodal, Allan Grønlund Jørgensen A Linear Time Algorithm for the k Maximal Sums Problem. Search on Bibsonomy MFCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
54Cristina Bazgan, Miklos Santha, Zsolt Tuza Efficient Approximation Algorithms for the Subset-Sums Equality Problem. Search on Bibsonomy ICALP The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
54Kurt Mehlhorn Some Remarks on Boolean Sums. Search on Bibsonomy MFCS The full citation details ... 1979 DBLP  DOI  BibTeX  RDF
54Tien-Ching Lin, D. T. Lee Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem. Search on Bibsonomy ISAAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF k maximum sums problem, sum selection problem, maximum sum problem, maximum sum subarray problem
54Angelo Ciaramella, Witold Pedrycz, Roberto Tagliaferri OR/AND Neurons for Fuzzy Set Connectives Using Ordinal Sums and Genetic Algorithms. Search on Bibsonomy WILF The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Fuzzy Logic Connectives, t-norms (t-conorms), Ordinal Sums, Experiments with Logic Connectives, Genetic Algorithms
54Christian Costermans, Jean-Yves Enjalbert, Vincel Hoang Ngoc Minh, Michel Petitot Structure and asymptotic expansion of multiple harmonic sums. Search on Bibsonomy ISSAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Lyndon words, multiple harmonic sums, polylogarithms, polyzêtas
54Eyal Flato, Efi Fogel, Dan Halperin, Eran Leiserowitz Exact minkowski sums and applications. Search on Bibsonomy SCG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF geometric software, robustness and precision, motion planning, arrangements, Minkowski sums
54Alan A. Bertossi, Alessandro Mei A Residue Number System on Reconfigurable Mesh with Applications to Prefix Sums and Approximate String Matching. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF string matching with $k$ mismatches, VLSI, residue number system, reconfigurable mesh, prefix sums, Number representation
54Rong Lin, Koji Nakano, Stephan Olariu, Maria Cristina Pinotti, James L. Schwing, Albert Y. Zomaya Scalable Hardware-Algorithms for Binary Prefix Sums. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF shift switching, binary prefix sums, binary counting, pipelining, scalable architectures, Hardware-algorithms
54Tor Helleseth, Thomas Johansson 0001 Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings. Search on Bibsonomy CRYPTO The full citation details ... 1996 DBLP  DOI  BibTeX  RDF exponential sums, Galois rings, authentication codes, Universal hash functions
51Irfan 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 MIPR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
51Rida T. Farouki, Hwan Pyo Moon, Bahram Ravani Algorithms for Minkowski products and implicitly-defined complex sets. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 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
51Sihem Mesnager A New Family of Hyper-Bent Boolean Functions in Polynomial Form. Search on Bibsonomy IMACC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Hyper-bent functions, Maximum nonlinearity, Kloosterman sums, Cubic sums, Boolean function, Bent functions, Walsh-Hadamard transformation
51Gerardo Vega Determining the Number of One-Weight Cyclic Codes When Length and Dimension Are Given. Search on Bibsonomy WAIFI The full citation details ... 2007 DBLP  DOI  BibTeX  RDF One-weight cyclic codes, linear recurring sequences, exponential sums and Gaussian sums
46Qingping Tao, Stephen D. Scott 0001 Improved MCMC sampling methods for estimating weighted sums in Winnow with application to DNF learning. Search on Bibsonomy Mach. Learn. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Markov chain Monte Carlo, DNF, Winnow
46Marc 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 IEEE Trans. Inf. Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
46Zhibin Pan, Tadahiro Ohmi, Koji Kotani Constructing Better Partial Sums Based on Energy-Maximum Criterion for Fast Encoding of VQ. Search on Bibsonomy APCCAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
46Matthias Beck, Sinai Robins Explicit and Efficient Formulas for the Lattice Point Count in Rational Polygons Using Dedekind - Rademacher Sums. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
46Feng Zhou, Peter Kornerup Computing Moments by Prefix Sums. Search on Bibsonomy J. VLSI Signal Process. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
46Norbert Völker Disjoint Sums over Type Classes in HOL. Search on Bibsonomy TPHOLs The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
46Rong Lin, Koji Nakano, Stephan Olariu, Albert Y. Zomaya An Efficient Parallel Prefix Sums Architecture with Domino Logic. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF shift switching, binary prefix sums, binary counting, VLSI design, scalable architectures, domino logic, Hardware-algorithms
46Koji Chinen, Toyokazu Hiramatsu Hyper-Kloosterman Sums and their Applications to the Coding Theory. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Hyper-Kloosterman sums, Trace code, Weight distribution of codes
46Ali Uzer, T. Ege On the Convergence Acceleration of Slowly Convergent Sums Involving Oscillating Terms. Search on Bibsonomy Computing The full citation details ... 2005 DBLP  DOI  BibTeX  RDF slowly convergent sums, infinite sums, Fourier series, zeta functions, Convergence acceleration
42Ivona Bezáková, Nayantara Bhatnagar, Eric Vigoda Sampling binary contingency tables with a greedy start. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
42Kin-Fai Kan, David W. Cheung, Ben Kao Maintenance of Partial-Sum-Based Histograms. Search on Bibsonomy DASFAA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
42Wei Li 0024, Sara McMains A GPU-based voxelization approach to 3D Minkowski sum computation. Search on Bibsonomy Symposium on Solid and Physical Modeling The full citation details ... 2010 DBLP  DOI  BibTeX  RDF GPU, path planning, voxelization, Minkowski sums, penetration depth
42Matthias Blume, Umut A. Acar, Wonseok Chae Extensible programming with first-class cases. Search on Bibsonomy ICFP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF first-class cases, duality, records, sums
42Tien-Ching Lin, D. T. Lee Randomized Algorithm for the Sum Selection Problem. Search on Bibsonomy ISAAC The full citation details ... 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
42Parampalli Udaya, Serdar Boztas On the Aperiodic Correlation Function of Galois Ring m-Sequences. Search on Bibsonomy AAECC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Quadriphase sequences, Aperiodic correlations, Gauss sums over Galois rings, Galois Rings
37Petr Lisonek On the Connection between Kloosterman Sums and Elliptic Curves. Search on Bibsonomy SETA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Kloosterman sum, finite field, elliptic curve
37Masakazu Kojima, Masakazu Muramatsu An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones. Search on Bibsonomy Math. Program. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Polynomial optimization problem, Symmetric cone, Euclidean Jordan algebra, Global optimization, Semidefinite program, Sum of squares, Conic program
37Gilles Lachaud Exponential Sums as Discrete Fourier Transform with Invariant Phase Functions. Search on Bibsonomy AAECC The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
37Martin Dietzfelbinger Lower Bounds for Sorting of Sums. Search on Bibsonomy ICALP The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
37Itamar Francez No i-Sums for Nissim (and Shalom). Search on Bibsonomy Languages: From Formal to Natural The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Donkey anaphora, E-type pronouns, strong and weak readings, i-sums
37Yoshinori Hamahata Finite Dedekind Sums. Search on Bibsonomy WAIFI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Dedekind sums, Drinfeld modules, lattices
37Masakazu Kojima, Sunyoung Kim, Hayato Waki Sparsity in sums of squares of polynomials. Search on Bibsonomy Math. Program. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Sums of squares of polynomial, Polynomial optimization problem, Semidefinite program, Sparsity
37Vincent Balat, Roberto Di Cosmo, Marcelo P. Fiore Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums. Search on Bibsonomy POPL The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Grothendieck logical relations, strong sums, type-directed partial evaluation, typed lambda calculus, normalisation
37Sung 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 ISPAN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF maximum subarray, maximum subsequence, VLSI, prefix sums
37Peter J. Grabner, Tamás Herendi, Robert F. Tichy Fractal digital sums and codes. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Thue-Morse sequence, Digital expansions, Codes, Exponential sums
37Rong Lin, Stephan Olariu A simple array processor for binary prefix sums. Search on Bibsonomy ASAP The full citation details ... 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
36Liqin Qian, Xiwang Cao Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
34Mary Cryan, Martin E. Dyer A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
34Daciana Bochis, Francisco Santos On the Number of Facets of Three-Dimensional Dirichlet Stereohedra I: Groups with Reflections. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
34Alessandro Mei, Romeo Rizzi Hypercube Computations on Partitioned Optical Passive Stars Networks. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF partitioned optical passive stars network, hypercube simulation, Parallel architectures, permutation routing, prefix sums
34Igor E. Shparlinski, Arne Winterhof Noisy interpolation of sparse polynomials in finite fields. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Noisy interpolation, Finite fields, Lattice reduction, Exponential sums, Sparse polynomials, Hidden number problem
34Young J. Kim, Ming C. Lin, Dinesh Manocha Incremental Penetration Depth Estimation between Convex Polytopes Using Dual-Space Expansion. Search on Bibsonomy IEEE Trans. Vis. Comput. Graph. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF haptic rendering, incremental algorithm, Minkowski sums, Gauss map, Penetration depth
34Patrick Solé, Dmitrii Zinoviev Weighted Degree Trace Codes for PAPR Reduction. Search on Bibsonomy SETA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF hybrid character sums, PSK, Correlation, CDMA, PAPR, Galois Rings
34Andreas Klappenecker, Martin Rötteler Constructions of Mutually Unbiased Bases. Search on Bibsonomy International Conference on Finite Fields and Applications The full citation details ... 2003 DBLP  DOI  BibTeX  RDF quantum state estimation, Weil sums, finite fields, Quantum cryptography, Galois rings
34Edwin 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 CaLC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Exponential Sums, DSA, Hidden Number Problem, Closest Vector Problem
34Francis Clarke The Discrete Fourier Transform of a Recurrent Sequence. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Recurrent sequences, Finite fields, Character sums, Signal theory
34Serge G. Vladut Two applications of Weil-Serre's explicit formula. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Curves over finite fields, Exponential sums, Algebraic geometry codes
29Victor Milenkovic, Elisha Sacks, Min-Ho Kyung Robust Minkowski sums of polyhedra via controlled linear perturbation. Search on Bibsonomy Symposium on Solid and Physical Modeling The full citation details ... 2010 DBLP  DOI  BibTeX  RDF perturbation methods, robust computational geometry
29Peter Hachenberger Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra into Convex Pieces. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Decomposition of polyhedra into convex pieces, Nef polyhedra, Tight passage, Exact arithmetic, Minkowski sum
29Gerth Stølting Brodal, Allan Grønlund Jørgensen Selecting Sums in Arrays. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
29Yan Gérard Reconstructing a Matrix with a Given List of Coefficients and Prescribed Row and Column Sums Is NP-Hard. Search on Bibsonomy IWCIA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF combinatorial matrix theory, NP-completeness, discrete tomography
29Jacek Izydorczyk, Jan Chojcan Invariant sums of higher order sensitivities. Search on Bibsonomy ISCAS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
29Peter Hachenberger Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces. Search on Bibsonomy ESA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
29Honggang Hu, Dengguo Feng, Wenling Wu Incomplete exponential sums over galois rings with applications to some binary sequences derived from Z2l. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
29Christian Elsholtz A Short Survey on Upper and Lower Bounds for Multidimensional Zero Sums. Search on Bibsonomy GTIT-C The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
29Ron Wein Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method. Search on Bibsonomy ESA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
29Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao Improved Algorithms for the k Maximum-Sums Problems. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
29Efi Fogel, Dan Halperin Exact Minkowski sums of convex polyhedra. Search on Bibsonomy SCG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
29Marc J. van Kreveld, A. Frank van der Stappen Approximate Unions of Lines and Minkowski Sums. Search on Bibsonomy ESA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
29Andrzej Skowron, Jaroslaw Stepaniuk Constrained Sums of Information Systems. Search on Bibsonomy Rough Sets and Current Trends in Computing The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
29Ha Q. Le Simplification of definite sums of rational functions by creative symmetrizing method. Search on Bibsonomy ISSAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
29Olga Caprotti An Object-Oriented Approach to Indexed Mathematical Objects for the Manipulation of Sums and Series. Search on Bibsonomy DISCO The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
29Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Interval problems, Convex hulls, Computational biology, Minkowski sums
29Rajeev Raman, Venkatesh Raman 0001, Srinivasa Rao Satti Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Dictionaries, sets, perfect hashing, multisets, prefix sums, tries, succinct data structures
29Haripriyan Hampapuram, Michael L. Fredman Optimal Bi-Weighted Binary Trees and the Complexity of Maintaining Partial Sums Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF optimal bi-weighted binary trees, maintaining partial sums, complexity, data structure, lower bounds, upper bounds, weighting scheme, query operation
29Johannes Blömer Computing Sums of Radicals in Polynomial Time Search on Bibsonomy FOCS The full citation details ... 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
29Sally G. Smith Incremental Computation of Squares and Sums of Squares. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 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
25Bahman Kalantari, Isabella Lari, Federica Ricca, Bruno Simeone On the complexity of general matrix scaling and entropy minimization via the RAS algorithm. Search on Bibsonomy Math. Program. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
25Young Gil Kim, Norman C. Beaulieu Comparison of Erasure Tests with Diversity Reception for Noncoherent M-ary FSK Signaling. Search on Bibsonomy ICC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
25Matthias Blume, Umut A. Acar, Wonseok Chae Exception Handlers as Extensible Cases. Search on Bibsonomy APLAS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
25Mokshay M. Madiman, Andrew R. Barron Generalized Entropy Power Inequalities and Monotonicity Properties of Information. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
25Benjamin Doerr, Tobias Friedrich 0001, Christian Klein 0001, Ralf Osbild Rounding of Sequences and Matrices, with Applications. Search on Bibsonomy WAOA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
25Brett A. Tangedal Lagrange Resolvents Constructed from Stark Units. Search on Bibsonomy ANTS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
25Olivier Danvy, Karoline Malmkjær, Jens Palsberg Eta-Expansion Does The Trick. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF binding-time analysis and improvement, eta-expansion, static reduction, partial evaluation, program specialization
25Rong Lin, Stephan Olariu Reconfigurable Buses with Shift Switching: Concepts and Applications. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
25Carlo Harpes, Gerhard Kramer, James L. Massey A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-Up Lemma. Search on Bibsonomy EUROCRYPT The full citation details ... 1995 DBLP  DOI  BibTeX  RDF piling-up lemma, SAFER K-64, differential cryptanalysis, Linear cryptanalysis, IDEA
25Günter Kemnitz Synthesis of locally exhaustive test pattern generators. Search on Bibsonomy VTS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF locally exhaustive TPG, linear sum computation, TPG synthesis, logic testing, integrated circuit testing, automatic testing, test pattern generators
25Anand Srivastav, Peter Stangier Algorthmic Chernoff-Hoeffding Inequalitiers in Integer Programming. Search on Bibsonomy ISAAC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
25Norman D. Thomson Understanding ANOVA the APL way. Search on Bibsonomy APL The full citation details ... 1993 DBLP  DOI  BibTeX  RDF APL
25Álvar Ibeas, Arne Winterhof Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields. Search on Bibsonomy AAECC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Noisy interpolation, Lattice reduction, Exponential sums, Sparse polynomials, Hidden number problem
25Markus Schweighofer Describing convex semialgebraic sets by linear matrix inequalities. Search on Bibsonomy ISSAC The full citation details ... 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
25Veli Mäkinen, Gonzalo Navarro 0001 Dynamic entropy-compressed sequences and full-text indexes. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Compressed dynamic data structures, compressed text databases, partial sums, entropy, sequences
25Stanley C. Eisenstat O(log* n) algorithms on a Sum-CRCW PRAM. Search on Bibsonomy Computing The full citation details ... 2007 DBLP  DOI  BibTeX  RDF parallel prefix sums, linear integer sorting, Parallel random access machine
25Zhixiong Chen 0002, Ning Zhang, Guozhen Xiao Pseudo-Randomness of Discrete-Log Sequences from Elliptic Curves. Search on Bibsonomy Inscrypt The full citation details ... 2007 DBLP  DOI  BibTeX  RDF elliptic curves, discrete logarithm, discrepancy, linear complexity, pseudo-random sequences, character sums
25Wolfgang 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 Computing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Kronecker tensor-product, sinc interpolation, sinc quadrature, approximation by exponential sums, Hierarchical matrices
25Pierre-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 ICALP (2) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Diffie-Hellman transform, exponential sums, least significant bits, randomness extraction
25Mario Szegedy The DLT priority sampling is essentially optimal. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF integral formula, priority sampling, subset sum estimate, telescopic sums, network measurement, Internet traffic
25Stephen D. Cohen Finite Field Elements with Specified Order and Traces. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF specified traces, finite field, primitive element, character sums
25Naga K. Govindaraju, Ming C. Lin, Dinesh Manocha Fast and reliable collision detection using graphics processors. Search on Bibsonomy SCG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF collision detection, deformable models, graphics hardware, Minkowski sums
25Denis Denisov, Serguei Foss, Dima Korshunov Tail Asymptotics for the Supremum of a Random Walk when the Mean Is not Finite. Search on Bibsonomy Queueing Syst. Theory Appl. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF supremum of sums of random variables, large deviation probabilities, integrated weighted tail distribution, subexponential distribution
25Mihai Patrascu, Erik D. Demaine Lower bounds for dynamic connectivity. Search on Bibsonomy STOC The full citation details ... 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][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license