The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase lower bounds (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1958-1970 (16) 1971-1974 (24) 1975-1976 (17) 1977-1978 (18) 1979 (16) 1980-1981 (22) 1982-1983 (35) 1984 (16) 1985 (28) 1986 (29) 1987 (38) 1988 (46) 1989 (52) 1990 (56) 1991 (67) 1992 (70) 1993 (77) 1994 (118) 1995 (115) 1996 (97) 1997 (110) 1998 (150) 1999 (142) 2000 (138) 2001 (197) 2002 (194) 2003 (251) 2004 (277) 2005 (321) 2006 (376) 2007 (371) 2008 (424) 2009 (334) 2010 (192) 2011 (166) 2012 (165) 2013 (206) 2014 (186) 2015 (214) 2016 (278) 2017 (250) 2018 (249) 2019 (69)
Publication types (Num. hits)
article(3029) incollection(20) inproceedings(3142) phdthesis(25) proceedings(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 3587 occurrences of 1791 keywords

Results
Found 6217 publication records. Showing 6217 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
78Michal Hospodár, Galina Jirásková, Peter Mlynárcik A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
74Ran Raz Tensor-rank and lower bounds for arithmetic formulas. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF homogenous circuits, multilinear circuits, tensor rank, lower bounds, arithmetic circuits
72Amir M. Ben-Amram, Zvi Galil Lower Bounds for Dynamic Data Structures on Algebraic RAMs. Search on Bibsonomy Algorithmica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Cell-probe lower bounds, Dynamic prefix sum, Union-find, Random access machine
72Monika Rauch Henzinger, Michael L. Fredman Lower Bounds for Fully Dynamic Connectivity Problems in Graphs. Search on Bibsonomy Algorithmica The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Dynamic planarity testing, Dynamic connectivity testing, Dynamic planarity testing, Dynamic connectivity testing, Lower bounds, Lower bounds, Key words, Cell probe model, Cell probe model
71Amit Chakrabarti, Graham Cormode, Andrew McGregor 0001 Robust lower bounds for communication and stream computation. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF lower bounds, data streams, communication complexity
69Pavel Hrubes, Avi Wigderson, Amir Yehudayoff Non-commutative circuits and the sum-of-squares problem. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF lower bounds, algebraic complexity
69Ziv Bar-Yossef Sampling lower bounds via information theory. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF lower bounds, query complexity, Jensen-Shannon divergence
66Rüdiger Ebendt, Rolf Drechsler Effect of improved lower bounds in dynamic BDD reordering. Search on Bibsonomy IEEE Trans. on CAD of Integrated Circuits and Systems The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
66Rüdiger Ebendt, Rolf Drechsler Lower bounds for dynamic BDD reordering. Search on Bibsonomy ASP-DAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
65Marco A. Boschetti, Aristide Mingozzi The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Lower Bounds, Combinatorial Optimization, Cutting and Packing
65Hans-Joachim Böckenhauer, Dennis Komm, Walter Unger (eds.) Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Tom Verhoeff A Master Class on Recursion. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65David Harel, Assaf Marron Toward Scenario-Based Algorithmics. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Christos A. Kapoutsis Optimal 2DFA Algorithms for One-Way Liveness on Two and Three Symbols. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Georg Schnitger Probabilism versus Alternation for Automata. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Josep Fàbrega, Xavier Muñoz Online Matching in Regular Bipartite Graphs with Randomized Adversary. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Marios Mavronicolas, Burkhard Monien NP NP -Hardness of Equilibria in Case of Risk-Averse Players. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Takashi Okumura, Koichi Wada, Yoshiaki Katayama Rendezvous of Asynchronous Mobile Robots with Lights. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Joan Boyar, Lene M. Favrholdt, Kim S. Larsen Relative Worst-Order Analysis: A Survey. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Arto Salomaa Parikh Matrices: Subword Indicators and Degrees of Ambiguity. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Martin Dietzfelbinger Universal Hashing via Integer Arithmetic Without Primes, Revisited. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller What Is Known About Vertex Cover Kernelization? Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Farid M. Ablayev, Marat Ablayev, Kamil Khadiev, Alexander Vasiliev Classical and Quantum Computations with Restricted Memory. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Michael R. Fellows, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza A Survey on the Complexity of Flood-Filling Games. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Lane A. Hemaspaandra That Most Important Intersection. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Jens Gallenbacher The Adventure of Computer Science - Understanding the Impact of Informatics on General Education and Designing the Living Environment. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Christos H. Papadimitriou About Place Cells and Grid Cells - About Place Cells and Grid Cells. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Ulrik Schroeder, Nadine Bergner, Thiemo Leonhardt Paving the Way for Computer Science in German Schools. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Branislav Rovan, Simon Sádovský On Usefulness of Information: Framework and NFA Case. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Shogo Ehara, Kazuo Iwama, Junichi Teruyama Small Complexity Gaps for Comparison-Based Sorting. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Walter Gander Infinity and Finite Arithmetic. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Annalisa D'Andrea, Luca Forlizzi, Guido Proietti Stability of Reapproximation Algorithms for the \beta β -Metric Traveling Salesman (Path) Problem. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Ralf Klasing, Tobias Mömke A Modern View on Stability of Approximation. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Elisabet Burjons, Fabian Frei, Jasmin Smula, David Wehner Length-Weighted Disjoint Path Allocation - Advice and Parametrization. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Joss Miller-Todd, Kathleen Steinhöfel, Patrick Veenstra Firefly-Inspired Algorithm for Job Shop Scheduling. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Valentina Dagiene Resurgence of Informatics Education in Schools - A Way to a Deeper Understanding of Informatics Concepts. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer Sequence Hypergraphs: Paths, Flows, and Cuts. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Tim Bell, Jan Vahrenhold CS Unplugged - How Is It Used, and Does It Work? Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Peter Rossmanith On the Advice Complexity of Online Edge- and Node-Deletion Problems. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Juhani Karhumäki, Markus A. Whiteland Regularity of k-Abelian Equivalence Classes of Fixed Cardinality. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Anna Zych-Pawlewicz Reoptimization of NP-Hard Problems. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Jetty Kleijn, Maciej Koutny, Lukasz Mikulski, Grzegorz Rozenberg Reaction Systems, Transition Systems, and Equivalences. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Hans-Joachim Böckenhauer, Lucia Di Caro, Walter Unger Fully Online Matching with Advice on General Bipartite Graphs and Paths. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Stefan Wolf Second Thoughts on the Second Law. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Pavol Duris, Rafael Korbas, Rastislav Královic, Richard Královic Determinism and Nondeterminism in Finite Automata with Advice. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
65Björn Feldkord, Manuel Malatyali, Friedhelm Meyer auf der Heide A Dynamic Distributed Data Structure for Top-k and k-Select Queries. Search on Bibsonomy Adventures Between Lower Bounds and Higher Altitudes The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
62Anna Gál, Adi Rosén Lower bounds on the amount of randomness in private computation. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF lower bounds, randomness, private computation
62Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen Lower Bounds for Dynamic Algebraic Problems. Search on Bibsonomy STACS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
61Mihai Patrascu Lower bounds for 2-dimensional range counting. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF cell-probe complexity, orthogonal range queries, lower bounds
59Daniel J. Rosenkrantz, Lin Yu, S. S. Ravi Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times. Search on Bibsonomy Algorithmica The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Cell-probe lower bounds, Dynamic prefix sum, Union-find, Random access machine
59Ran Raz Elusive functions and lower bounds for arithmetic circuits. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF bounded depth circuits, lower bounds, arithmetic circuits, circuit complexity
59Anna Gál A characterization of span program size and improved lower bounds for monotone span programs. Search on Bibsonomy Computational Complexity The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Span programs, Boolean formula size, secret sharing..¶ Subject classification. 68Q15, lower bounds, 94C10
58Sunil Arya, David M. Mount, Jian Xia Tight lower bounds for halfspace range searching. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2010 DBLP  DOI  BibTeX  RDF lower bounds, range searching, idempotence
57Paul Beame, Erik Vee Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
56Christer Berg, Staffan Ulfberg Symmetric Approximation Arguments for Monotone Lower Bounds Without Sunflowers. Search on Bibsonomy Computational Complexity The full citation details ... 1999 DBLP  DOI  BibTeX  RDF lower bounds, Circuit complexity, monotone circuits
55Troy Lee, Adi Shraibman Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF multiparty communication complexity, disjointness, lower bounds
55Satyanarayana V. Lokam Graph Complexity and Slice Functions. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
55Peter Bürgisser, Martin Lotz Lower bounds on the bounded coefficient complexity of bilinear maps. Search on Bibsonomy J. ACM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF bilinear circuits, lower bounds, Algebraic complexity, singular values
55Vineet Bafna, Vikas Bansal The Number of Recombination Events in a Sample History: Conflict Graph and Lower Bounds. Search on Bibsonomy IEEE/ACM Trans. Comput. Biology Bioinform. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF ancestral recombination graph, lower bounds, NP-completeness, Recombination, haplotypes, conflict graph, phylogenetic networks
55Leah Epstein Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines. Search on Bibsonomy APPROX The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
55Daiyuan Peng, Pingzhi Fan, Moon Ho Lee Lower bounds on the periodic Hamming correlations of frequency hopping sequences with low hit zone. Search on Bibsonomy Science in China Series F: Information Sciences The full citation details ... 2006 DBLP  DOI  BibTeX  RDF frequency hopping sequences, Hamming correlation, Lempel-Greenberger bounds, low hit zone, no hit zone, lower bounds
55Rahul Santhanam Circuit lower bounds for Merlin-Arthur classes. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Merlin-Arthur games, average-case lower bounds, circuit lower bounds, advice, pseudo-random generators
55Paul Beame, Toniann Pitassi Simplified and Improved Resolution Lower Bounds. Search on Bibsonomy FOCS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF resolution lower bounds, randomly generated formulas, random formulas, randomly chosen 3-CNF formula, lower bounds, computability, pigeonhole principle
54Sudipto Guha, Andrew McGregor 0001 Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination. Search on Bibsonomy ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
54Mihai Patrascu, Erik D. Demaine Lower bounds for dynamic connectivity. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF cell-probe complexity, dynamic connectivity, dynamic graph problems, lower bounds for data structures, partial sums problem
54Sunil Arya, Theocharis Malamatos, David M. Mount On the importance of idempotence. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF approximation algorithms, range searching, idempotence
54Rosario Gennaro, Yael Gertner, Jonathan Katz Lower bounds on the efficiency of encryption and digital signature schemes. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF lower bounds, digital signatures, encryption, black-box
54Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings. Search on Bibsonomy J. ACM The full citation details ... 1994 DBLP  DOI  BibTeX  RDF Solitude Verification, anonymous ring, asynchronous unidirectional ring, bit complexity, lower bounds, nondeterminism, Leader Election
54Adam R. Klivans, Alexander A. Sherstov Unconditional lower bounds for learning intersections of halfspaces. Search on Bibsonomy Machine Learning 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
53Alexander A. Sherstov The pattern matrix method for lower bounds on quantum communication. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF approximate degree of boolean functions, bounded-error communication, quantum communication complexity, lower bounds
53Lance Fortnow, Richard J. Lipton, Dieter van Melkebeek, Anastasios Viglas Time-space lower bounds for satisfiability. Search on Bibsonomy J. ACM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Complexity of satisfiability, time-space lower bounds
53Valentine Kabanets, Russell Impagliazzo Derandomizing polynomial identity tests means proving circuit lower bounds. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF BPP, NEXP, circuit lower bounds, derandomization, polynomial identity testing
53Stasys Jukna Finite Limits and Monotone Computations: The Lower Bounds Criterion. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1997 DBLP  DOI  BibTeX  RDF real gates, lower bounds, threshold gates, monotone circuits
52R. N. Uma, Joel Wein On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems. Search on Bibsonomy IPCO The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
52Shengyu Zhang On the Power of Ambainis's Lower Bounds. Search on Bibsonomy ICALP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
51M. Narasimhan, J. Ramanujam On lower bounds for scheduling problems in high-level synthesis. Search on Bibsonomy DAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
51Paul Beame, T. S. Jayram, Atri Rudra Lower bounds for randomized read/write stream algorithms. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF communication complexity, data stream algorithms
51Vineet Bafna, Vikas Bansal Improved Recombination Lower Bounds for Haplotype Data. Search on Bibsonomy RECOMB The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
50Maurice J. Jansen, Kenneth W. Regan "Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas. Search on Bibsonomy COCOON The full citation details ... 2007 DBLP  DOI  BibTeX  RDF constant depth formulas, Computational complexity, lower bounds, arithmetical circuits, partial derivatives
49Krishnamurthy Dvijotham, Soumen Chakrabarti, Subhasis Chaudhuri New closed-form bounds on the partition function. Search on Bibsonomy Machine Learning The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Associative potential, Graphical model, Variational methods, Belief propagation, Partition function, Approximate inference
49Ryan O'Donnell, Rocco A. Servedio New degree bounds for polynomial threshold functions. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF ptfs, learning, lower bounds, polynomials, duality, degree, formulas, polynomial threshold functions
49Jingsen Chen Average Cost to Produce Partial Orders. Search on Bibsonomy ISAAC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
49Eric Allender, Michal Koucký Amplifying Lower Bounds by Means of Self-Reducibility. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF self-reducibility, lower bounds, circuit complexity
48Mihai Patrascu, Mikkel Thorup Time-space trade-offs for predecessor search. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF cell-probe complexity, predecessor search, lower bounds
48Scott 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
47Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender Degree-Based Treewidth Lower Bounds. Search on Bibsonomy WEA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
47F. D. Garber, Abdelhamid Djouadi Bounds on the Bayes Classification Error Based on Pairwise Risk Functions. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF Bayes classification error, pairwise risk functions, composite-hypothesis classification, pairwise Bayes risk, pattern recognition, pattern recognition, lower bounds, upper bounds, decision theory, Bayes methods, error statistics
46Mihai Patrascu Towards polynomial lower bounds for dynamic problems. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF 3SUM, lower bounds, dynamic data structures
46Dino Ahr, Gerhard Reinelt New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem. Search on Bibsonomy ESA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Min-Max Optimization, Heuristics, Lower Bounds, Chinese Postman Problem, Arc Routing
46Roberto Montemanni, D. H. Smith, Stuart M. Allen Lower Bounds for Fixed Spectrum Frequency Assignment. Search on Bibsonomy Annals OR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF radio frequency assignment, fixed spectrum problems, lower bounds
46Ueli M. Maurer, Stefan Wolf 0001 Lower Bounds on Generic Algorithms in Groups. Search on Bibsonomy EUROCRYPT The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Diffie-Hellman protocol, roots in finite groups, complexity, lower bounds, discrete logarithms, generic algorithms
46Sieteng Soh, Suresh Rai, Jerry L. Trahan Improved Lower Bounds on the Reliability of Hypercube Architectures. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF Boolean n-cube, structural-reliability models, tighter bounds, time O(n/sup 2/), reliability bounds, computational complexity, reliability, reliability, parallel architectures, lower bounds, fault tolerant computing, hypercube, hypercube networks, spanning trees, network reliability, node failure, path generation, hypercube topology, terminal reliability, hypercube architecture
46Christine Rüb Lower Bounds for Merging on the Hypercube. Search on Bibsonomy CIAC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF Lower bounds, Hypercube, Sorting, Merging
46Zoya Svitkina, Lisa Fleischer Submodular Approximation: Sampling-based Algorithms and Lower Bounds. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
46Amit Chakrabarti Lower Bounds for Multi-Player Pointer Jumping. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
46Mihai Patrascu, Mikkel Thorup Higher Lower Bounds for Near-Neighbor and Further Rich Problems. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
46Amir Shpilka Affine Projections of Symmetric Polynomials. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
46Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams Optimization of Information Rate Upper and Lower Bounds for Channels With Memory. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
46Norbert Sensen Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows. Search on Bibsonomy ESA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
46Yehuda Lindell Lower Bounds and Impossibility Results for Concurrent Self Composition. Search on Bibsonomy J. Cryptology 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
Displaying result #1 - #100 of 6217 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license