The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Conjecture with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1946-1972 (17) 1973-1975 (16) 1976-1977 (19) 1978-1979 (28) 1980 (18) 1981-1982 (30) 1983 (22) 1984-1985 (39) 1986 (27) 1987 (17) 1988 (21) 1989 (38) 1990 (32) 1991 (32) 1992 (55) 1993 (45) 1994 (50) 1995 (58) 1996 (81) 1997 (53) 1998 (98) 1999 (93) 2000 (96) 2001 (140) 2002 (144) 2003 (151) 2004 (170) 2005 (206) 2006 (261) 2007 (226) 2008 (256) 2009 (254) 2010 (152) 2011 (133) 2012 (157) 2013 (168) 2014 (141) 2015 (147) 2016 (170) 2017 (174) 2018 (174) 2019 (191) 2020 (171) 2021 (213) 2022 (197) 2023 (179) 2024 (49)
Publication types (Num. hits)
article(3702) book(2) data(1) incollection(26) inproceedings(1469) phdthesis(9)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1371 occurrences of 990 keywords

Results
Found 5209 publication records. Showing 5209 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
74Ken-ichi Kawarabayashi, Bruce A. Reed Hadwiger's conjecture is decidable. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Hadwiger's conjecture, the four color theorem
64Jeff Kahn 0001, Michael E. Saks, Cliff Smyth 0001 A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture. Search on Bibsonomy CCC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Reimer's inequality, van den Berg-Kesten conjecture, Rudich's conjecture
60Angelo Monti, Paolo Penna, Riccardo Silvestri An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Caccetta-Häggkvist conjecture, online load balancing, competitive analysis
57Marcin Peczarski The Gold Partition Conjecture for 6-Thin Posets. Search on Bibsonomy Order The full citation details ... 2008 DBLP  DOI  BibTeX  RDF 1/3-2/3 conjecture, Gold partition conjecture, Poset, Linear extension
57Miklós Ajtai A conjecture about polynomial time computable lattice-lattice functions. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF axiom of choice, algorithm, lattice
54Naoki Katoh, Shin-ichi Tanigawa A proof of the molecular conjecture. Search on Bibsonomy SCG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF bar-and-joint frameworks, body-and-hinge frameworks, edge-disjoint spanning trees, the molecular conjecture, rigidity
54Bill Jackson, Tibor Jordán Pin-Collinear Body-and-Pin Frameworks and the Molecular Conjecture. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Rigidity of frameworks, Body-and-hinge frameworks, Bar-and-joint frameworks, Molecular Conjecture
54Marcin Peczarski The Gold Partition Conjecture. Search on Bibsonomy Order The full citation details ... 2006 DBLP  DOI  BibTeX  RDF poset, linear extension, conjecture
54Wen-tsun Wu On Wintner's Conjecture About Central Configurations. Search on Bibsonomy IWMM/GIAE The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Celestial Mechanics, Central Configurations, Wintner’s Conjecture, Extremal Zeroes, Finite Kernel Theorem, Extremal Values
53Subhash Khot On the power of unique 2-prover 1-round games. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
53Subhash Khot On the Power of Unique 2-Prover 1-Round Games. Search on Bibsonomy CCC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF 2-prover games, Hardness of approximation, probabilistically checkable proofs
53Ian Agol, Joel Hass, William P. Thurston 3-MANIFOLD KNOT GENUS is NP-complete. Search on Bibsonomy CCC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF 2-prover games, Hardness of approximation, probabilistically checkable proofs
50Tien-Yien Li, Xiaoshen Wang Counterexamples to the Connectivity Conjecture of the Mixed Cells. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
50Ken-ichi Kawarabayashi, Bojan Mohar Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Hadwiger conjecture, odd-minor, graph coloring, graph minor, list coloring
47Gábor Czédli, Miklós Maróti, E. Tamás Schmidt On the Scope of Averaging for Frankl's Conjecture. Search on Bibsonomy Order The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Union-closed sets, Frankl’s conjecture, Lattice
47Blagovest Sendov Geometry of Polynomials and Numerical Analysis. Search on Bibsonomy Numerical Methods and Application The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Geometry of polynomials, Gauss-Lucas Theorem, zeros of polynomials, Smale's Conjecture, Sendov's Conjecture, Mathematics Subject Classification: 30C10, critical points
46Qi Cheng 0001 Straight-line programs and torsion points on elliptic curves. Search on Bibsonomy Comput. Complex. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000). 14H52, 68Q17
46Albert Atserias, Phokion G. Kolaitis First-Order Logic vs. Fixed-Point Logic in Finite Set Theory. Search on Bibsonomy LICS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
44Antoine Deza, Tamás Terlaky, Yuriy Zinchenko A Continuous d -Step Conjecture for Polytopes. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Hirsch conjecture, d-Step conjecture, Diameter, Curvature, Polytopes, Central path
44Yih-En Andrew Ban, Sergey Bereg, Nabil H. Mustafa A Conjecture on Wiener Indices in Combinatorial Chemistry. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Wiener index, Combinatorial chemistry, Graph theory, Matrix searching
44Qi Cheng 0001 Some Remarks on the L-Conjecture. Search on Bibsonomy ISAAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
44Jean-Marc Deshouillers, Herman te Riele, Yannick Saouter New Experimental Results Concerning the Goldbach Conjecture. Search on Bibsonomy ANTS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
43Anup Rao 0001 Parallel repetition in projection games and a concentration bound. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF chsh game, parallel repetition, unique games conjecture
40Feliu Sagols, Raúl Marín The Inscribed Square Conjecture in the Digital Plane. Search on Bibsonomy IWCIA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Inscribed Square Conjecture, Jordan Curve Theorem, simple closed digital curves, digital topology
40Antoine Deza, Gabriel Indik A counterexample to the dominating set conjecture. Search on Bibsonomy Optim. Lett. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Dominating set conjecture, Metric polyhedra, Cut polyhedra
40Ken-ichi Kawarabayashi, Bjarne Toft Any 7-Chromatic Graphs Has K7 Or K4, 4 As A Minor. Search on Bibsonomy Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C15, 05C83
40Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? Search on Bibsonomy FOCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
37Naoki Katoh A Proof of the Molecular Conjecture. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Rainer Feldmann, Marios Mavronicolas, Andreas Pieris Facets of the Fully Mixed Nash Equilibrium Conjecture. Search on Bibsonomy SAGT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
37Navin Goyal, Neil Olver, F. Bruce Shepherd The vpn conjecture is true. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF network design, robust optimization, oblivious routing
37Shachar Lovett, Roy Meshulam, Alex Samorodnitsky Inverse conjecture for the gowers norm is false. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF gowers norm, multivariate polynomials, low degree tests
37J. C. Lagarias 0001 Bounds for Local Density of Sphere Packings and the Kepler Conjecture. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
37Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Bidimensionality, Wagner’s conjecture, Graph algorithms, Treewidth, Graph minors, Grid graphs
37Raman Sanyal, Axel Werner, Günter M. Ziegler On Kalai's Conjectures Concerning Centrally Symmetric Polytopes. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Centrally symmetric convex polytopes, f-vector inequalities, Flag vectors, Kalai’s 3 d -conjecture, Equivariant rigidity, Hanner polytopes, Hansen polytopes, Central hypersimplices
37Irit Dinur, Elchanan Mossel, Oded Regev 0001 Conditional hardness for approximate coloring. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF graph coloring, hardness of approximation, unique games conjecture
34Tero Harju, Dirk Nowotka Periodicity and unbordered words: A proof of the extended duval conjecture. Search on Bibsonomy J. ACM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Duval's conjecture, unbordered words, periodicity, Combinatorics on words
34Jacob Katzenelson, Shlomit S. Pinter, Eugen Schenfeld Type Matching, Type-Graphs, and the Schanuel Conjecture. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF Schanuel conjecture, graph hashing, mapping graphs to numbers, type matching, compilers, types, type-graphs
33T. Birsan, Dan Tiba One Hundred Years Since the Introduction of the Set Distance by Dimitrie Pompeiu. Search on Bibsonomy System Modelling and Optimization The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Hausdorff-Pompeiu distance, Pompeiu functions, Pompeiu conjecture, Schiffer conjecture, Hausdorff distance
33Tung-Ho Lin, Fan-Tien Cheng, Aeo-Juo Ye, Wei-Ming Wu, Min-Hsiung Hung A novel key-variable sifting algorithm for virtual metrology. Search on Bibsonomy ICRA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
33Micah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert D. Kleinberg, April Rasala Lehman On the capacity of information networks. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
33Stefan Andrei, Manfred Kudlek, Radu Stefan Niculescu Some results on the Collatz problem. Search on Bibsonomy Acta Informatica The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
33Alexei P. Stolboushkin, Michael A. Taitslin Normalizable linear orders and generic computations in finite models. Search on Bibsonomy Arch. Math. Log. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
33Thomas C. Hales Sphere Packings, I. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
30Asaf Shapira Green's conjecture and testing linear-invariant properties. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF hypergraphs removal lemma, boolean functions, property testing
30Julia Böttcher, Mathias Schacht, Anusch Taraz On the bandwidth conjecture for 3-colourable graphs. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
30Tadej Kotnik, Herman te Riele The Mertens Conjecture Revisited. Search on Bibsonomy ANTS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
30Subhash Khot, Nisheeth K. Vishnoi The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1. Search on Bibsonomy FOCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
30Christos H. Papadimitriou, David Ratajczak On a Conjecture Related to Geometric Routing. Search on Bibsonomy ALGOSENSORS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
30Sinisa T. Vrecica Tverberg's Conjecture. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
30Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. Mustafa On a Conjecture on Wiener Indices in Combinatorial Chemistry. Search on Bibsonomy COCOON The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
30Daniel Richardson The Uniformity Conjecture. Search on Bibsonomy CCA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
30Fred B. Holt, Victor Klee Counterexamples to the Strong d -Step Conjecture for d ge 5. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
30J. C. Lagarias 0001, Nagabhushana Prabhu, James A. Reeds The d-Step Conjecture and Gaussian Elimination. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
30Harry Buhrman, Montserrat Hermo On the Sparse Set Conjecture for Sets with Low Denisty. Search on Bibsonomy STACS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
30Jamil Baddoura A Conjecture on Integration in Finite Terms with Elementary Functions and Polylogarithms. Search on Bibsonomy ISSAC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
30Nader H. Bshouty On the Direct Sum Conjecture in the Straight Line Model. Search on Bibsonomy ESA The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
30Karel Culík II On Test Sets and the Ehrenfeucht Conjecture. Search on Bibsonomy ICALP The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
30Scott Aaronson BQP and the polynomial hierarchy. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF linial-nisan conjecture, quantum complexity classes, fourier analysis, constant-depth circuits
30Avraham Trakhtman Some Aspects of Synchronization of DFA. Search on Bibsonomy J. Comput. Sci. Technol. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF deterministic finite automata (DFA), aperiodic semigroup, ?erný conjecture, synchronization
30Prasad Raghavendra Optimal algorithms and inapproximability results for every CSP? Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF dictatorship tests, rounding schemes, semidefinite programming, constraint satisfaction problem, unique games conjecture
30Daniel Richardson Zero Tests for Constants in Simple Scientific Computation. Search on Bibsonomy Math. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Exp-Log constants, zero test, Schanuel conjecture
30Takashi Matsuhisa Communication Leading to Nash Equilibrium Through Robust Messages - S5 -Knowledge Model Case -. Search on Bibsonomy COCOA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Robust message, Non-corporative game, S5-knowledge model, Communication, Protocol, Nash equilibrium, Conjecture
30S. M. Nazrul Alam, Zygmunt J. Haas Coverage and connectivity in three-dimensional networks. Search on Bibsonomy MobiCom The full citation details ... 2006 DBLP  DOI  BibTeX  RDF 3D networks, Kelvin's conjecture, hexagonal prism, rhombic dodecahedron, three-dimensional networks, truncated octahedron, wireless networks, connectivity, coverage, polyhedron, underwater networks
30Takashi Matsuhisa, Paul Strokan Bayesian Communication Leading to a Nash Equilibrium in Belief. Search on Bibsonomy WINE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF p-Belief system, Bayesian communication, Non-corporative game, Protocol, Nash equilibrium, Conjecture
30Takashi Matsuhisa Communication Leading to Nash Equilibrium without Acyclic Condition (S4-Knowledge Model Case). Search on Bibsonomy International Conference on Computational Science The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Modal logic S4, Mutual learning, Non-corporative game, Communication, Protocol, Nash equilibrium, Knowledge, Information, Conjecture
30Takashi Matsuhisa p-Belief Communication Leading to a Nash Equilibrium. Search on Bibsonomy CIS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF p-Belief system, Non-corporative game, Communication, Protocol, Nash equilibrium, Conjecture
30Josep M. Brunat, Antonio Montes The characteristic ideal of a finite, connected, regular graph. Search on Bibsonomy ISSAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF characteristic ideal, galois graph, polynomial digraph, polynomial graph, strongly polynomial graph, variety of a pairing, pairing, connected component, conjecture
30Olivier Baudon, Guillaume Fertin, Ivan Havel Routing Permutations in the Hypercube. Search on Bibsonomy WG The full citation details ... 1999 DBLP  DOI  BibTeX  RDF routing permutations, Szymanski's conjecture, 2-1 routing requests, Hypercubes
27Rade T. Zivaljevic Combinatorial Groupoids, Cubical Complexes, and the Lovász Conjecture. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Combinatorial groupoids, Lovász conjecture, Discrete differential geometry, Cubical complexes
27Miguel Cárdenas-Montes, Antonio Gómez-Iglesias, Miguel A. Vega-Rodríguez, Enrique Morales-Ramos Exploration of the Conjecture of Bateman Using Particle Swarm Optimisation and Grid Computing. Search on Bibsonomy ISPDC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Conjecture of Bateman, Recreational Mathematics, Particle Swarm Optimisation
27Arnold Beckmann, Martin Goldstern, Norbert Preining Continuous Fraïssé Conjecture. Search on Bibsonomy Order The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Better quasi order, Gödel logic, Wellquasiorder, Fraisse conjecture, Continuous embeddings
27Wolfram Koepf Power series, Bieberbach conjecture and the de Branges and Weinstein functions. Search on Bibsonomy ISSAC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Askey-Gasper inequality, Bieberbach conjecture, FPS algorithm, Sturm sequences, Weinstein functions, algorithmic computation of formal power series, de Branges functions
27Clifford D. Smyth Reimer's inequality and tardos' conjecture. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Reimer's inequality, certificate complexity, correlation inequalities, decision tree complexity, van den Berg-Kesten conjecture
27Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer The Isomorphism Conjecture Fails Relative to a Random Oracle. Search on Bibsonomy J. ACM The full citation details ... 1995 DBLP  DOI  BibTeX  RDF randomness, isomorphism, conjecture
27Jin-yi Cai, D. Sivakumar The Resolution of a Hartmanis Conjecture. Search on Bibsonomy FOCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF Hartmanis conjecture, sparse sets, logspace many-one reductions, sparse hard set, computational complexity
27Anil Kamath, Rajeev Motwani 0001, Krishna V. Palem, Paul G. Spirakis Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture Search on Bibsonomy FOCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF tail bounds, satisfiability threshold conjecture, random allocation, random 3-SAT formulas, randomized algorithms, upper bound, probabilistic analysis, structural property, occupancy
27Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz The Isomorphism Conjecture Holds Relative to an Oracle Search on Bibsonomy FOCS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF symmetric perfect generic sets, isomorphism conjecture, NP completeness, oracle
27Rajamani Sundar Twists, Turns, Cascades, Deque Conjecture, and Scanning Theorem Search on Bibsonomy FOCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF turns, deque conjecture, scanning theorem, inverse Ackerman bound, binary tree, cascades, splay tree
27Ken-ichi Kawarabayashi, Bojan Mohar List-color-critical graphs on a fixed surface. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF critical graphs, surface, list-coloring
27Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura The stable set polytope of quasi-line graphs. Search on Bibsonomy Comb. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 90C57, 90C10
27Thomas C. Hales Sphere Packing, IV. Detailed Bounds. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
27Mario Szegedy The DLT priority sampling is essentially optimal. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF integral formula, priority sampling, subset sum estimate, telescopic sums, network measurement, Internet traffic
27Moses Charikar, Konstantin Makarychev, Yury Makarychev Near-optimal algorithms for unique games. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF unique games, approximation algorithms, semidefinite programming, constraint satisfaction problems
27Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. Search on Bibsonomy IPCO The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
27Elchanan Mossel, Ryan O'Donnell, Krzysztof Oleszkiewicz Noise stability of functions with low in.uences invariance and optimality. Search on Bibsonomy FOCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
27Robert Krauthgamer, James R. Lee The intrinsic dimensionality of graphs. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF growth restricted graphs, low-dimensional, embeddings, graph decomposition, lovasz local lemma, finite metric spaces
27Khaled El Emam, Saïda Benlarbi, Nishith Goel, Walcélio L. Melo, Hakim Lounis, Shesh N. Rai The Optimal Class Size for Object-Oriented Software. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF quality prediction, optimal size, software quality, quality models, object-oriented metrics, software size
27Ron Aharoni, Ron Holzman, Michael Krivelevich, Roy Meshulam Fractional Planks. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
27Miklós Ajtai Random Lattices and a Conjectured 0 - 1 Law about Their Polynomial Time Computable Properties. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
27Károly J. Böröczky About the Error Term for Best Approximation with Respect to the Hausdorff Related Metrics. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
27Thomas C. Hales Sphere packings and generative. Search on Bibsonomy SCG The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
27Howard Straubing Circuit Complexity and the Expressive Power of Generalized First-Order Formulas. Search on Bibsonomy ICALP The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
24Subhas Kumar Ghosh, Koushik Sinha On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs. Search on Bibsonomy FCT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
24Gábor Kun, Mario Szegedy A new line of attack on the dichotomy conjecture. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF term operations, computational complexity, constraint satisfaction problems, fourier analysis, NP, dichotomy
24Xu Xiang On the Minimum Distance Conjecture for Schubert Codes. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
24Maxime Crochemore, Lucian Ilie, Liviu Tinta Towards a Solution to the "Runs" Conjecture. Search on Bibsonomy CPM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
24Philippe Langevin, Gregor Leander, Gary McGuire A Counterexample to a Conjecture of Niho. Search on Bibsonomy IEEE Trans. Inf. Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
24Roman N. Karasev Tverberg's Transversal Conjecture and Analogues of Nonembeddability Theorems for Transversals. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
24Giancarlo Mauri, Mario J. Pérez-Jiménez, Claudio Zandron On a Paun's Conjecture in Membrane Systems. Search on Bibsonomy IWINAC (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
24Károly Bezdek From the Kneser-Poulsen conjecture to ball-polyhedra via Voronoi diagrams. Search on Bibsonomy ISVD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 5209 (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 L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license