Search results for "bounds"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
23	Peter Buchholz 0001	Bounding stationary results of Tandem networks with MAP input and PH service time distributions.	SIGMETRICS/Performance	2006	DBLP DOI BibTeX RDF	stationary analysis, Markov chains, bounds, Tandem queues
23	Mihai Patrascu, Mikkel Thorup	Time-space trade-offs for predecessor search.	STOC	2006	DBLP DOI BibTeX RDF	cell-probe complexity, predecessor search, lower bounds
23	Claudio Gentile	The Robustness of the p-Norm Algorithms.	Mach. Learn.	2003	DBLP DOI BibTeX RDF	loss bounds, learning rate, dual norms, on-line model selection, on-line learning
23	Tarek F. Abdelzaher, Vivek Sharma 0004	A Synthetic Utilization Bound for Aperiodic Tasks with Resource Requirements.	ECRTS	2003	DBLP DOI BibTeX RDF	Real-time scheduling, schedulability analysis, utilization bounds, aperiodic tasks
23	Mihai Patrascu	Towards polynomial lower bounds for dynamic problems.	STOC	2010	DBLP DOI BibTeX RDF	3SUM, lower bounds, dynamic data structures
23	Natasa Jovanovic, Jan H. M. Korst, Ramon Clout, Verus Pronk, Ludo Tolhuizen	Candle in the woods: asymptotic bounds on minimum blocking sets.	SCG	2009	DBLP DOI BibTeX RDF	asymptotic bounds, blocking set, farey sequences
23	Mourad Ahmane, Laurent Truffet	Numerical Method for Bounds Computations of Discrete-Time Markov Chains with Different State Spaces.	ASMTA	2009	DBLP DOI BibTeX RDF	Gamma-algorithm, comparison, bounds, Discrete-time Markov chains
23	Clémence Magnien, Matthieu Latapy, Michel Habib	Fast computation of empirically tight bounds for the diameter of massive graphs.	ACM J. Exp. Algorithmics	2008	DBLP DOI BibTeX RDF	Diameter bounds, graph diameter
23	Per Austrin, Gunnar Kreitz	Lower Bounds for Subset Cover Based Broadcast Encryption.	AFRICACRYPT	2008	DBLP DOI BibTeX RDF	Subset Cover, lower bounds, Broadcast Encryption, key revocation
23	Eric Allender, Michal Koucký 0001	Amplifying Lower Bounds by Means of Self-Reducibility.	CCC	2008	DBLP DOI BibTeX RDF	self-reducibility, lower bounds, circuit complexity
23	Jean-Michel Fourneau, Imène Kadi, Nihal Pekergin, Jérôme Vienne, Jean-Marc Vincent	Perfect simulation and monotone stochastic bounds.	VALUETOOLS	2007	DBLP DOI BibTeX RDF	coupling from the past, monotone Markov chains, stochastic bounds, perfect simulation
23	Jean-Michel Fourneau	Discrete time stochastic automata networks: using structural properties and stochastic bounds to simplify the SAN.	VALUETOOLS	2007	DBLP DOI BibTeX RDF	stochastic bounds, aggregation, discrete time Markov chain, stochastic automata networks
23	Mila Nikolova	Bounds on the Minimizers of (nonconvex) Regularized Least-Squares.	SSVM	2007	DBLP DOI BibTeX RDF	???? norm, non-convex analysis, non-smooth analysis, regularization, inverse problems, restoration, variational methods, bounds, edge preservation
23	Minghu Ha 0001, Yan Li 0003, Jia Li, Da-Zeng Tian	The key theorem and the bounds on the rate of uniform convergence of learning theory on Sugeno measure space.	Sci. China Ser. F Inf. Sci.	2006	DBLP DOI BibTeX RDF	Sugeno measure, the empirical risk minimization principle, the key theorem, the bounds on the rate of uniform convergence
23	Sahand Haji Ali Ahmad, Aleksandar Jovicic, Pramod Viswanath	On outer bounds to the capacity region of wireless networks.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF	cut-set bounds, isometric embedding, ad hoc wireless networks, multihop, transport capacity, capacity region
23	Claude-Guy Quimper, Alexander Golynski, Alejandro López-Ortiz, Peter van Beek	An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint.	Constraints An Int. J.	2005	DBLP DOI BibTeX RDF	domain consistency, global constraints, bounds consistency
23	Christian Schulte 0001, Peter J. Stuckey	When do bounds and domain propagation lead to the same search space?	ACM Trans. Program. Lang. Syst.	2005	DBLP DOI BibTeX RDF	Constraint (logic) programming, bounds propagation, domain propagation, program analysis, abstract interpretation, finite domain constraints
23	Raphael Chung-Wei Phan, Bok-Min Goi	On the Security Bounds of CMC, EME, EME+ and EME* Modes of Operation.	ICICS	2005	DBLP DOI BibTeX RDF	tweakable schemes, disk encryption, security bounds, Block cipher, modes of operation, distinguisher
23	Thomas Bonald, Alexandre Proutière	On performance bounds for the integration of elastic and adaptive streaming flows.	SIGMETRICS	2004	DBLP DOI BibTeX RDF	adaptive streaming traffic, flow-level analysis, insensitive bounds, multi-service network, elastic traffic
23	Mihai Patrascu, Erik D. Demaine	Lower bounds for dynamic connectivity.	STOC	2004	DBLP DOI BibTeX RDF	cell-probe complexity, dynamic connectivity, dynamic graph problems, lower bounds for data structures, partial sums problem
23	Ingo Eble, Markus Neher 0001	ACETAF: A software package for computing validated bounds for Taylor coefficients of analytic functions.	ACM Trans. Math. Softw.	2003	DBLP DOI BibTeX RDF	bounds for Taylor coefficients, Analytic functions
23	Marco A. Boschetti, Aristide Mingozzi	The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds.	4OR	2003	DBLP DOI BibTeX RDF	Lower Bounds, Heuristic Algorithms, Cutting and Packing
23	Emilio Leonardi, Marco Mellia, Fabio Neri, Marco Ajmone Marsan	Bounds on delays and queue lengths in input-queued cell switches.	J. ACM	2003	DBLP DOI BibTeX RDF	scheduling, Performance evaluation, delay bounds, input queued switches
23	Angelo Gilio, Veronica Biazzo, Giuseppe Sanfilippo	Coherence checking and propagation of lower probability bounds.	Soft Comput.	2003	DBLP DOI BibTeX RDF	g-coherence checking, Lower conditional probability bounds, Non relevant gains, Basic sets, Propagation
23	Dino Ahr, Gerhard Reinelt	New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem.	ESA	2002	DBLP DOI BibTeX RDF	Min-Max Optimization, Heuristics, Lower Bounds, Chinese Postman Problem, Arc Routing
23	Roberto Montemanni, D. H. Smith, Stuart M. Allen	Lower Bounds for Fixed Spectrum Frequency Assignment.	Ann. Oper. Res.	2001	DBLP DOI BibTeX RDF	radio frequency assignment, fixed spectrum problems, lower bounds
23	Aloysius K. Mok, Alex Xiang Feng	Towards Compositionality in Real-Time Resource Partitioning Based on Regularity Bounds.	RTSS	2001	DBLP DOI BibTeX RDF	Utiliza-tion bounds, Open System, Real-Time Task Scheduling, Resource Partition
23	Manfred Göbel	Rewriting Techniques and Degree Bounds for Higher Order Symmetric Polynomials.	Appl. Algebra Eng. Commun. Comput.	1999	DBLP DOI BibTeX RDF	Higher order symmetry, Degree bounds, Rewriting techniques, Generators, Symmetric polynomials
23	Ueli M. Maurer, Stefan Wolf 0001	Lower Bounds on Generic Algorithms in Groups.	EUROCRYPT	1998	DBLP DOI BibTeX RDF	Diffie-Hellman protocol, roots in finite groups, complexity, lower bounds, discrete logarithms, generic algorithms
23	Walter Krämer	A Priori Worst-Case Error Bounds for Floating-Point Computations.	IEEE Symposium on Computer Arithmetic	1997	DBLP DOI BibTeX RDF	Reliable Error Estimates, Table-lookup Algorithm, Error Bounds, Floating-Point Computations
23	Sumant Ramprasad, Naresh R. Shanbhag, Ibrahim N. Hajj	Achievable bounds on signal transition activity.	ICCAD	1997	DBLP DOI BibTeX RDF	achievable bounds, busses, Low power, information theory, power estimation, CMOS circuits, switching activity
23	Dimitris Bertsimas	The achievable region method in the optimal control of queueing systems; formulations, bounds and policies.	Queueing Syst. Theory Appl.	1995	DBLP DOI BibTeX RDF	multiarmed bandits, optimization, policies, Queueing networks, bounds, loss networks
23	Hualou Liang, Guiliang Dai	Error Estimation and Error Bounds for Neural Network.	ANNES	1995	DBLP DOI BibTeX RDF	Neural network, Error estimation, Error bounds
23	Christine Rüb	Lower Bounds for Merging on the Hypercube.	CIAC	1994	DBLP DOI BibTeX RDF	Lower bounds, Hypercube, Sorting, Merging
22	Haibing Lu, Yingjiu Li	Practical Inference Control for Data Cubes.	IEEE Trans. Dependable Secur. Comput.	2008	DBLP DOI BibTeX RDF	Data dependencies, Inference engines
22	Zouheir Rezki, David Haccoun, François Gagnon, Wessam Ajib	A Tight Lower Bound on the Outage Probability of Spatially Correlated MIMO Channels.	VTC Spring	2007	DBLP DOI BibTeX RDF
22	Xiang-Yang Li 0001, Shaojie Tang 0001, Ophir Frieder	Multicast capacity for large scale wireless ad hoc networks.	MobiCom	2007	DBLP DOI BibTeX RDF	multicast, wireless ad hoc networks, capacity
22	Yingjiu Li, Haibing Lu, Robert H. Deng	Practical Inference Control for Data Cubes (Extended Abstract).	S&P	2006	DBLP DOI BibTeX RDF
22	Eyal Gordon, Adi Rosén	Competitive weighted throughput analysis of greedy protocols on DAGs.	PODC	2005	DBLP DOI BibTeX RDF
22	Pramod Ramarao, Akhilesh Tyagi, Gyungho Lee	Run-Time Support for Detection of Memory Access Violations to Prevent Buffer Overflow Exploits.	ISC	2003	DBLP DOI BibTeX RDF
22	Eunice E. Santos	Optimal Tridiagonal Solvers on Mesh Interconnection Networks.	ACPC	1999	DBLP DOI BibTeX RDF
22	R. N. Uma, Joel Wein	On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems.	IPCO	1998	DBLP DOI BibTeX RDF
22	Jingsen Chen	Average Cost to Produce Partial Orders.	ISAAC	1994	DBLP DOI BibTeX RDF
22	Sanjeev Rao Maddila, Dian Zhou	Routing in general junctions.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1989	DBLP DOI BibTeX RDF
22	George S. Lueker	Improved bounds on the average length of longest common subsequences.	J. ACM	2009	DBLP DOI BibTeX RDF	Arratia-Steele conjecture, dynamic programming, average-case analysis, Longest common subsequences
22	Giuliano Casale, Richard R. Muntz, Giuseppe Serazzi	Geometric Bounds: A Noniterative Analysis Technique for Closed Queueing Networks.	IEEE Trans. Computers	2008	DBLP DOI BibTeX RDF	Performance, Operating Systems, Queuing theory, Modeling techniques, Computer Systems Organization, Performance of Systems, Performance of Systems, Software/Software Engineering
22	Sang Joon Kim, Patrick Mitran, Vahid Tarokh	Performance Bounds for Bidirectional Coded Cooperation Protocols.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
22	Eleftheria Athanasopoulou, Christoforos N. Hadjicostis	Bounds on FSM Switching Activity.	J. Signal Process. Syst.	2008	DBLP DOI BibTeX RDF	Low power design, Markov models, Hamming distance, State assignment, Switching activity
22	Ittai Abraham, Danny Dolev, Joseph Y. Halpern	Lower Bounds on Implementing Robust and Resilient Mediators.	TCC	2008	DBLP DOI BibTeX RDF
22	Huizhen Yu, Dimitri P. Bertsekas	New Error Bounds for Approximations from Projected Linear Equations.	EWRL	2008	DBLP DOI BibTeX RDF
22	Byran J. Smucker, Aleksandra B. Slavkovic	Cell Bounds in Two-Way Contingency Tables Based on Conditional Frequencies.	Privacy in Statistical Databases	2008	DBLP DOI BibTeX RDF	Linear programming, Integer programming, Confidentiality, Statistical disclosure control, Contingency tables, Tabular data
22	Ron M. Roth, Gadiel Seroussi	Bounds for Binary Codes With Narrow Distance Distributions.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
22	Gil Wiechman, Igal Sason	Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
22	Cong Ling 0001, Xiaofu Wu, Kwok H. Li, Alex ChiChung Kot	Gallager Bounds for Noncoherent Decoders in Fading Channels.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
22	Florin Ciucu	Network Calculus Delay Bounds in Queueing Networks with Exact Solutions.	ITC	2007	DBLP DOI BibTeX RDF
22	Jinoo Joung, Jongtae Song, Soon Seok Lee	Delay Bounds in Tree Networks with DiffServ Architecture.	ITC	2007	DBLP DOI BibTeX RDF
22	Weihaw Chuang, Satish Narayanasamy, Brad Calder, Ranjit Jhala	Bounds Checking with Taint-Based Analysis.	HiPEAC	2007	DBLP DOI BibTeX RDF
22	Mohak Shah	Sample compression bounds for decision trees.	ICML	2007	DBLP DOI BibTeX RDF
22	Abbas El Gamal, Mehdi Mohseni, Sina Zahedi	Bounds on capacity and minimum energy-per-bit for AWGN relay channels.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
22	Imam Samil Yetik, Arye Nehorai	Performance bounds on image registration.	IEEE Trans. Signal Process.	2006	DBLP DOI BibTeX RDF
22	Firouz Behnamfar, Fady Alajaji, Tamás Linder	Tight error bounds for space-time orthogonal block codes under slow Rayleigh flat fading.	IEEE Trans. Commun.	2005	DBLP DOI BibTeX RDF
22	Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson	Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	DPLL algorithms, satisfiability
22	Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender	Degree-Based Treewidth Lower Bounds.	WEA	2005	DBLP DOI BibTeX RDF
22	Jianjiang Lu, Baowen Xu, Dazhou Kang, Yanhui Li, Peng Wang 0004	Approximations of Concept Based on Multielement Bounds.	DEXA	2005	DBLP DOI BibTeX RDF
22	Stefania Verachi, Steven D. Prestwich	Bounds-Consistent Local Search.	CP	2005	DBLP DOI BibTeX RDF
22	Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson	Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas.	ICALP	2004	DBLP DOI BibTeX RDF
22	Geunhyung Kim, Cheeha Kim	Deterministic Edge-to-Edge Delay Bounds for a Flow in a DiffServ Network Domain.	ICOIN	2004	DBLP DOI BibTeX RDF
22	Jong Chul Ye, Yoram Bresler, Pierre Moulin	Cramer-Rao bounds for parametric shape estimation in inverse problems.	IEEE Trans. Image Process.	2003	DBLP DOI BibTeX RDF
22	Mohammad Ali Khojastepour, Ashutosh Sabharwal, Behnaam Aazhang	Bounds on Achievable Rates for General Multi-terminal Networks with Practical Constraints.	IPSN	2003	DBLP DOI BibTeX RDF
22	Hermann Ney	On the Relationship between Classification Error Bounds and Training Criteria in Statistical Pattern Recognition.	IbPRIA	2003	DBLP DOI BibTeX RDF
22	François Clautiaux, Jacques Carlier, Aziz Moukrim, Stéphane Nègre	New Lower and Upper Bounds for Graph Treewidth.	WEA	2003	DBLP DOI BibTeX RDF
22	Aseem Agarwal, David T. Blaauw, Vladimir Zolotov, Sarma B. K. Vrudhula	Statistical Timing Analysis Using Bounds.	DATE	2003	DBLP DOI BibTeX RDF
22	Eli Ben-Sasson, Oded Goldreich 0001, Madhu Sudan 0001	Bounds on 2-Query Codeword Testing.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
22	James R. Morrison, P. R. Kumar 0001	New Linear Program Performance Bounds for Closed Queueing Networks.	Discret. Event Dyn. Syst.	2001	DBLP DOI BibTeX RDF	closed networks, closed reentrant lines, asymptotic loss, scheduling, performance evaluation, efficiency, throughput, Queueing networks
22	B. S. Panda 0001, Sajal K. Das 0001	An Efficient Algorithm for Computing Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems.	HiPC	2001	DBLP DOI BibTeX RDF
22	Sriram V. Pemmaraju	Equitable Coloring Extends Chernoff-Hoeffding Bounds.	RANDOM-APPROX	2001	DBLP DOI BibTeX RDF
22	Eric Bax	Partition-based and sharp uniform error bounds.	IEEE Trans. Neural Networks	1999	DBLP DOI BibTeX RDF
22	Tatsuaki Okamoto, Moti Yung	Lower Bounds on Term-Based Divisible Cash Systems.	Public Key Cryptography	1998	DBLP DOI BibTeX RDF
22	Diana Marculescu, Radu Marculescu, Massoud Pedram	Theoretical bounds for switching activity analysis in finite-state machines.	ISLPED	1998	DBLP DOI BibTeX RDF
22	Leah Epstein	Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines.	APPROX	1998	DBLP DOI BibTeX RDF
22	Ralf Heckmann, Thomas Lengauer	Computing Upper and Lower Bounds on Textile Nesting Problems.	ESA	1996	DBLP DOI BibTeX RDF
22	James F. Kurose	On Computing Per-session Performance Bounds in High-Speed Multi-hop Computer Networks.	SIGMETRICS	1992	DBLP DOI BibTeX RDF
20	Igor Pak	The product replacement algorithm is polynomial.	FOCS	2000	DBLP DOI BibTeX RDF	product replacement algorithm, random group elements, generating /spl kappa/-tuples, random component, group algebra packages, MAGMA, state of the art analytic technique, polynomial bounds, sub exponential bounds, polynomial upper bound, heuristic, random walk, polynomials, random number generation, heuristic programming, symbol manipulation, group theory, graph connectivity, GAP
20	Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh 0001	The Quantum Complexity of Set Membership.	FOCS	2000	DBLP DOI BibTeX RDF	quantum complexity, static set membership problem, bit table, quantum bit-probe model, black-box unitary transform, oracle calls, basis state superposition, space-probe tradeoff, computational complexity, query processing, lower bounds, quantum computing, upper bounds, linear algebra, linear algebra, set theory, probes, query answering, query algorithm
20	Dimitrios Stiliadis, Anujan Varma	Latency-rate servers: a general model for analysis of traffic scheduling algorithms.	IEEE/ACM Trans. Netw.	1998	DBLP DOI BibTeX RDF	fair queueing algorithms, delay bounds, performance bounds, traffic scheduling
20	Debasis Mitra 0001, John A. Morrison, K. G. Ramakrishnan	ATM network design and optimization: a multirate loss network framework.	IEEE/ACM Trans. Netw.	1996	DBLP DOI BibTeX RDF	Erlang bounds, fixed-point equations, flow bounds, implied costs, steepest ascent, routing, EM algorithm, effective bandwidth, revenue maximization, asymptotic approximations
20	Richard Beigel, David Eppstein	3-Coloring in Time O(1.3446n): A No-MIS Algorithm.	FOCS	1995	DBLP DOI BibTeX RDF	duality (mathematics), 3-coloring, worst case time bounds, 3-edge-coloring, 3-list-coloring, common generalization, symbol-system satisfiability, duality transformation, computational complexity, computability, decidability, NP-complete problems, graph colouring, time bounds, 3-SAT
20	Peter Auer, Manfred K. Warmuth	Tracking the Best Disjunction.	FOCS	1995	DBLP DOI BibTeX RDF	best disjunction tracking, deterministic on-line learning algorithm, k-literal disjunctions, worst-case mistake bounds, learning (artificial intelligence), upper bounds, computational linguistics, randomised algorithms, amortized analysis, Winnow
20	Amos Fiat, Yishay Mansour, Adi Rosén, Orli Waarts	Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version).	FOCS	1995	DBLP DOI BibTeX RDF	competitive access time, dynamic storage rearrangement, industrial stacker crane warehouse, automatic robot run warehouse, disk track optimization, two dimensional memory management, bubble memory, doubly linked list management, computational complexity, database, graph theory, lower bounds, optimisation, database management systems, upper bounds, server, storage allocation, probability distribution, tree structure, tree data structures, operations research, undirected graph, process migration, competitive algorithms, competitive algorithms, warehouse, disk storage, mass storage systems
20	Eric Schenk	Faster Approximate Agreement with Multi-Writer Registers.	FOCS	1995	DBLP DOI BibTeX RDF	multi-writer registers, wait-free approximate agreement problem, asynchronous shared memory, single-bit multi-writer multi-reader registers, wait-free single-writer multi-reader, wait-free multi-writer multi-reader, computational complexity, complexity, distributed algorithms, lower bounds, shared memory systems, upper bounds, shared registers
20	Bernd Gärtner, Günter M. Ziegler	Randomized Simplex Algorithms on Klee-Mintny Cubes	FOCS	1994	DBLP DOI BibTeX RDF	quadratic worst-case behavior, randomized simplex algorithms, Klee-Minty cubes, quadratic lower bounds, quadratic upper bounds, complexity, linear programs, combinatorial models
20	György Turán, Farrokh Vatan	On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract)	FOCS	1994	DBLP DOI BibTeX RDF	explicit nonlinear lower bounds, computation of Boolean functions, bounded fan-in, real-valued functions, sign-representation, n-variable function, piecewise linear circuits, complexity, upper bounds, nondeterminism, analog circuits
20	Mario Szegedy	A note on the Theta number of Lovász and the generalized Delsarte bound	FOCS	1994	DBLP DOI BibTeX RDF	semidefinite, /spl theta/ number, generalized Delsarte bound, convex programming upper bounds, programming upper bounds, convex programming
20	Baruch Awerbuch, Rainer Gawlick, Frank Thomson Leighton, Yuval Rabani	On-line Admission Control and Circuit Routing for High Performance Computing and Communication	FOCS	1994	DBLP DOI BibTeX RDF	greedy-based approaches, on-line admission control, circuit routing, high performance communication, virtual circuit routing, real-lime database servers, lower bounds, high performance computing, hypercubes, trees, upper bounds, optimal algorithms, arrays, video-servers
20	Haripriyan Hampapuram, Michael L. Fredman	Optimal Bi-Weighted Binary Trees and the Complexity of Maintaining Partial Sums	FOCS	1993	DBLP DOI BibTeX RDF	optimal bi-weighted binary trees, maintaining partial sums, complexity, data structure, lower bounds, upper bounds, weighting scheme, query operation
20	Amir M. Ben-Amram, Zvi Galil	When can we sort in o(n log n) time?	FOCS	1993	DBLP DOI BibTeX RDF	Boolean instructions, arithmetic instructions, nonuniform programs, double-precision multiplication, lower bounds, upper bounds, random access machine
20	Nicholas S. Bowen, Christos Nikolaou, Arif Ghafoor	On the Assignment Problem of Arbitrary Process Systems to Heterogeneous Distributed Computer Systems.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	arbitrary process systems, heterogeneous distributed computer systems, allocation algorithm, branch-and-bound-type algorithms, suboptimality tradeoff, heuristic allocation, workload patterns, performance evaluation, lower bounds, distributed databases, time complexity, hierarchical clustering, upper bounds, heuristic programming, assignment problem
20	Weijia Shang, José A. B. Fortes	Independent Partitioning of Algorithms with Uniform Dependencies.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	uniform dependence algorithms, index sets, maximal independent partitions, optimality, parallel algorithms, computational complexity, computational complexity, lower bounds, upper bounds, multiple instruction multiple data, cardinality, MIMD machines
20	Yossi Azar, Andrei Z. Broder, Anna R. Karlin	On-line Load Balancing (Extended Abstract)	FOCS	1992	DBLP DOI BibTeX RDF	on-line greedy algorithm, online load balancing, randomised online algorithm, deterministic online algorithm, lower bounds, upper bounds, servers, LAN
20	Mahdi Abdelguerfi, Arun K. Sood	Computational Complexity of Sorting and Joining Relations with Duplicates.	IEEE Trans. Knowl. Data Eng.	1991	DBLP DOI BibTeX RDF	duplicate values, attribute columns, distinct tuple values, multirelation, distinct elements, worst time complexity, binary comparisons, three-branch comparisons, natural join operation, computational complexity, computational complexity, relational databases, lower bounds, sorting, sorting, database theory, upper bounds, relations, joining, cardinality