Search results for "lower bound"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	George Christodoulou, Elias Koutsoupias, Angelina Vidali	A Lower Bound for Scheduling Mechanisms.	Algorithmica	2009	DBLP DOI BibTeX RDF	Scheduling unrelated machines, Lower bound, Algorithmic mechanism design
3	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
3	Rui Fan, 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
3	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
3	Ranganath Nuggehalli, Timothy J. Lowe, James E. Ward	An Improved Lower Bound for the Multimedian Location Problem.	Annals OR	2002	DBLP DOI BibTeX RDF	location on networks, median problem, lower bound
3	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
3	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
3	Peter R. Cappello, Ömer Egecioglu	Automatic Processor Lower Bound Formulas for Array Computations. (PDF / PS)	ISPAN	2002	DBLP DOI BibTeX RDF	Array computation, Diophantine system, lower bound
3	Micha Sharir, Emo Welzl	Balanced lines, halving triangles, and the generalized lower bound theorem.	Symposium on Computational Geometry	2001	DBLP DOI BibTeX RDF	$k$-sets, Gale transform, Lovasz Lemma, balanced lines, generalized lower bound theorem, halving triangles
3	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. (PDF / PS)	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
3	Rajat K. 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
3	Christer Berg, Staffan Ulfberg	A Lower Bound for Perceptrons and an Oracle Separation of the PPPH Hierarchy. (PDF / PS)	IEEE Conference on Computational Complexity	1997	DBLP DOI BibTeX RDF	oracle separation, PP/sup PH/ hierarchy, linear size boolean circuits, superpolynomial size perceptrons, lower bound, Boolean functions, perceptrons
3	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
3	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
3	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
3	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
2	Taiga Takata, Yusuke Matsunaga	A heuristic algorithm for LUT-based FPGA technology mapping using the lower bound for DAG covering problem (abstract only).	FPGA	2010	DBLP DOI BibTeX RDF	fpga, technology mapping
2	Yufei Tao, Ke Yi, Cheng Sheng, Jian Pei, Feifei Li	Logging every footstep: quantile summaries for the entire history.	SIGMOD Conference	2010	DBLP DOI BibTeX RDF	lower bound, approximation, quantile
2	Joseph Wun-Tat Chan, Prudence W. H. Wong, Fencol C. C. Yung	On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis.	Algorithmica	2009	DBLP DOI BibTeX RDF
2	Yu Dong, Wing-Kai Hon, David K. Y. Yau, Jren-Chit Chin	Distance Reduction in Mobile Wireless Communication: Lower Bound Analysis and Practical Attainment.	IEEE Trans. Mob. Comput.	2009	DBLP DOI BibTeX RDF
2	Sebastian Sager, Hans Georg Bock, Gerhard Reinelt	Direct methods with maximal lower bound for mixed-integer optimal control problems.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 34H05, 49J30, 90C11
2	Andre Osterloh	A Lower Bound for Oblivious Dimensional Routing.	Euro-Par	2009	DBLP DOI BibTeX RDF
2	Mohammad Al Hasan, Saeed Salem, Benjarath Pupacdi, Mohammed J. Zaki	Clustering with Lower Bound on Similarity.	PAKDD	2009	DBLP DOI BibTeX RDF
2	Thomas Colcombet, Konrad Zdanowski	A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata.	ICALP	2009	DBLP DOI BibTeX RDF
2	Jan Johannsen	An Exponential Lower Bound for Width-Restricted Clause Learning.	SAT	2009	DBLP DOI BibTeX RDF
2	Hans L. Bodlaender	Kernelization: New Upper and Lower Bound Techniques.	IWPEC	2009	DBLP DOI BibTeX RDF	algorithms, kernel, kernelization, preprocessing, data reduction, fixed parameter tractability, combinatorial problems
2	Kaibo Wang, Xingshe Zhou, Shandan Zhou, Ning Fu	Simplify Stochastic QoS Admission Test for Composite Services through Lower Bound Approximation.	IEEE SCC	2009	DBLP DOI BibTeX RDF
2	Jim Sukha	Brief announcement: a lower bound for depth-restricted work stealing.	SPAA	2009	DBLP DOI BibTeX RDF	dynamic multithreading, intel threading building blocks, scheduling, work stealing, cilk
2	Oliver Friedmann	An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it.	LICS	2009	DBLP DOI BibTeX RDF
2	Yang Cai, Ting Zhang, Haifeng Luo	An Improved Lower Bound for the Complementation of Rabin Automata.	LICS	2009	DBLP DOI BibTeX RDF
2	Itai Ashlagi, Shahar Dobzinski, Ron Lavi	An optimal lower bound for anonymous scheduling mechanisms.	ACM Conference on Electronic Commerce	2009	DBLP DOI BibTeX RDF	scheduling, incentive compatibility
2	Quan T. Nguyen, Saïd Bettayeb	The upper bound and lower bound of the genus of pancake graphs.	ISCC	2009	DBLP DOI BibTeX RDF
2	Ke Yi	Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes.	PODS	2009	DBLP DOI BibTeX RDF	lower bound, indexability, dynamization, range query
2	Hagit Attiya, Eshcar Hillel, Alessia Milani	Inherent limitations on disjoint-access parallel implementations of transactional memory.	SPAA	2009	DBLP DOI BibTeX RDF	disjoint-access parallelism, partial snapshots, lower bound, transactional memory, impossibility result
2	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
2	Bogdan S. Chlebus, Dariusz R. Kowalski	Locally scalable randomized consensus for synchronous crash failures.	SPAA	2009	DBLP DOI BibTeX RDF	bit communication complexity, graph expansion, fault tolerance, scalability, lower bound, message passing, randomization, consensus, synchrony
2	Martin Dietzfelbinger, Philipp Woelfel	Tight lower bounds for greedy routing in uniform small world rings.	STOC	2009	DBLP DOI BibTeX RDF	peer-to-peer, lower bound, random graphs, small worlds, greedy routing, small world graphs
2	Emanuele Viola	Bit-probe lower bounds for succinct data structures.	STOC	2009	DBLP DOI BibTeX RDF	bit-probe, cell-probe, logarithmic form, ternary value, lower bound, dictionary, succinct data structure, membership query
2	Martin Biely, Josef Widder	Optimal message-driven implementations of omega with mute processes.	TAAS	2009	DBLP DOI BibTeX RDF	message-driven distributed algorithm, Fault tolerance, lower bound, unreliable failure detectors
2	Andrea Bottino	Towards an Iterative Algorithm for the Optimal Boundary Coverage of a 3D Environment.	CIARP	2009	DBLP DOI BibTeX RDF	3D sensor positioning, lower bound, Art Gallery
2	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
2	François Bonnet, Michel Raynal	Conditions for Set Agreement with an Application to Synchronous Systems.	J. Comput. Sci. Technol.	2009	DBLP DOI BibTeX RDF	lower bound, efficiency, condition, synchronous system, agreement problem
2	Nenad Dedic, Gene Itkis, Leonid Reyzin, Scott Russell	Upper and Lower Bounds on Black-Box Steganography.	J. Cryptology	2009	DBLP DOI BibTeX RDF	Rejection sampling, Pseudorandomnness, Huge random objects, Lower bound, Steganography, Information hiding, Covert communication
2	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
2	Ahmed Ghoniem, Hanif D. Sherali	Complementary column generation and bounding approaches for set partitioning formulations.	Optimization Letters	2009	DBLP DOI BibTeX RDF	Complementary column generation, Duality-based lower bound, One-dimensional bin packing, Vehicle assembly-routing, Column generation
2	Ke Deng, Xiaofang Zhou, Heng Tao Shen, Shazia W. Sadiq, Xue Li	Instance optimal query processing in spatial networks.	VLDB J.	2009	DBLP DOI BibTeX RDF	Instance optimality, Incremental lower bound constraint, Spatial queries, Spatial networks
2	Wilfried Gappmair	Cramer-Rao Lower Bound for Non-Data-Aided SNR Estimation of Linear Modulation Schemes.	IEEE Transactions on Communications	2008	DBLP DOI BibTeX RDF
2	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
2	Xiliang Zhong, Cheng-Zhong Xu	System-wide energy minimization for real-time tasks: Lower bound and approximation.	ACM Trans. Embedded Comput. Syst.	2008	DBLP DOI BibTeX RDF	Real-Time systems, dynamic voltage scaling, dynamic power management, power-aware scheduling
2	Albert Guillen i Fabregas, Emanuele Viterbo	Sphere Lower Bound for Rotated Lattice Constellations in Fading Channels.	IEEE Transactions on Wireless Communications	2008	DBLP DOI BibTeX RDF
2	Eran Nevo	Rigidity and the Lower Bound Theorem for Doubly Cohen-Macaulay Complexes.	Discrete & Computational Geometry	2008	DBLP DOI BibTeX RDF
2	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 Journal on Selected Areas in Communications	2008	DBLP DOI BibTeX RDF
2	Teresa Laudadio, Nicola Mastronardi, Marc Van Barel	Computing a Lower Bound of the Smallest Eigenvalue of a Symmetric Positive-Definite Toeplitz Matrix.	IEEE Transactions on Information Theory	2008	DBLP DOI BibTeX RDF
2	Denis S. Krotov, Sergey V. Avgustinovich	On the Number of 1-Perfect Binary Codes: A Lower Bound.	IEEE Transactions on Information Theory	2008	DBLP DOI BibTeX RDF
2	Sihem Mesnager	Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity.	IEEE Transactions on Information Theory	2008	DBLP DOI BibTeX RDF
2	J. Andrew Johnson, Mark L. Fowler	Cramer-Rao lower bound on doppler frequency of coherent pulse trains.	ICASSP	2008	DBLP DOI BibTeX RDF
2	Koby Todros, Joseph Tabrikian	A new lower bound on the mean-square error of unbiased estimators.	ICASSP	2008	DBLP DOI BibTeX RDF
2	Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan	A tight lower bound for parity in noisy communication networks.	SODA	2008	DBLP DOI BibTeX RDF
2	Yubin Shao, Jinhong Yuan	A Lower Bound to the Sum-Rate of MIMO Broadcast Channels with Limited-Rate Feedback.	ICC	2008	DBLP DOI BibTeX RDF
2	Anthony S. Acampora, Louisa Pui Sum Ip	A Lower Bound on the Capacity of Wireless Ad Hoc Networks with Cooperating Nodes.	ADHOC-NOW	2008	DBLP DOI BibTeX RDF	Capacity Bounds, Ad Hoc Networks, Wireless Networks, Cooperation, Peer to Peer Networks, Routing Algorithm, Spatial Diversity
2	Iftach Haitner, Jonathan J. Hoch, Gil Segev	A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.	TCC	2008	DBLP DOI BibTeX RDF
2	Tianping Shuai, Donglei Du	A Lower Bound for the On-Line Preemptive Machine Scheduling with lp.	COCOON	2008	DBLP DOI BibTeX RDF
2	Tomás Ebenlendr, Jiri Sgall	A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines.	WAOA	2008	DBLP DOI BibTeX RDF
2	Thotsaphon Thongjunthug	Computing a Lower Bound for the Canonical Height on Elliptic Curves over Totally Real Number Fields.	ANTS	2008	DBLP DOI BibTeX RDF
2	Adam Roman, Wit Forys	Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata.	SOFSEM	2008	DBLP DOI BibTeX RDF
2	Jin-yi Cai, Xi Chen, Dong Li	A quadratic lower bound for the permanent and determinant problem over any characteristic != 2.	STOC	2008	DBLP DOI BibTeX RDF	arithmetic complexity, finite field, determinant, permanent
2	Rachid Guerraoui, Michal Kapalka	On the correctness of transactional memory.	PPOPP	2008	DBLP DOI BibTeX RDF	model, lower bound, transactional memory, correctness
2	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
2	Hagit Attiya, Keren Censor	Tight bounds for asynchronous randomized consensus.	J. ACM	2008	DBLP DOI BibTeX RDF	Distributed computing, lower bound, randomized algorithms, shared-memory, isoperimetric inequality
2	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
2	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
2	Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster	Treewidth Lower Bounds with Brambles.	Algorithmica	2008	DBLP DOI BibTeX RDF	Bramble, Grid minor, Approximation algorithm, Lower bound, Planar graph, Treewidth
2	Ronald Armstrong, Su Gao, Lei Lei	A zero-inventory production and distribution problem with a fixed customer sequence.	Annals OR	2008	DBLP DOI BibTeX RDF	Zero-inventory production and distribution problem, Product lifespan, Branch and bound search procedure, Heuristic lower bound, Time windows
2	Teresa Alsinet, Felip Manyà, Jordi Planes	An efficient solver for weighted Max-SAT.	J. Global Optimization	2008	DBLP DOI BibTeX RDF	Weighted Branch and bound, Data structures, Heuristics, Lower bound, Max-SAT
2	Firouz Behnamfar, Fady Alajaji, Tamás Linder	An Efficient Algorithmic Lower Bound for the Error Rate of Linear Block Codes.	IEEE Transactions on Communications	2007	DBLP DOI BibTeX RDF
2	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
2	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
2	Khoa D. Nguyen, Albert Guillen i Fabregas, Lars K. Rasmussen	A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels.	IEEE Transactions on Information Theory	2007	DBLP DOI BibTeX RDF
2	George Christodoulou, Elias Koutsoupias, Angelina Vidali	A lower bound for scheduling mechanisms.	SODA	2007	DBLP DOI BibTeX RDF
2	Ashley Montanaro, Andreas Winter	A Lower Bound on Entanglement-Assisted Quantum Communication Complexity.	ICALP	2007	DBLP DOI BibTeX RDF
2	Xin Li, Tian Liu, Han Peng, Liyan Qian, Hongtao Sun, Jin Xu, Ke Xu, Jiaqi Zhu	Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model.	TAMC	2007	DBLP DOI BibTeX RDF
2	Mi Zhou, Man Hon Wong	Boundary-Based Lower-Bound Functions for Dynamic Time Warping and Their Indexing.	ICDE	2007	DBLP DOI BibTeX RDF
2	Elias Koutsoupias, Angelina Vidali	A Lower Bound of 1+phi for Truthful Scheduling Mechanisms.	MFCS	2007	DBLP DOI BibTeX RDF
2	Yu Dong, Wing-Kai Hon, David K. Y. Yau, Jren-Chit Chin	Distance Reduction in Mobile Wireless Communication: Lower Bound Analysis and Practical Attainment.	MASCOTS	2007	DBLP DOI BibTeX RDF
2	Danyu Bai, Lixin Tang	Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem.	COCOA	2007	DBLP DOI BibTeX RDF	Flow shop weighted completion time problem, WSPT rule, Asymptotic analysis, Worst case analysis
2	Jianxin Wang, Min Huang, Jianer Chen	A Lower Bound on Approximation Algorithms for the Closest Substring Problem.	COCOA	2007	DBLP DOI BibTeX RDF
2	J. M. van den Akker, Guido Diepen, J. A. Hoogeveen	A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems.	CPAIOR	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (Revision 1991) 90B35
2	Yufeng Wu, Dan Gusfield	A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem.	COCOON	2007	DBLP DOI BibTeX RDF
2	Adam R. Klivans, Alexander A. Sherstov	A Lower Bound for Agnostically Learning Disjunctions.	COLT	2007	DBLP DOI BibTeX RDF
2	Ran Raz, Amir Shpilka, Amir Yehudayoff	A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits.	FOCS	2007	DBLP DOI BibTeX RDF
2	Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev	Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.	FOCS	2007	DBLP DOI BibTeX RDF
2	Emanuele Viola, Avi Wigderson	One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications.	FOCS	2007	DBLP DOI BibTeX RDF
2	Martin Farach-Colton, Miguel A. Mosteiro	Sensor Network Gossiping or How to Break the Broadcast Lower Bound.	ISAAC	2007	DBLP DOI BibTeX RDF
2	Anca Muscholl, Igor Walukiewicz	A Lower Bound on Web Services Composition.	FoSSaCS	2007	DBLP DOI BibTeX RDF	Automata simulation, complexity, web services composition
2	Kei Uchizawa, Eiji Takimoto	An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity.	IEEE Conference on Computational Complexity	2007	DBLP DOI BibTeX RDF
2	Xiaolong Huang, Izhak Rubin	Capacity and energy aware activation of sensor nodes for area phenomenon using wireless network transport.	IWCMC	2007	DBLP DOI BibTeX RDF	distortion lower bound, wireless sensor network, heuristic algorithm, rate allocation, sensor selection
2	Hagit Attiya, Faith Ellen, Panagiota Fatourou	The complexity of updating multi-writer snapshot objects.	PODC	2007	DBLP DOI BibTeX RDF	distributed computing, lower bound, shared memory, update, snapshot
2	George Giakkoupis, Vassos Hadzilacos	On the complexity of greedy routing in ring-based peer-to-peer networks.	PODC	2007	DBLP DOI BibTeX RDF	peer-to-peer, lower bound, coupling, random graphs, small-worlds, greedy routing
2	Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari	Optimal sparse matrix dense vector multiplication in the I/O-model.	SPAA	2007	DBLP DOI BibTeX RDF	I/O-model, sparse matrix dense vector multiplication, lower bound, external memory algorithms
2	Hagit Attiya, Keren Censor	Tight bounds for asynchronous randomized consensus.	STOC	2007	DBLP DOI BibTeX RDF	distributed computing, lower bound, randomized algorithms, shared-memory, isoperimetric inequality