Search results for "lower-bound"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
70	Yufeng Wu, Dan Gusfield	A new recombination lower bound and the minimum perfect phylogenetic forest problem.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Lower bound on the minimum number of recombination, Ancestral recombination graph, Computational complexity, Recombination, Population genetics
65	Michel Langevin, Eduard Cerny	A recursive technique for computing lower-bound performance of schedules.	ACM Trans. Design Autom. Electr. Syst.	1996	DBLP DOI BibTeX RDF	lower-bound on performance, microcode optimization, scheduling, resource constraints, dataflow graph
58	Yunpeng Pan, Leyuan Shi	On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems.	Math. Program.	2007	DBLP DOI BibTeX RDF	Time-indexing, Scheduling, Combinatorial optimization
56	Satyanarayana V. Lokam	Graph Complexity and Slice Functions.	Theory Comput. Syst.	2003	DBLP DOI BibTeX RDF
55	Firouz Behnamfar, Fady Alajaji, Tamás Linder	An Efficient Algorithmic Lower Bound for the Error Rate of Linear Block Codes.	IEEE Trans. Commun.	2007	DBLP DOI BibTeX RDF
55	Jin-yi Cai, Martin Fürer, Neil Immerman	An Optimal Lower Bound on the Number of Variables for Graph Identification	FOCS	1989	DBLP DOI BibTeX RDF	optimal lower bound, graph identification, lower bound, first-order logic
55	Satoshi Fujita, Masayuki Masukawa, Shigeaki Tagashira	A Fast Branch-and-Bound Algorithm with an Improved Lower Bound for Solving the Multiprocessor Scheduling Problem.	ICPADS	2002	DBLP DOI BibTeX RDF	lower bound on the execution time, quadratic algorithm, Branch-and-bound algorithm, multiprocessor scheduling problem
52	Giri Tiruvuri, Moon Chung	Estimation of lower bounds in scheduling algorithms for high-level synthesis.	ACM Trans. Design Autom. Electr. Syst.	1998	DBLP DOI BibTeX RDF	lower-bound estimated, scheduling, dynamic programming, high-level synthesis
52	Zhaoxuan Shen, Ching-Chuen Jong	Functional area lower bound and upper bound on multicomponentselection for interval scheduling.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2000	DBLP DOI BibTeX RDF
51	Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger	A Comparison of Two Lower Bound Methods for Communication Complexity.	MFCS	1994	DBLP DOI BibTeX RDF
50	Yufeng Wu, Dan Gusfield	A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem.	COCOON	2007	DBLP DOI BibTeX RDF
50	Ilia Rapoport, Yaakov Oshman	A new estimation error lower bound for interruption indicators in systems with uncertain measurements.	IEEE Trans. Inf. Theory	2004	DBLP DOI BibTeX RDF
50	Rajat Kumar Pal, Sudebkumar Prasant Pal, Ajit Pal	An Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing.	VLSI Design	1997	DBLP DOI BibTeX RDF	three-layer restricted dogleg routing model, nontrivial lower bound, channel routing problem, two-layer Manhattan routing model, three-layer no-dogleg HVH routing model, two-layer restricted dogleg routing model, vertical constraint graph, VLSI, polynomial time algorithm, VLSI design
47	Rui Fan 0004, Nancy A. Lynch	An Omega (n log n) lower bound on the cost of mutual exclusion.	PODC	2006	DBLP DOI BibTeX RDF	lower bound techniques, information theory, time complexity, mutual exclusion
47	Rina Panigrahy, Kunal Talwar, Udi Wieder	A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match.	FOCS	2008	DBLP DOI BibTeX RDF
47	Iftach Haitner, Jonathan J. Hoch, Gil Segev 0001	A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.	TCC	2008	DBLP DOI BibTeX RDF
47	Yishay Mansour, Baruch Schieber, Prasoon Tiwari	A Lower Bound for Integer Greatest Common Divisor Computations.	J. ACM	1991	DBLP DOI BibTeX RDF	floor operation, greatest common devisor, mod operation, lower bound, truncation
45	Craig H. Richardson, Ronald W. Schafer	A Lower Bound for Structuring Element Decompositions.	IEEE Trans. Pattern Anal. Mach. Intell.	1991	DBLP DOI BibTeX RDF	morphological structuring elements, lower bound, picture processing, picture processing, optimisation, decomposition
44	Emanuele Viola, Avi Wigderson	One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications.	FOCS	2007	DBLP DOI BibTeX RDF
44	Rahul Jain 0001, Jaikumar Radhakrishnan, Pranab Sen	A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness.	FOCS	2003	DBLP DOI BibTeX RDF
44	Mayez A. Al-Mouhamed	Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	precedence graphs, earliest starting time, task delay, finish time, minimum time increase, interprocessor communication links, optimum performance, small graphs, scheduling, scheduling, graph theory, lower bounds, communication costs, task graph, completion time, time interval
43	Chuan-Yu Wang, Kaushik Roy 0001	Maximum power estimation for CMOS circuits using deterministic and statistic approaches.	VLSI Design	1996	DBLP DOI BibTeX RDF	maximum power estimation, deterministic approach, instantaneous power consumption, ATG technique, Monte Carlo based technique, computational complexity, VLSI, lower bound, statistical analysis, automatic testing, circuit analysis computing, Monte Carlo methods, automatic test generation, VLSI circuits, CMOS circuits, CMOS digital integrated circuits, statistic approach
42	Ranganath Nuggehalli, Timothy J. Lowe, James E. Ward	An Improved Lower Bound for the Multimedian Location Problem.	Ann. Oper. Res.	2002	DBLP DOI BibTeX RDF	location on networks, median problem, lower bound
42	Xiuzhen Huang, Jing Lai	Maximum Common Subgraph: Upper Bound and Lower Bound Results.	IMSCCS (1)	2006	DBLP DOI BibTeX RDF
42	Peter R. Cappello, Ömer Egecioglu	Automatic Processor Lower Bound Formulas for Array Computations.	ISPAN	2002	DBLP DOI BibTeX RDF	Array computation, Diophantine system, lower bound
42	Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz	Communication-optimal parallel and sequential Cholesky decomposition: extended abstract.	SPAA	2009	DBLP DOI BibTeX RDF	Cholesky decomposition, communication avoiding, algorithm, lower bound, latency, bandwidth
40	Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven	On the Black-Box Complexity of Sperner's Lemma.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Sperner’s lemma, Probabilistic and quantum lower bound, Deterministic algorithm, Query complexity
40	Satoshi Fujita, Tadanori Nakagawa	Lower Bounding Techniques for the Multiprocessor Scheduling Problem with Communication Delay.	IEEE PACT	1999	DBLP DOI BibTeX RDF	inevitable communication delay, lower bound, Multiprocessor scheduling problem
40	Bernard Chazelle	A Spectral Approach to Lower Bounds	FOCS	1994	DBLP DOI BibTeX RDF	median eigenvalue, nonlinear lower bound, halfplane range searching, nontrivial lower bound, linear circuit complexity, linear map, geometric set system, lower bounds, range searching
40	Hachemi Bennaceur, Aomar Osmani	Computing Lower Bound for MAX-CSP Problems.	IEA/AIE	2003	DBLP DOI BibTeX RDF
40	George Christodoulou 0001, Elias Koutsoupias, Angelina Vidali	A Lower Bound for Scheduling Mechanisms.	Algorithmica	2009	DBLP DOI BibTeX RDF	Scheduling unrelated machines, Lower bound, Algorithmic mechanism design
40	Larry J. Stockmeyer, Albert R. Meyer	Cosmological lower bound on the circuit complexity of a small problem in logic.	J. ACM	2002	DBLP DOI BibTeX RDF	WS1S, practical undecidability, computational complexity, lower bound, logic, Circuit complexity, decision problem
40	Christophe Genolini, Sébastien Tixeuil	A Lower Bound on Dynamic k-Stabilization in Asynchronous Systems.	SRDS	2002	DBLP DOI BibTeX RDF	Dynamic problems, Lower bound, Self-stabilization, Asynchronous systems, Transient failures, Time adaptivity
40	Micha Sharir, Emo Welzl	Balanced lines, halving triangles, and the generalized lower bound theorem.	SCG	2001	DBLP DOI BibTeX RDF	$k$-sets, Gale transform, Lovasz Lemma, balanced lines, generalized lower bound theorem, halving triangles
40	Yinan N. Shen, Xiao-Tao Chen, Susumu Horiguchi, Fabrizio Lombardi	On the multiple fault diagnosis of multistage interconnection networks: the lower bound and the CMOS fault model.	ICPP	1997	DBLP DOI BibTeX RDF	CMOS fault model, multiple fault diagnosis, interconnection networks, fault diagnosis, lower bound, multistage interconnection networks, multistage interconnection networks, CMOS technology, stuck-open faults
40	Christer Berg, Staffan Ulfberg	A Lower Bound for Perceptrons and an Oracle Separation of the PPPH Hierarchy.	CCC	1997	DBLP DOI BibTeX RDF	oracle separation, PP/sup PH/ hierarchy, linear size boolean circuits, superpolynomial size perceptrons, lower bound, Boolean functions, perceptrons
40	Ilia Rapoport, Yaakov Oshman	Weiss-Weinstein Lower Bounds for Markovian Systems. Part 1: Theory.	IEEE Trans. Signal Process.	2007	DBLP DOI BibTeX RDF
39	Tianping Shuai, Donglei Du	A Lower Bound for the On-Line Preemptive Machine Scheduling with lp.	COCOON	2008	DBLP DOI BibTeX RDF
39	Mi Zhou, Man Hon Wong 0001	Boundary-Based Lower-Bound Functions for Dynamic Time Warping and Their Indexing.	ICDE	2007	DBLP DOI BibTeX RDF
39	Ambighairajah Yasotharan	Lower bound on the BER of a pre- and postequalized vector communication system.	IEEE Trans. Commun.	2005	DBLP DOI BibTeX RDF
39	Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen	Lower Bounds for Dynamic Algebraic Problems.	STACS	1999	DBLP DOI BibTeX RDF
39	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
39	Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam	The price of anarchy in network creation games.	PODC	2007	DBLP DOI BibTeX RDF	routing, nash equilibrium, network design, price of anarchy
38	Itai Ashlagi, Shahar Dobzinski, Ron Lavi	An optimal lower bound for anonymous scheduling mechanisms.	EC	2009	DBLP DOI BibTeX RDF	scheduling, incentive compatibility
38	Elad Barkan, Eli Biham, Adi Shamir	Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs.	CRYPTO	2006	DBLP DOI BibTeX RDF	Time/memory tradeoff, time/memory/data tradeoff, hidden state, stateful random graph, Hellman, lower bound, Cryptanalysis, rigorous, Rainbow
37	Franz Baader	Unification, Weak Unification, Upper Bound, Lower Bound, and Generalization Problems.	RTA	1991	DBLP DOI BibTeX RDF
37	Scot Anderson, Peter Z. Revesz	Verifying the Incorrectness of Programs and Automata.	SARA	2005	DBLP DOI BibTeX RDF
37	James H. Anderson, Yong-Jik Kim	An improved lower bound for the time complexity of mutual exclusion.	Distributed Comput.	2002	DBLP DOI BibTeX RDF	Lower bounds, Shared memory, Time complexity, Mutual exclusion, Atomicity, Local spinning
37	Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro	Lower Bounds for Clear Transmissions in Radio Networks.	LATIN	2006	DBLP DOI BibTeX RDF	Station selection, Wake up, Weak Sensor Model, ACM-class: F.2.2, Sensor network, Ad-hoc network, Lower bound, Broadcast, Dominating set, Leader election, Radio network, Maximal independent set, Contention resolution, Random geometric graphs
37	Martin Sauerhoff, Philipp Woelfel	Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions.	STOC	2003	DBLP DOI BibTeX RDF	hash class, lower bound, branching program, time-space tradeoff, integer multiplication, random access machine
37	Adam R. Klivans, Alexander A. Sherstov	A Lower Bound for Agnostically Learning Disjunctions.	COLT	2007	DBLP DOI BibTeX RDF
37	Shengyu Zhang	On the Power of Ambainis's Lower Bounds.	ICALP	2004	DBLP DOI BibTeX RDF
37	Leah Epstein	Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines.	APPROX	1998	DBLP DOI BibTeX RDF
36	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
35	Leah Epstein, Thomas Erlebach, Asaf Levin	Variable Sized Online Interval Coloring with Bandwidth.	Algorithmica	2009	DBLP DOI BibTeX RDF	Interval coloring, Approximation algorithm, Lower bound, Competitive analysis
35	Tal Mizrahi, Yoram Moses	Continuous Consensus with Failures and Recoveries.	DISC	2008	DBLP DOI BibTeX RDF	Continuous Consensus, Early decision, Process recovery, Round-based computation model, Synchronous message-passing system, Distributed algorithm, Lower bound, Modularity, Consensus, Agreement problem, Common Knowledge, Simultaneity, Omission failures, Process crash failure
35	Teresa Alsinet, Felip Manyà, Jordi Planes	A Max-SAT Solver with Lazy Data Structures.	IBERAMIA	2004	DBLP DOI BibTeX RDF	data structures, heuristics, lower bound, branch and bound, Max-SAT
35	Vineet Bafna, Vikas Bansal 0001	Improved Recombination Lower Bounds for Haplotype Data.	RECOMB	2005	DBLP DOI BibTeX RDF
35	Dmitriy Yu. Cherukhin	Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates.	CSR	2008	DBLP DOI BibTeX RDF	complexity, lower bound, Boolean function, circuit, depth, cyclic convolution
35	Bertrand M. T. Lin, T. C. Edwin Cheng	Two-Machine Flowshop Batching and Scheduling.	Ann. Oper. Res.	2005	DBLP DOI BibTeX RDF	strong NP-hardness, heuristics, lower bound, makespan, batch processing, production scheduling, flowshop
35	Phillip G. Bradford, Olga V. Gavrylyako	Foundations of Security for Hash Chains in Ad Hoc Networks.	Clust. Comput.	2005	DBLP DOI BibTeX RDF	time-space lower bound, hash chains, k-wise independence
35	Chunmei Liu, Yinglei Song, Legand L. Burge III	Parameterized lower bound and inapproximability of polylogarithmic string barcoding.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Polylogarithmic string barcoding, Parameterized lower bound, Inapproximability
35	Hervé Fournier, Antoine Vigneron	A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope.	Algorithmica	2007	DBLP DOI BibTeX RDF	Hopcroft’s problem, Computational geometry, Lower bound, Diameter, Convex polytope
35	Ketan Mulmuley, Pradyut Shah	A Lower Bound for the Shortest Path Problem.	CCC	2000	DBLP DOI BibTeX RDF	parallel, lower bound, shortest path problem
35	Miklós Ajtai	A Non-linear Time Lower Bound for Boolean Branching Programs.	FOCS	1999	DBLP DOI BibTeX RDF	Hankel matrix, lower bound, branching program
35	Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.	Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees.	FOCS	1995	DBLP DOI BibTeX RDF	algebraic decision trees, n-dimensional convex polyhedron, naturally appearing polyhedra, computational geometry, lower bound, lower bounds, decision theory, polyhedron, membership testing
35	Andrew Chi-Chih Yao	A Lower Bound for the Monotone Depth of Connectivity	FOCS	1994	DBLP DOI BibTeX RDF	monotone depth of connectivity, proof technique, Razborov's approximation method, computational complexity, computational geometry, lower bound, lower bounds, graph connectivity, graph problems, monotone circuit
35	William S. Evans, Leonard J. Schulman	Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas	FOCS	1993	DBLP DOI BibTeX RDF	signal propagation, noisy formulas depth, information signal, exact bounds, decay, lower bound, Markov chains, upper bound
35	Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, Mark R. Tuttle	A Tight Lower Bound for k-Set Agreement	FOCS	1993	DBLP DOI BibTeX RDF	tight lower bound, message-passing model, proof techniques, fault tolerance, communication, consensus, tradeoff, k-set agreement
35	Rüdiger Reischuk, Bernd Schmeltz	Reliable Computation with Noisy Circuits and Decision Trees-A General n log n Lower Bound	FOCS	1991	DBLP DOI BibTeX RDF	noisy decision tree complexity, tree depth, noisy circuits, critical number, static Boolean decision trees, erroneous answers, noisy dynamic decision trees, lower bound, Boolean functions, computational model, Boolean circuits, questions, answers
35	Rajamani Sundar	A Lower Bound for the Dictionary Problem under a Hashing Model	FOCS	1991	DBLP DOI BibTeX RDF	randomized complexities, update costs, deterministic complexities, constant amortized time, multilevel hashing model, log-algorithmic amortized time, nontrivial lower bound, limited wordsize, memory locations, data structures, polynomial space, dictionary problem, cell probe model
35	Yigal Brandman, Alon Orlitsky, John L. Hennessy	A Spectral Lower Bound Techniqye for the Size of Decision Trees and Two Level AND/OR Circuits.	IEEE Trans. Computers	1990	DBLP DOI BibTeX RDF	spectral lower bound technique, two-level AND/OR circuits, arbitrary Boolean function, power spectrum coefficients, n dimensional Fourier transform, decision trees, Boolean functions, trees (mathematics), Fourier transforms, logic circuits
35	Nader H. Bshouty	A Lower Bound for Matrix Multiplication	FOCS	1988	DBLP DOI BibTeX RDF	lower bound, matrix multiplication, binary field
35	Yang Cai 0001, Ting Zhang, Haifeng Luo	An Improved Lower Bound for the Complementation of Rabin Automata.	LICS	2009	DBLP DOI BibTeX RDF
35	Thomas Colcombet, Konrad Zdanowski	A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata.	ICALP (2)	2009	DBLP DOI BibTeX RDF
35	Alexis Maciel, Toniann Pitassi	Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives.	LICS	2006	DBLP DOI BibTeX RDF
35	Alexander A. Razborov, Sergey Yekhanin	An Omega(n1/3) Lower Bound for Bilinear Group Based Private Information Retrieval.	FOCS	2006	DBLP DOI BibTeX RDF
35	Beate Bollig, Philipp Woelfel	A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications.	Theory Comput. Syst.	2005	DBLP DOI BibTeX RDF
35	Beate Bollig, Philipp Woelfel	A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications.	MFCS	2002	DBLP DOI BibTeX RDF
35	Dima Grigoriev	Randomized Complexity Lower Bound for Arrangements and Polyhedra.	Discret. Comput. Geom.	1999	DBLP DOI BibTeX RDF
35	Tobias Polzin, Siavash Vahdati Daneshmand	Primal-dual approaches to the Steiner problem.	APPROX	2000	DBLP DOI BibTeX RDF	dual-ascent, approximation algorithms, lower bound, relaxation, primal-dual, Steiner problem
34	Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan	A tight lower bound for parity in noisy communication networks.	SODA	2008	DBLP BibTeX RDF
34	Rina Dechter, Kalev Kask, Javier Larrosa	A General Scheme for Multiple Lower Bound Computation in Constraint Optimization.	CP	2001	DBLP DOI BibTeX RDF
34	Gil Wiechman, Igal Sason	An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
33	Hartmut Klauck	Rectangle Size Bounds and Threshold Covers in Communication Complexity.	CCC	2003	DBLP DOI BibTeX RDF
33	Lars Kruse, Eike Schmidt, Gerd Jochens, Ansgar Stammermann, Wolfgang Nebel	Lower Bound Estimation for Low Power High-Level Synthesis.	ISSS	2000	DBLP DOI BibTeX RDF
33	Yufei Tao 0001, Ke Yi 0001, Cheng Sheng 0001, Jian Pei, Feifei Li 0001	Logging every footstep: quantile summaries for the entire history.	SIGMOD Conference	2010	DBLP DOI BibTeX RDF	lower bound, approximation, quantile
33	Shengyu Zhang	New upper and lower bounds for randomized and quantum local search.	STOC	2006	DBLP DOI BibTeX RDF	query complexity (decision tree complexity), lower bound, local search, randomized algorithm, quantum algorithm
33	Débora P. Ronconi	A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking.	Ann. Oper. Res.	2005	DBLP DOI BibTeX RDF	lower bound, branch-and-bound, blocking, makespan, flowshop
33	László Babai, Peter G. Kimmel	Randomized Simultaneous Messages: Solution of a Problem of Yao in Communication Complexity.	CCC	1997	DBLP DOI BibTeX RDF	randomized simultaneous messages, two-player communication model, deterministic SM complexity, quadratic reduction, lower bound proof, computational complexity, communication complexity, linear algebra
33	Xian Cheng, Oliver C. Ibe	Reliability of a Class of Multistage Interconnection Networks.	IEEE Trans. Parallel Distributed Syst.	1992	DBLP DOI BibTeX RDF	extra-stage interconnectionnetworks, fault-free path, input-output pair, networkreliability, broadcast reliability, recursive expression, lower bound, probability, multiprocessor interconnection networks, upper bound, multistage interconnection networks, tight bounds, reliability theory, terminal reliability
32	Daniel Enrique Lucani, Muriel Médard, Milica Stojanovic	Underwater Acoustic Networks: Channel Models and Network Coding Based Lower Bound to Transmission Power for Multicast.	IEEE J. Sel. Areas Commun.	2008	DBLP DOI BibTeX RDF
32	Songtao Guo, Xintao Wu, Yingjiu Li	On the Lower Bound of Reconstruction Error for Spectral Filtering Based Privacy Preserving Data Mining.	PKDD	2006	DBLP DOI BibTeX RDF
32	Scott Aaronson	Quantum lower bound for the collision problem.	STOC	2002	DBLP DOI BibTeX RDF
32	Jürgen Forster	A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity.	CCC	2001	DBLP DOI BibTeX RDF
32	Bo-Ting Yang, Paul Gillard	The class Steiner minimal tree problem: a lower bound and test problem generation.	Acta Informatica	2000	DBLP DOI BibTeX RDF
32	Kurt Mehlhorn, Stefan Näher, Helmut Alt	A Lower Bound for the Complexity of the Union-Split-Find Problem.	ICALP	1987	DBLP DOI BibTeX RDF
32	Hagit Attiya, Danny Hendler, Philipp Woelfel	Tight rmr lower bounds for mutual exclusion and other problems.	STOC	2008	DBLP DOI BibTeX RDF	bounded counter, lower-bound techniques, store/collect object, information theory, shared-memory, mutual exclusion
32	John Hershberger 0001, Subhash Suri, Amit M. Bhosle	On the difficulty of some shortest path problems.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	k shortest simple paths, replacement path, lower bound, shortest path
32	Amit Chakrabarti	Lower Bounds for Multi-Player Pointer Jumping.	CCC	2007	DBLP DOI BibTeX RDF