The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for bounds with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1955-1961 (18) 1962-1964 (16) 1965-1967 (30) 1968 (16) 1969 (21) 1970-1971 (36) 1972 (31) 1973 (26) 1974 (46) 1975 (41) 1976 (43) 1977 (50) 1978 (36) 1979 (47) 1980 (49) 1981 (47) 1982 (45) 1983 (65) 1984 (55) 1985 (95) 1986 (102) 1987 (89) 1988 (126) 1989 (152) 1990 (189) 1991 (224) 1992 (333) 1993 (288) 1994 (359) 1995 (361) 1996 (328) 1997 (420) 1998 (455) 1999 (530) 2000 (573) 2001 (721) 2002 (707) 2003 (911) 2004 (1080) 2005 (1246) 2006 (1453) 2007 (1484) 2008 (1698) 2009 (1292) 2010 (744) 2011 (751) 2012 (711) 2013 (869) 2014 (805) 2015 (890) 2016 (994) 2017 (987) 2018 (1087) 2019 (1037) 2020 (1116) 2021 (1137) 2022 (1148) 2023 (1256) 2024 (297)
Publication types (Num. hits)
article(16343) book(4) incollection(96) inproceedings(13160) phdthesis(158) proceedings(2)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 11526 occurrences of 4704 keywords

Results
Found 29774 publication records. Showing 29763 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
20Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan Competitive Algorithms for Layered Graph Traversal Search on Bibsonomy FOCS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF deterministic online algorithm, layered graph traversal, searcher, target vertex, lower bounds, upper bounds, weighted graph, competitive algorithms
20Karl R. Abrahamson A Time-Space Tradeoff for Boolean Matrix Multiplication Search on Bibsonomy FOCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF branching program model, lower bounds, upper bounds, deterministic algorithm, semiring, time-space tradeoff, Boolean matrix multiplication
20Edward A. Bender, Jon T. Butler On the Size of PLA's Required to Realize Binary and Multiple-Valued Functions. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1989 DBLP  DOI  BibTeX  RDF product terms, nonzero output values, PLA size, realizable functions, lower bounds, logic design, upper bounds, variance, switching functions, logic arrays, minimisation of switching nets, multiple-valued functions
20Gary L. Miller, Joseph Naor Flow in Planar Graphs with Multiple Sources and Sinks (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF multiple sources, planar network, exclusive-read-exclusive-write parallel random-access machine, edge capacities, lower bounds, time complexity, planar graphs, upper bounds, face, maximum flow, EREW PRAM, demand, sinks
20Michael L. Fredman, Deborah L. Goldsmith Three Stacks Search on Bibsonomy FOCS The full citation details ... 1988 DBLP  DOI  BibTeX  RDF lower complexity bounds, upper complexity bounds, three stacks, additional time, additional space, memory, collisions, storage allocation, pointers, linked lists, relocating
19Shai Ben-David, Reba Schuller Borbely A notion of task relatedness yielding provable multiple-task learning guarantees. Search on Bibsonomy Mach. Learn. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Classification prediction, Task relatedness, Learning theory, VC-dimension, Multi-task learning, Inductive transfer, Generalization bounds
19Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum Bit complexity of breaking and achieving symmetry in chains and rings. Search on Bibsonomy J. ACM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF bit complexity, processor chain, processor ring, symmetric synchronous execution, Distributed computing, lower bounds, consensus, communication complexity, leader election, communication cost, message complexity, tight bound
19Giovanni Cavallanti, Nicolò Cesa-Bianchi, Claudio Gentile Tracking the best hyperplane with a simple budget Perceptron. Search on Bibsonomy Mach. Learn. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mistake bounds, Budget algorithms, Pattern classification, Perceptron algorithm
19Peter Høyer, Troy Lee, Robert Spalek Negative weights make adversaries stronger. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF adversary method, certificate complexity barrier, formula size, quantum query complexity, lower bounds, quantum computing
19Therese C. Biedl, Torsten Thiele, David R. Wood Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. Search on Bibsonomy Algorithmica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Lower bounds, Graph drawing, Three-dimensional, Orthogonal
19Daler N. Rakhmatov Energy budgeting for battery-powered sensors with a known task schedule. Search on Bibsonomy ICCAD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF battery voltage modeling, energy bounds, low-power design
19Zhihua Xiong, Jie Zhang 0005 Optimal Control of Fed-Batch Processes Based on Multiple Neural Networks. Search on Bibsonomy Appl. Intell. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF multiple neural networks, confidence bounds, optimal control, batch processes
19Menelaos I. Karavelas, Panagiotis D. Kaklis, Konstantinos V. Kostas Bounding the Distance between 2D Parametric Bézier Curves and their Control Polygon. Search on Bibsonomy Computing The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Parametric Bézier curves, control polygon, polygonal envelopes, bounding region, optimal-orientation bounds, collision detection
19Sylvain Pion, Chee-Keng Yap Constructive root bound for k-ary rational input numbers. Search on Bibsonomy SCG The full citation details ... 2003 DBLP  DOI  BibTeX  RDF constructive root bounds, k-ary rational numbers, robust numerical algorithms, exact geometric computation
19Kazuyuki Amano, Akira Maruoka Some Properties of MODm Circuits Computing Simple Functions. Search on Bibsonomy CIAC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF modular circuits, composite modulus, lower bounds, Fourier analysis, symmetric functions
19Anita Amberg, Stefan Voß 0001 A Hierarchical Relaxations Lower Bound for the Capacitated Arc Routing Problem. Search on Bibsonomy HICSS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Capacitated arc routing problem, lower bounds, transportation, vehicle routing
19Knut Petras On the Smolyak cubature error for analytic functions. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Smolyak algorithm, Clenshaw-Curtis quadrature, Kronrod-Patterson quadrature, 41A55, error bounds, 41A63, 65D32, cubature, 65D30, analytic functions
19Eric Allender, Michael E. Saks, Igor E. Shparlinski A Lower Bound for Primality. Search on Bibsonomy CCC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Circuit Complexity Lower Bounds, Primality, Square-Free Numbers, GCD
19Ran Raz, Pierre McKenzie Separation of the Monotone NC Hierarchy. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF monotone NC hierarchy, tight lower bounds, monotone depth, DART games, communication complexity, communication complexity, search problems, monotone Boolean function
19Maria Luisa Bonet, Toniann Pitassi, Ran Raz No Feasible Interpolation for TC0-Frege Proofs. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF TC/sup 0/-Frege proofs, feasible interpolation, complexity-theoretic assumption, hardness assumption, lower bounds, theorem proving, Chinese Remainder Theorem, proof systems
19Ti-Yen Yen, Wayne H. Wolf Performance estimation for real-time distributed embedded systems. Search on Bibsonomy ICCD The full citation details ... 1995 DBLP  DOI  BibTeX  RDF real-time distributed embedded systems, efficient analysis algorithm, application task, cosynthesis algorithms, bounding algorithms, performance evaluation, real-time systems, distributed processing, ASICs, data dependencies, execution time, performance estimation, CPUs, tight bounds, communication links
19Kenneth W. Fertig, John S. Breese Probability Intervals Over Influence Diagrams. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF Bayesian conditioning, point-valued probabilistic inference mechanisms, computational complexity, lower bounds, probability, sensitivity analysis, sensitivity analysis, inference mechanisms, Bayes methods, probability distributions, probabilistic reasoning, uncertainty handling, influence diagrams, probabilistic queries, conditional expectation
19Ramakrishna Kakarala, Alfred O. Hero III On Achievable Accuracy in Edge Localization. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF S/N ratio, achievable accuracy, statistical parameter estimation, image coordinates, Canny algorithm, pattern recognition, pattern recognition, picture processing, picture processing, sampling, parameter estimation, statistical analysis, maximum-likelihood estimator, quantization, filtering and prediction theory, image intensity, smoothing filter, edge localization, Cramer-Rao bounds
19Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements. Search on Bibsonomy SCG The full citation details ... 2010 DBLP  DOI  BibTeX  RDF orthogonal range reporting, pointer machine, data structures, lower bounds
19Andrew Richards On upper bounds for the tail distribution of geometric sums of subexponential random variables. Search on Bibsonomy Queueing Syst. Theory Appl. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Geometric sum, GI/GI/1, Upper bounds, Subexponential distribution
19Vladimir Lipets Bounds on Mincut for Cayley Graphs over Abelian Groups. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mincut, Algorithms, Graph theory, Combinatorial optimization, Bounds, Cayley graphs, Bisection
19Xiankun Zhang, Minghu Ha 0001, Jing Wu, Chao Wang 0034 The Bounds on the Rate of Uniform Convergence of Learning Process on Uncertainty Space. Search on Bibsonomy ISNN (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Uncertain measure, Expected risk functional, Empirical risk functional, Empirical risk minimization principle, Bounds of the rate of uniform convergence
19Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gibbons, Robert Harper 0001 Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures. Search on Bibsonomy SPAA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF scheduling, work stealing, futures, performance bounds
19Yehuda Lindell Lower Bounds and Impossibility Results for Concurrent Self Composition. Search on Bibsonomy J. Cryptol. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Self and general composition, Non-black-box and black-box simulation, Lower bounds, Secure computation, Protocol composition, Impossibility results
19Beate Bollig, Niko Range, Ingo Wegener Exact OBDD Bounds for Some Fundamental Functions. Search on Bibsonomy SOFSEM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Computational complexity, lower bounds, ordered binary decision diagrams
19Adam R. Klivans, Alexander A. Sherstov Unconditional lower bounds for learning intersections of halfspaces. Search on Bibsonomy Mach. Learn. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Intersections of halfspaces, Halfspace learning, SQ learning, Lower bounds for learning, Harmonic sieve, PAC learning, Query learning, Statistical queries, Polynomial threshold functions
19Jiangzhuo Chen, Robert D. Kleinberg, László Lovász 0001, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta (Almost) Tight bounds and existence theorems for single-commodity confluent flows. Search on Bibsonomy J. ACM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF confluent flow, routing, Approximation algorithms, network flow, tight bounds
19Hoeteck Wee Lower Bounds for Non-interactive Zero-Knowledge. Search on Bibsonomy TCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF set-up assumptions, lower bounds, Non-interactive zero-knowledge
19Mark Nicholas Charles Rhodes Rank Lower Bounds for the Sherali-Adams Operator. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Lift and Project Proof Systems, Rank Lower Bounds, Sherali-Adams Relaxation, Propositional Proof Complexity
19Alkiviadis G. Akritas, Adam W. Strzebonski, Panagiotis S. Vigklas Implementations of a New Theorem for Computing Bounds for Positive Roots of Polynomials. Search on Bibsonomy Computing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF positive roots, polynomial real root isolation, Upper bounds
19Carsten Schneider Degree Bounds to Find Polynomial Solutions of Parameterized Linear Difference Equations in Pi-Sigma-Fields. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Linear Difference Equations, ??-Fields, Degree Bounds
19Cid C. de Souza, André M. Lima, Guido Araujo, Nahri Moreano The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation. Search on Bibsonomy ACM J. Exp. Algorithmics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Data path merging, heuristics, lower bounds, reconfigurable systems
19Anand M. Narasimhamurthy Theoretical Bounds of Majority Voting Performance for a Binary Classification Problem. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF theoretical bounds, classifier diversity measures, Majority voting, Classifier design and evaluation
19Floris Geerts, Bart Goethals, Jan Van den Bussche Tight upper bounds on the number of candidate patterns. Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Data mining, upper bounds, frequent patterns
19Fen Xie, Margaret Martonosi, Sharad Malik Bounds on power savings using runtime dynamic voltage scaling: an exact algorithm and a linear-time heuristic approximation. Search on Bibsonomy ISLPED The full citation details ... 2005 DBLP  DOI  BibTeX  RDF bounds on energy savings, low power, dynamic voltage scaling, linear time
19Scott Aaronson, Yaoyun Shi Quantum lower bounds for the collision and the element distinctness problems. Search on Bibsonomy J. ACM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF element distinctness, polynomial method, quantum lower bounds, quantum computing, Collision
19Arnold Neumaier, Oleg Shcherbina Safe bounds in linear and mixed-integer linear programming. Search on Bibsonomy Math. Program. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF directed rounding, mixed-integer rounding, generalized Gomory cut, safe cuts, safe presolve, certificate of infeasibility, lower bounds, linear programming, mixed-integer programming, interval arithmetic, branch-and-cut, rounding errors
19Jiangzhuo Chen, Robert D. Kleinberg, László Lovász 0001, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta (Almost) tight bounds and existence theorems for confluent flows. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF confluent flow, routing, approximation algorithms, network flow, tight bounds
19Peter Brucker, Sigrid Knust Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF traveling salesman problem with time windows, scheduling, lower bounds, constraint propagation, column generation, time-lags
19Joseph M. Hellerstein, Elias Koutsoupias, Daniel P. Miranker, Christos H. Papadimitriou, Vasilis Samoladas On a model of indexability and its bounds for range queries. Search on Bibsonomy J. ACM The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Database, lower bounds, indexability, redundancy, query, index, multidimensional
19Michael A. Frumkin, Rob F. Van der Wijngaart Tight bounds on cache use for stencil operations on rectangular grids. Search on Bibsonomy J. ACM The full citation details ... 2002 DBLP  DOI  BibTeX  RDF fundamental parallelepiped, lower and upper bounds, reduced basis, structured grids, scientific computing, lattice, Cache memory, cache misses
19Peter G. Bishop Rescaling reliability bounds for a new operational profile. Search on Bibsonomy ISSTA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF operational reliability testing, operational profile, worst case bounds
19Christian Jansson Rigorous Error Bounds for the Optimal Value of Linear Programming Problems. Search on Bibsonomy COCOS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF rigorous error bounds, linear programming, branch-and-bound, sensitivity analysis, interval arithmetic
19Markus Krabbes, Christian Döschner Experimental Estimation of Model Error Bounds Based on Modified Stochastic Approximation. Search on Bibsonomy J. Intell. Robotic Syst. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF feedback linearisation, robust controller design, estimation of error bounds, stochastic approximation, robustness analysis
19Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf Quantum lower bounds by polynomials. Search on Bibsonomy J. ACM The full citation details ... 2001 DBLP  DOI  BibTeX  RDF polynomial method, lower bounds, Quantum computing, query complexity, black-box model
19Saul Abarbanel, Adi Ditkowski, Bertil Gustafsson On Error Bounds of Finite Difference Approximations to Partial Differential Equations - Temporal Behavior and Rate of Convergence. Search on Bibsonomy J. Sci. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF error bounds, finite difference
19Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds. Search on Bibsonomy SSDBM The full citation details ... 2000 DBLP  DOI  BibTeX  RDF approximation with error bounds, interactive statistical analysis, efficient updates, OLAP, online aggregation
19Arie Harel, Su Namn, Jacob Sturm Simple bounds for closed queueing networks. Search on Bibsonomy Queueing Syst. Theory Appl. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF balanced job bounds, complete symmetric function, mean performance measures, lower bound, throughput, upper bound, majorization, closed queueing networks, normalization constant
19Sascha Ott Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2. Search on Bibsonomy WG The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Superstrings, lower bounds, approximability, APX-hardness
19Jacobo Torán Lower Bounds for Space in Resolution. Search on Bibsonomy CSL The full citation details ... 1999 DBLP  DOI  BibTeX  RDF lower bounds, Resolution, space, complexity measures, pebbling game
19Dima Grigoriev Tseitin's Tautologies and Lower Bounds for Nullstellensatz Proofs. Search on Bibsonomy FOCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Nullstellensatz proofs, Tseitin's tautologies, lower bounds, expander
19Marc Fischlin Lower Bounds for the Signature Size of Incremental Schemes. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF incremental schemes, signature size, substitution attacks, single block replacement, lower bounds, security of data
19Andris Ambainis, Richard Desper, Martin Farach, Sampath Kannan Nearly Tight Bounds on the Learnability of Evolution. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF nearly tight bounds, evolution learnability, Cavender-Farris trees, edge weighted trees, Phylogeny Construction Problem, CF tree, computationally expensive, genetic algorithms, maximum likelihood estimator, stochastic process, DNA, convergence rate, random variable
19Valeriu Beiu Enhanced lower entropy bounds with application to constructive learning. Search on Bibsonomy EUROMICRO The full citation details ... 1997 DBLP  DOI  BibTeX  RDF enhanced lower entropy bounds, IR/sup n/, constructive learning algorithms, n dimensional ball, integer weights, maximum volume, n dimensional cones, neural networks, neural nets, upper bounding, polyhedron, logarithm, classification problems, quotient
19Antoni Ferré, Joan Figueras On estimating bounds of the quiescent current for IDDQ testin. Search on Bibsonomy VTS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF quiescent current bounds, sensing circuitry design, VLSI, logic testing, integrated circuit testing, ATPG, automatic testing, CMOS integrated circuits, leakage currents, I/sub DDQ/ testing, CMOS ICs, hierarchical approach
19Sing-Ban Tien, Cauligi S. Raghavendra Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF n-dimensional hypercube, parallel algorithms, computational complexity, complexity, fault tolerant computing, shortest paths, hypercube networks, diameter, bounds, faulty hypercubes
19Robert E. Felderman, Leonard Kleinrock Bounds and Approximations for Self-Initiating Distributed Simulation Without Lookahead. Search on Bibsonomy ACM Trans. Model. Comput. Simul. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF Global Virtual Time, optimal, performance analysis, parallel processing, distributed processing, discrete-event simulation, speedup, Time Warp, bounds, virtual time, optimistic simulation
19Neil C. Rowe Absolute Bounds on Set Intersection and Union Sizes from Distribution Information. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF union sizes, distribution information, closed-form bounds, rule-based system architecture, statistical analysis, statistical analysis, database theory, set theory, set theory, Boolean algebra, Boolean algebra, file organisation, file organisation, set intersection, database access
19Charles Allan Hall Error bounds for periodic quintic splines. Search on Bibsonomy Commun. ACM The full citation details ... 1969 DBLP  DOI  BibTeX  RDF interpolation, spline, error bounds
19Stéphane Boucheron, Aurélien Garivier, Elisabeth Gassiat Coding on Countably Infinite Alphabets. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
19Kenneth L. Clarkson, David P. Woodruff Numerical linear algebra in the streaming model. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF linear regression, low-rank approximation, matrix product
19N. Prasanth Anthapadmanabhan, Alexander Barg, Ilya Dumer On the Fingerprinting Capacity Under the Marking Assumption. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Bahman 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
19Daniele Micciancio, Scott Yilek The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization. Search on Bibsonomy TCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Xiaoming Sun 0001, David P. Woodruff The communication and streaming complexity of computing the longest common and increasing subsequences. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
19Alexander A. Sherstov Separating AC0 from depth-2 majority circuits. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF AC0, communication complexity, discrepancy, threshold circuits
19Igor Gashkov Constant Weight Codes with Package CodingTheory.m in Mathematica. Search on Bibsonomy International Conference on Computational Science The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
19Martin C. Rinard, Cristian Cadar, Daniel Dumitran, Daniel M. Roy 0001, Tudor Leu A Dynamic Technique for Eliminating Buffer Overflow Vulnerabilities (and Other Memory Errors). Search on Bibsonomy ACSAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
19Amir Shpilka Affine Projections of Symmetric Polynomials. Search on Bibsonomy CCC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
19Eunice E. Santos Optimal Parallel Algorithms for Solving Tridiagonal Linear Systems. Search on Bibsonomy Euro-Par The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
19Ching-Chih Han, Hung-Ying Tyan A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithm. Search on Bibsonomy RTSS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF polynomial-time schedulability test, real-time fixed-priority scheduling algorithms, closed-form utilization, polynomial-time schedulability, processor scheduling, schedulability condition
19Juraj Hromkovic A New Approach to Defining the Complexity for VLSI. Search on Bibsonomy MFCS The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
19Peter Damaschke, Phuong Hoai Ha, Philippas Tsigas Online Search with Time-Varying Price Bounds. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Game theory, Online algorithms, Competitive analysis, Search algorithms
19Toniann Pitassi, Nathan Segerlind Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
19David Niedzielski, Jeffery von Ronne, Andreas Gampe, Kleanthis Psarris A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination. Search on Bibsonomy SAS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
19Jesús Gómez-Vilardebó, Ana I. Pérez-Neira Bounds on Maximum Rate-Per-Energy for Orthogonal AWGN Multiple-Relay Channels. Search on Bibsonomy IEEE Trans. Wirel. Commun. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Cong Ling 0001, Kwok H. Li, Alex ChiChung Kot Performance of Space-Time Codes: Gallager Bounds and Weight Enumeration. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Cem Güneri, Ferruh Özbudak Weil-Serre Type Bounds for Cyclic Codes. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Immanuel M. Bomze, Marco Locatelli 0001, Fabio Tardella New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability. Search on Bibsonomy Math. Program. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 90C20, 90C26
19Roni Mittelman, Eric L. Miller 0001 Nonlinear Filtering Using a New Proposal Distribution and the Improved Fast Gauss Transform With Tighter Performance Bounds. Search on Bibsonomy IEEE Trans. Signal Process. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Yonina C. Eldar MSE Bounds With Affine Bias Dominating the CramÉr-Rao Bound. Search on Bibsonomy IEEE Trans. Signal Process. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Chintha Tellambura Bounds on the Distribution of a Sum of Correlated Lognormal Random Variables and Their Application. Search on Bibsonomy IEEE Trans. Commun. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Sumohana S. Channappayya, Alan C. Bovik, Robert W. Heath Jr. Rate Bounds on SSIM Index of Quantized Images. Search on Bibsonomy IEEE Trans. Image Process. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Andreas Frommer, Valeria Simoncini Error Bounds for Lanczos Approximations of Rational Functions of Matrices. Search on Bibsonomy Numerical Validation in Current Hardware Architectures The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Zoya Svitkina, Lisa Fleischer Submodular Approximation: Sampling-based Algorithms and Lower Bounds. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Jocelyn Aulin, Djordje Jeremic Performance Bounds for MLSD Reception of OFDM Signals in Fast Fading. Search on Bibsonomy ICC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Julia Kempe, Oded Regev 0001, Falk Unger, Ronald de Wolf Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. Search on Bibsonomy ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Sumohana S. Channappayya, Alan C. Bovik, Robert W. Heath Jr., Constantine Caramanis Rate Bounds on SSIM Index of Quantized Image DCT Coefficients. Search on Bibsonomy DCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF SSIM Index, Uniform quantization
19Dwight K. Hutchenson, Daniel L. Noneaker Improved Bounds on the Performance of Convolutional Codes over the Correlated Rayleigh-Fading Channel. Search on Bibsonomy WCNC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Vikraman Arvind, Partha Mukhopadhyay Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Hang Dinh, Alexander Russell Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Jochen Eisinger Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract). Search on Bibsonomy CSL The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Mark A. Iwen, Craig V. Spencer Improved bounds for a deterministic sublinear-time Sparse Fourier Algorithm. Search on Bibsonomy CISS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19San Ling, Ferruh Özbudak Constructions and bounds on linear error-block codes. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF 11T71, AMS Classifications 94B05
Displaying result #301 - #400 of 29763 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][>>]
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