Search results for "bounds"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
31	Aseem Agarwal, Vladimir Zolotov, David T. Blaauw	Statistical timing analysis using bounds and selective enumeration.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2003	DBLP DOI BibTeX RDF
31	Mohamed Afify, Olivier Siohan, Chin-Hui Lee	Upper and lower bounds on the mean of noisy speech: application to minimax classification.	IEEE Trans. Speech Audio Process.	2002	DBLP DOI BibTeX RDF
31	Aseem Agarwal, David T. Blaauw, Vladimir Zolotov, Sarma B. K. Vrudhula	Statistical timing analysis using bounds and selective enumeration.	Timing Issues in the Specification and Synthesis of Digital Systems	2002	DBLP DOI BibTeX RDF
30	Vitaly Maiorov, Ron Meir	On the near optimality of the stochastic approximation of smooth functions by neural networks.	Adv. Comput. Math.	2000	DBLP DOI BibTeX RDF	neural networks, lower bounds, upper bounds, stochastic approximation
30	Anurag Kumar 0001, Rajeev Shorey	Performance Analysis and Scheduling of Stochastic Fork-Join Jobs in a Multicomputer System.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	stochastic fork-join jobs, probabilistic allocation of tasks, associated random variables, diffusion limits, simulations, scheduling, scheduling, performance evaluation, performance analysis, parallel processing, lower bounds, delays, queueing theory, digital simulation, upper bounds, stochastic processes, multicomputer system, parallel processing system, queueing delays, exact analysis
30	Rahul Jain 0001, Hartmut Klauck, Ashwin Nayak 0001	Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract.	STOC	2008	DBLP DOI BibTeX RDF	rectangle bounds, subdistribution bounds, information theory, communication complexity, direct product
30	Oliver Kullmann	Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems.	Ann. Math. Artif. Intell.	2004	DBLP DOI BibTeX RDF	satisfiability problem (SAT), systems with partial instantiation, generalised resolution, lower bounds for resolution, upper bounds for SAT algorithms, automatisation of proof systems, generalised input resolution, generalised width restricted resolution, induced width of constraint satisfaction problems, constraint satisfaction problems, propositional logic, polynomial time hierarchies
30	George S. Avrunin, James C. Corbett, Laura K. Dillon, Jack C. Wileden	Automated Derivation of Time Bounds in Uniprocessor Concurrent Systems.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	time bound derivation, uniprocessor concurrent systems, concurrent software system, single processor, arbitrary scheduling, integer programming methods, constrained expression toolset, very large state spaces, scheduling, real-time systems, lower bounds, concurrency control, integer programming, systems analysis, upper bounds, timing analysis, concurrent systems, linear inequalities, timing properties, finite state systems, complex real-time systems
29	Pavel Hrubes, Avi Wigderson, Amir Yehudayoff	Non-commutative circuits and the sum-of-squares problem.	STOC	2010	DBLP DOI BibTeX RDF	lower bounds, algebraic complexity
29	Troy Lee, Adi Shraibman	Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model.	CCC	2008	DBLP DOI BibTeX RDF	multiparty communication complexity, disjointness, lower bounds
29	Christoph Lenzen 0001, Thomas Locher, Roger Wattenhofer	Tight bounds for clock synchronization.	PODC	2009	DBLP DOI BibTeX RDF	gradient property, optimal skew bounds, clock synchronization
29	Ran Raz	Elusive functions and lower bounds for arithmetic circuits.	STOC	2008	DBLP DOI BibTeX RDF	bounded depth circuits, lower bounds, arithmetic circuits, circuit complexity
29	Hind Castel, Lynda Mokdad, Nihal Pekergin	Stochastic Bounds Applied to the End to End QoS in Communication Systems.	MASCOTS	2007	DBLP DOI BibTeX RDF	Tandem queueing networks, performance measures bounds, Markov processes, Stochastic comparisons
29	José María López, José Luis Díaz, Daniel F. García	Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems.	Real Time Syst.	2004	DBLP DOI BibTeX RDF	multiprocessor utilization bounds, partitioning, multiprocessor scheduling, earliest deadline first scheduling, bin-packing problem
29	Eugene Shragowitz, Habib Youssef, Bing Lu	Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	duration of activities, scheduling, approximation algorithms, directed acyclic graphs, NP-complete problems, critical path, timing bounds, PERT, slack
29	Anna Gál, Adi Rosén	Lower bounds on the amount of randomness in private computation.	STOC	2003	DBLP DOI BibTeX RDF	lower bounds, randomness, private computation
29	Rosario Gennaro, Yael Gertner, Jonathan Katz	Lower bounds on the efficiency of encryption and digital signature schemes.	STOC	2003	DBLP DOI BibTeX RDF	lower bounds, digital signatures, encryption, black-box
29	Juan A. Carrasco	Computationally Efficient and Numerically Stable Reliability Bounds for Repairable Fault-Tolerant Systems.	IEEE Trans. Computers	2002	DBLP DOI BibTeX RDF	continuous time Markov models, reliability, randomization, bounds, fault-tolerant systems, repairable systems
29	Anna Gál	A characterization of span program size and improved lower bounds for monotone span programs.	Comput. Complex.	2001	DBLP DOI BibTeX RDF	Span programs, Boolean formula size, secret sharing..¶ Subject classification. 68Q15, lower bounds, 94C10
29	Laura Heinrich-Litan, Paul Molitor	Least Upper Bounds for the Size of OBDDs Using Symmetry Properties.	IEEE Trans. Computers	2000	DBLP DOI BibTeX RDF	upper worst case bounds, partial symmetric Boolean functions, Binary decision diagrams, variable ordering
29	Christer Berg, Staffan Ulfberg	Symmetric Approximation Arguments for Monotone Lower Bounds Without Sunflowers.	Comput. Complex.	1999	DBLP DOI BibTeX RDF	lower bounds, Circuit complexity, monotone circuits
29	Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick	Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings.	J. ACM	1994	DBLP DOI BibTeX RDF	Solitude Verification, anonymous ring, asynchronous unidirectional ring, bit complexity, lower bounds, nondeterminism, Leader Election
29	Rakesh M. Verma, I. V. Ramakrishnan	Optimal Time Bounds for Parallel Term Matching.	CADE	1988	DBLP DOI BibTeX RDF	optimal bounds, parallel term matching, complexity
28	Pooi Yuen Kam, Rong Li	Computing and bounding the first-order Marcum Q-function: a geometric approach.	IEEE Trans. Commun.	2008	DBLP DOI BibTeX RDF
28	Sunil Arya, Theocharis Malamatos, David M. Mount	On the importance of idempotence.	STOC	2006	DBLP DOI BibTeX RDF	approximation algorithms, range searching, idempotence
28	Marta Jiménez, José M. Llabería, Agustín Fernández	A Cost-Effective Implementation of Multilevel Tiling.	IEEE Trans. Parallel Distributed Syst.	2003	DBLP DOI BibTeX RDF	multilevel tiling, Compilers, memory hierarchy, loop transformations
28	Sudipto Guha, Andrew McGregor 0001	Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination.	ICALP (1)	2008	DBLP DOI BibTeX RDF
28	Leigh E. Hodge, Sasthi C. Ghosh 0001, Steve Hurley, Roger M. Whitaker, Stuart M. Allen	Coverage and service bounds for UMTS.	Mobility Conference	2008	DBLP DOI BibTeX RDF	optimization, tabu search, integer linear programming
28	Tzi-cker Chiueh	Fast Bounds Checking Using Debug Register.	HiPEAC	2008	DBLP DOI BibTeX RDF
28	Pulkit Grover, Ajit Kumar Chaturvedi	Upper Bounds on the Rate of LDPC Codes for a Class of Finite-State Markov Channels.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
28	Rastislav Bodík, Rajiv Gupta 0001, Vivek Sarkar	ABCD: eliminating array bounds checks on demand.	PLDI	2000	DBLP DOI BibTeX RDF
28	Stephen Cameron, Chee-Keng Yap	Refinement Methods for Geometric Bounds in Constructive Solid Geometry.	ACM Trans. Graph.	1992	DBLP DOI BibTeX RDF	representation simplification, robotics, collision detection, solid modeling, Boolean algebra, constructive solid geometry, interference detection
26	Luigi Alcuri, Giuseppe Barbera, Giuseppe D'Acquisto	Service Curve Estimation by Measurement: An Input Output Analysis of a Softswitch Model.	QoS-IP	2005	DBLP DOI BibTeX RDF	softswitch model, Network calculus, delay bounds, performance bounds, service curve
26	Zhanping Chen, Kaushik Roy 0001, Tan-Li Chou	Power sensitivity - a new method to estimate power dissipation considering uncertain specifications of primary inputs.	ICCAD	1997	DBLP DOI BibTeX RDF	Monte Carlo based approach, maximum bounds, minimum bounds, power dissipation estimation, power sensitivity, primary inputs, signal properties, signal switching, uncertain specifications, logic CAD, CMOS logic circuits, power estimation, CMOS circuits, signal probability, statistical technique
26	Sridhar Madala, James B. Sinclair	Performance of Synchronous Parallel Algorithms with Regular Structures.	IEEE Trans. Parallel Distributed Syst.	1991	DBLP DOI BibTeX RDF	distribution driven simulations, synchronous parallelalgorithms, mean execution time, program-driven simulations, average execution time, multiphasealgorithms, execution time bounds, scheduling, performance evaluation, parallel algorithms, parallel programming, upper bounds, bounding, scheduling policies, partitioning algorithm, parallel tasks, asymptotic approximations, regular structures
26	Rahul Santhanam	Circuit lower bounds for Merlin-Arthur classes.	STOC	2007	DBLP DOI BibTeX RDF	Merlin-Arthur games, average-case lower bounds, circuit lower bounds, advice, pseudo-random generators
26	Roberto Montemanni	Upper and lower bounds for the fixed spectrum frequency assignment problem.	4OR	2003	DBLP DOI BibTeX RDF	Radio frequency assignment, fixed spectrum, lower bounds, upper bounds
26	Paul Beame, Toniann Pitassi	Simplified and Improved Resolution Lower Bounds.	FOCS	1996	DBLP DOI BibTeX RDF	resolution lower bounds, randomly generated formulas, random formulas, randomly chosen 3-CNF formula, lower bounds, computability, pigeonhole principle
26	Philip J. Bernhard	Bounds on the Performance of Message Routing Heuristics.	IEEE Trans. Computers	1993	DBLP DOI BibTeX RDF	message routing heuristics, communication conflicts, minimum round partitioning problem, performance evaluation, performance, computational complexity, heuristics, lower bounds, message passing, multiprocessor interconnection networks, upper bounds, network routing, omega network, message patterns, conflict-free
26	Jeff Erickson 0001, Raimund Seidel	Better Lower Bounds on Detecting Affine and Spherical Degeneracies	FOCS	1993	DBLP DOI BibTeX RDF	affine detection, spherical degeneracies, sidedness queries, common hyperplane, computational geometry, lower bounds, lower bound, upper bounds, point set
26	Jaikumar Radhakrishnan	Better Bounds for Threshold Formulas	FOCS	1991	DBLP DOI BibTeX RDF	stronger monotone contact networks model, better bounds, nearly optimal bounds, threshold formulas, monotone formula, computation, threshold functions
26	Andrew Chi-Chih Yao	Lower Bounds for Algebraic Computation Trees with Integer Inputs	FOCS	1989	DBLP DOI BibTeX RDF	integer inputs, topological lower bound, algebraic computation tree model, integral-constrained form, element distinctness, set disjointness, integer max gap, Milnor-Thom techniques, lower bounds, upper bounds, convex hull, Betti numbers, algebraic varieties, algebraic computation trees
26	Andrei Z. Broder, Anna R. Karlin	Bounds on the Cover Time (Preliminary Version)	FOCS	1988	DBLP DOI BibTeX RDF	regular expander graphs, connected unidirected graph, lower bounds, Markov chain, random walk, upper bounds, eigenvalues, vertices, particle, cover time, neighbors
26	Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan	Dynamic Perfect Hashing: Upper and Lower Bounds	FOCS	1988	DBLP DOI BibTeX RDF	dynamic perfect hashing, amortized expected time, amortized worst-case time complexity, lower bounds, randomized algorithm, upper bounds, deterministic algorithm, insertion, deletion, lookup, worst-case time, dictionary problem
26	Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl	Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces	FOCS	1988	DBLP DOI BibTeX RDF	combinatorial complexity bounds, incidence counting, many-faces problem, pseudolines, unit circles, general circles, pseudocircles, three-dimensional unit-distance problem, upper bounds, surfaces, curves, lines, three dimensions, spheres
26	Prithviraj Banerjee, Jacob A. Abraham	Bounds on Algorithm-Based Fault Tolerance in Multiple Processor Systems.	IEEE Trans. Computers	1986	DBLP DOI BibTeX RDF	system-level faults, lower bounds, linear programming, fault detection, upper bounds, errors, fault location, graph model, Checks
26	Utpal Banerjee, Shyh-Ching Chen, David J. Kuck, Ross A. Towle	Time and Parallel Processor Bounds for Fortran-Like Loops.	IEEE Trans. Computers	1979	DBLP DOI BibTeX RDF	Analysis of programs, Fortran-like loops, processor bounds, program speedup, parallel computation, data dependence, time bounds, recurrence relations
26	Shyh-Ching Chen, David J. Kuck	Combinational Circuit Synthesis with Time and Component Bounds.	IEEE Trans. Computers	1977	DBLP DOI BibTeX RDF	component bounds, sequential circuits, combinational circuits, time bounds, circuit synthesis, Binary addition, binary multiplication
26	Yves Younan, Pieter Philippaerts, Lorenzo Cavallaro, R. Sekar 0001, Frank Piessens, Wouter Joosen	PAriCheck: an efficient pointer arithmetic checker for C programs.	AsiaCCS	2010	DBLP DOI BibTeX RDF	bounds checking, buffer overflows
26	Takayuki Osogami, Rudy Raymond	Semidefinite optimization for transient analysis of queues.	SIGMETRICS	2010	DBLP DOI BibTeX RDF	occupation measure, semidefinite programming, duality, bounds, moments, transient, g/g/1 queue
26	Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman	The complexity of synchronous iterative Do-All with crashes.	Distributed Comput.	2004	DBLP DOI BibTeX RDF	Fault-tolerance, Distributed algorithms, Lower bounds, Work complexity
26	Brian King	Requirements for Group Independent Linear Threshold Secret Sharing Schemes.	ACISP	2002	DBLP DOI BibTeX RDF	linear secret sharing, group independent linear threshold schemes, monotone span programs and bounds on share size, secret sharing, threshold cryptography
26	Yves Dallery, Rajan Suri	Approximate Disaggregation and Performance Bound for Queueing Networks with Multiple-Server Stations.	SIGMETRICS	1986	DBLP DOI BibTeX RDF	approximate disaggregation, performance bounds, closed queueing networks, product form networks
26	Sunil Arya, David M. Mount, Jian Xia	Tight lower bounds for halfspace range searching.	SCG	2010	DBLP DOI BibTeX RDF	lower bounds, range searching, idempotence
26	Laura Grigori, Pierre-Yves David, James Demmel, Sylvain Peyronnet	Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problem.	SPAA	2010	DBLP DOI BibTeX RDF	communication bounds, sparse Cholesky
26	Alexander A. Sherstov	The pattern matrix method for lower bounds on quantum communication.	STOC	2008	DBLP DOI BibTeX RDF	approximate degree of boolean functions, bounded-error communication, quantum communication complexity, lower bounds
26	Gopal Pandurangan, Eli Upfal	Entropy-based bounds for online algorithms.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	list accessing, caching, entropy, prefetching, Online algorithms, stochastic process, performance bounds
26	Maurice J. Jansen, Kenneth W. Regan	"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas.	COCOON	2007	DBLP DOI BibTeX RDF	constant depth formulas, Computational complexity, lower bounds, arithmetical circuits, partial derivatives
26	Sing-Kong Cheung, Hans van den Berg, Richard J. Boucherie	Insensitive bounds for the moments of the sojourn time distribution in the M/G/1 processor-sharing queue.	Queueing Syst. Theory Appl.	2006	DBLP DOI BibTeX RDF	M/G/1 PS, Conditional sojourn time, Insensitive bounds, Instantaneous sojourn time, Euler's number triangle, Moment ordering, Permanent customers, Moments
26	Lance Fortnow, Richard J. Lipton, Dieter van Melkebeek, Anastasios Viglas	Time-space lower bounds for satisfiability.	J. ACM	2005	DBLP DOI BibTeX RDF	Complexity of satisfiability, time-space lower bounds
26	Liana Stanescu, Dumitru Dan Burdescu, Cosmin Stoica Spahiu	Using R-Trees in Content-Based Region Query with Spatial Bounds.	SYNASC	2005	DBLP DOI BibTeX RDF	content-based region query, spatial bounds, absolute localization, minimal bounding rectangle, R trees, spatial indexing
26	Vineet Bafna, Vikas Bansal 0001	The Number of Recombination Events in a Sample History: Conflict Graph and Lower Bounds.	IEEE ACM Trans. Comput. Biol. Bioinform.	2004	DBLP DOI BibTeX RDF	ancestral recombination graph, lower bounds, NP-completeness, Recombination, haplotypes, conflict graph, phylogenetic networks
26	Thomas Bonald, Alexandre Proutière	On Stochastic Bounds for Monotonic Processor Sharing Networks.	Queueing Syst. Theory Appl.	2004	DBLP DOI BibTeX RDF	processor sharing networks, stochastic bounds, monotonicity, balance, insensitivity
26	Thierry Benoist, Benoît Rottembourg	Upper bounds for revenue maximization in a satellite scheduling problem.	4OR	2004	DBLP DOI BibTeX RDF	concave costs, Russian Dolls, Upper bounds, valid inequalities
26	Peter Bürgisser, Martin Lotz	Lower bounds on the bounded coefficient complexity of bilinear maps.	J. ACM	2004	DBLP DOI BibTeX RDF	bilinear circuits, lower bounds, Algebraic complexity, singular values
26	Michel Vasquez, Jin-Kao Hao	Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	partition, tabu search, bounds, constraint relaxation, branch & bound
26	Valentine Kabanets, Russell Impagliazzo	Derandomizing polynomial identity tests means proving circuit lower bounds.	STOC	2003	DBLP DOI BibTeX RDF	BPP, NEXP, circuit lower bounds, derandomization, polynomial identity testing
26	Brian M. Sadler, Richard J. Kozick, Terrence J. Moore, Ananthram Swami	Bounds on SIMO and MIMO Channel Estimation and Equalization with Side Information.	J. VLSI Signal Process.	2002	DBLP DOI BibTeX RDF	Cramér-Rao bounds, semi-blind, constant modulus, blind estimation, communications, equalization, channel estimation, source separation
26	Ricard Gavaldà, Osamu Watanabe 0001	Sequential Sampling Algorithms: Unified Analysis and Lower Bounds.	SAGA	2001	DBLP DOI BibTeX RDF	Data mining, Random sampling, adaptive sampling, sequential sampling, Chernoff bounds
26	Tamás Szántai	Improved Bounds and Simulation Procedures on the Value of the Multivariate Normal Probability Distribution Function.	Ann. Oper. Res.	2000	DBLP DOI BibTeX RDF	probability bounds, Monte Carlo simulation, variance
26	Víctor Suñé, Juan A. Carrasco	Failure Distance Based Bounds for Steady-State Availability without the Knowledge of Minimal Cuts.	MASCOTS	1999	DBLP DOI BibTeX RDF	steady-state availability, failure distance, bounds, Fault-tolerant systems, continuous-time Markov chains
26	Stasys Jukna	Finite Limits and Monotone Computations: The Lower Bounds Criterion.	CCC	1997	DBLP DOI BibTeX RDF	real gates, lower bounds, threshold gates, monotone circuits
26	Javier Campos, Giovanni Chiola, Manuel Silva Suárez	Ergodicity and Throughput Bounds of Petri Nets with Unique Consistent Firing Count Vector.	IEEE Trans. Software Eng.	1991	DBLP DOI BibTeX RDF	persistent nets, throughput bounds, unique consistent firing count vector, mono-T-semiflow net subclasses, incidence matrix, synchronized queuing networks, Petri nets, Petri nets, linear programming, linear programming, ergodicity, marked graphs
25	Ilias Diakonikolas, Prahladh Harsha, Adam R. Klivans, Raghu Meka, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan	Bounding the average sensitivity and noise sensitivity of polynomial threshold functions.	STOC	2010	DBLP DOI BibTeX RDF	average sensitivity, boolean function, fourier analysis, noise sensitivity, polynomial threshold function
25	Eran Hof, Igal Sason, Shlomo Shamai	Performance Bounds for Nonbinary Linear Block Codes Over Memoryless Symmetric Channels.	IEEE Trans. Inf. Theory	2009	DBLP DOI BibTeX RDF
25	Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams	Optimization of Information Rate Upper and Lower Bounds for Channels With Memory.	IEEE Trans. Inf. Theory	2009	DBLP DOI BibTeX RDF
25	Alexandre Renaux, Philippe Forster, Pascal Larzabal, Christ D. Richmond, Arye Nehorai	A Fresh Look at the Bayesian Bounds of the Weiss-Weinstein Family.	IEEE Trans. Signal Process.	2008	DBLP DOI BibTeX RDF
25	Behzad Sharif, Yoram Bresler	Upper bounds on aliasing error energy for multidimensional sampling of nonbandlimited signals.	ICASSP	2008	DBLP DOI BibTeX RDF
25	Sang Joon Kim, Patrick Mitran, Vahid Tarokh	Performance Bounds for Bi-Directional Coded Cooperation Protocols.	ICDCS Workshops	2007	DBLP DOI BibTeX RDF
25	Paul Beame, T. S. Jayram, Atri Rudra	Lower bounds for randomized read/write stream algorithms.	STOC	2007	DBLP DOI BibTeX RDF	communication complexity, data stream algorithms
25	Ehab S. Elmallah, Hosam M. F. AboElFotoh	Circular Layout Cutsets: An Approach for Improving Consecutive Cutset Bounds for Network Reliability.	IEEE Trans. Reliab.	2006	DBLP DOI BibTeX RDF
25	Jan Gustafsson, Andreas Ermedahl, Christer Sandberg, Björn Lisper	Automatic Derivation of Loop Bounds and Infeasible Paths for WCET Analysis Using Abstract Execution.	RTSS	2006	DBLP DOI BibTeX RDF
25	Chiu Wo Choi, Warwick Harvey, J. H. M. Lee, Peter J. Stuckey	Finite Domain Bounds Consistency Revisited.	Australian Conference on Artificial Intelligence	2006	DBLP DOI BibTeX RDF
25	Vineet Bafna, Vikas Bansal 0001	Improved Recombination Lower Bounds for Haplotype Data.	RECOMB	2005	DBLP DOI BibTeX RDF
25	Elizaveta A. Okol'nishnikova	On Some Bounds on the Size of Branching Programs (A Survey).	SAGA	2005	DBLP DOI BibTeX RDF
25	Liam Keliher	Refined Analysis of Bounds Related to Linear and Differential Cryptanalysis for the AES.	AES Conference	2004	DBLP DOI BibTeX RDF	SPN, MELP, MEDP, KMT2, KMT2-DC, AES, provable security, differential cryptanalysis, Rijndael, linear cryptanalysis
25	Peter Hawkins, Vitaly Lagoon, Peter J. Stuckey	Set Bounds and (Split) Set Domain Propagation Using ROBDDs.	Australian Conference on Artificial Intelligence	2004	DBLP DOI BibTeX RDF
25	Lei Wang 0003, Naresh R. Shanbhag	Energy-efficiency bounds for deep submicron VLSI systems in the presence of noise.	IEEE Trans. Very Large Scale Integr. Syst.	2003	DBLP DOI BibTeX RDF
25	Mohammed A. Hasan	Sharper bounds for the zeros of polynomials.	ISCAS (3)	2003	DBLP DOI BibTeX RDF
25	Aseem Agarwal, David T. Blaauw, Vladimir Zolotov, Sarma B. K. Vrudhula	Computation and Refinement of Statistical Bounds on Circuit Delay.	DAC	2003	DBLP DOI BibTeX RDF
25	Norbert Sensen	Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows.	ESA	2001	DBLP DOI BibTeX RDF
25	Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen	Lower Bounds for Dynamic Algebraic Problems.	STACS	1999	DBLP DOI BibTeX RDF
25	Jürg Nievergelt, C. K. Wong	Upper Bounds for the Total Path Length of Binary Trees.	J. ACM	1973	DBLP DOI BibTeX RDF
25	John W. Carr III	Error Bounds for the Runge-Kutta Single-Step Integration Process.	J. ACM	1958	DBLP DOI BibTeX RDF
23	Tamás Szántai	Approximation of Multivariate Probability Integrals.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Boole-Bonferroni bounds, Hunter-Worsley bounds, Probability integrals, Probabilistic constrained stochastic programming, Approximation, Variance reduction
23	Shai Shalev-Shwartz, Yoram Singer	A primal-dual perspective of online learning algorithms.	Mach. Learn.	2007	DBLP DOI BibTeX RDF	Mistake bounds, Regret bounds, Online learning, Duality
23	Eric C. R. Hehner	Formalization of Time and Space.	Formal Aspects Comput.	1998	DBLP DOI BibTeX RDF	Average space, Formal methods, Time bounds, Real-time programming, Space bounds
23	Riccardo Gusella, Stefano Zatti	The Accuracy of the Clock Synchronization Achieved by TEMPO in Berkeley UNIX 4.3BSD.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	TEMPO, Berkeley UNIX 4.3BSD, network transmission latency, VAX computers, lower bounds, fault tolerant computing, Unix, local area network, local area networks, synchronisation, upper bounds, clock synchronization, distributed service
23	Sverrir Olafsson, Yaser S. Abu-Mostafa	The Capacity of Multilevel Threshold Functions.	IEEE Trans. Pattern Anal. Mach. Intell.	1988	DBLP DOI BibTeX RDF	information capacity, multilevel threshold functions, input set, lower bounds, topology, topology, information theory, information theory, upper bounds
23	Hind Castel-Taleb, Lynda Mokdad, Nihal Pekergin	Aggregated bounding Markov processes applied to the analysis of tandem queues.	VALUETOOLS	2007	DBLP DOI BibTeX RDF	loss probability bounds, tandem queueing networks, Markov processes, stochastic comparisons