|
|
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 |
74 | Ken-ichi Kawarabayashi, Bruce A. Reed |
Hadwiger's conjecture is decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 445-454, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hadwiger's conjecture, the four color theorem |
64 | Jeff 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](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 15th Annual IEEE Conference on Computational Complexity, Florence, Italy, July 4-7, 2000, pp. 98-103, 2000, IEEE Computer Society, 0-7695-0674-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Reimer's inequality, van den Berg-Kesten conjecture, Rudich's conjecture |
60 | Angelo Monti, Paolo Penna, Riccardo Silvestri |
An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, pp. 154-165, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Caccetta-Häggkvist conjecture, online load balancing, competitive analysis |
57 | Marcin Peczarski |
The Gold Partition Conjecture for 6-Thin Posets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 25(2), pp. 91-103, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
1/3-2/3 conjecture, Gold partition conjecture, Poset, Linear extension |
57 | Miklós Ajtai |
A conjecture about polynomial time computable lattice-lattice functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 486-493, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
axiom of choice, algorithm, lattice |
54 | Naoki Katoh, Shin-ichi Tanigawa |
A proof of the molecular conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 296-305, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bar-and-joint frameworks, body-and-hinge frameworks, edge-disjoint spanning trees, the molecular conjecture, rigidity |
54 | Bill Jackson, Tibor Jordán |
Pin-Collinear Body-and-Pin Frameworks and the Molecular Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 40(2), pp. 258-278, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Rigidity of frameworks, Body-and-hinge frameworks, Bar-and-joint frameworks, Molecular Conjecture |
54 | Marcin Peczarski |
The Gold Partition Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 23(1), pp. 89-95, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
poset, linear extension, conjecture |
54 | Wen-tsun Wu |
On Wintner's Conjecture About Central Configurations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWMM/GIAE ![In: Computer Algebra and Geometric Algebra with Applications, 6th International Workshop, IWMM 2004, Shanghai, China, May 19-21, 2004, and International Workshop, GIAE 2004, Xian, China, May 24-28, 2004, Revised Selected Papers, pp. 1-4, 2004, Springer, 3-540-26296-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Celestial Mechanics, Central Configurations, Wintner’s Conjecture, Extremal Zeroes, Finite Kernel Theorem, Extremal Values |
53 | Subhash Khot |
On the power of unique 2-prover 1-round games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 767-775, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
53 | Subhash Khot |
On the Power of Unique 2-Prover 1-Round Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002, pp. 25, 2002, IEEE Computer Society, 0-7695-1468-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
2-prover games, Hardness of approximation, probabilistically checkable proofs |
53 | Ian Agol, Joel Hass, William P. Thurston |
3-MANIFOLD KNOT GENUS is NP-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002, pp. 24, 2002, IEEE Computer Society, 0-7695-1468-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
2-prover games, Hardness of approximation, probabilistically checkable proofs |
50 | Tien-Yien Li, Xiaoshen Wang |
Counterexamples to the Connectivity Conjecture of the Mixed Cells. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 20(4), pp. 515-521, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
50 | Ken-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](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 401-416, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Hadwiger conjecture, odd-minor, graph coloring, graph minor, list coloring |
47 | Gábor Czédli, Miklós Maróti, E. Tamás Schmidt |
On the Scope of Averaging for Frankl's Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 26(1), pp. 31-48, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Union-closed sets, Frankl’s conjecture, Lattice |
47 | Blagovest Sendov |
Geometry of Polynomials and Numerical Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numerical Methods and Application ![In: Numerical Methods and Applications, 5th International Conference, NMA 2002, Borovets, Bulgaria, August 20-24, 2002, Revised Papers, pp. 61-72, 2002, Springer, 3-540-00608-7. The full citation details ...](Pics/full.jpeg) |
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 |
46 | Qi Cheng 0001 |
Straight-line programs and torsion points on elliptic curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 12(3-4), pp. 150-161, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 14H52, 68Q17 |
46 | Albert Atserias, Phokion G. Kolaitis |
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 2-5, 1999, pp. 275-284, 1999, IEEE Computer Society, 0-7695-0158-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
44 | Antoine Deza, Tamás Terlaky, Yuriy Zinchenko |
A Continuous d -Step Conjecture for Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(2), pp. 318-327, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hirsch conjecture, d-Step conjecture, Diameter, Curvature, Polytopes, Central path |
44 | Yih-En Andrew Ban, Sergey Bereg, Nabil H. Mustafa |
A Conjecture on Wiener Indices in Combinatorial Chemistry. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 40(2), pp. 99-117, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Wiener index, Combinatorial chemistry, Graph theory, Matrix searching |
44 | Qi Cheng 0001 |
Some Remarks on the L-Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 128-136, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
44 | Jean-Marc Deshouillers, Herman te Riele, Yannick Saouter |
New Experimental Results Concerning the Goldbach Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANTS ![In: Algorithmic Number Theory, Third International Symposium, ANTS-III, Portland, Oregon, USA, June 21-25, 1998, Proceedings, pp. 204-215, 1998, Springer, 3-540-64657-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
43 | Anup Rao 0001 |
Parallel repetition in projection games and a concentration bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 1-10, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
chsh game, parallel repetition, unique games conjecture |
40 | Feliu Sagols, Raúl Marín |
The Inscribed Square Conjecture in the Digital Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCIA ![In: Combinatorial Image Analysis, 13th International Workshop, IWCIA 2009, Playa del Carmen, Mexico, November 24-27, 2009. Proceedings, pp. 411-424, 2009, Springer, 978-3-642-10208-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Inscribed Square Conjecture, Jordan Curve Theorem, simple closed digital curves, digital topology |
40 | Antoine Deza, Gabriel Indik |
A counterexample to the dominating set conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 1(2), pp. 163-169, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Dominating set conjecture, Metric polyhedra, Cut polyhedra |
40 | Ken-ichi Kawarabayashi, Bjarne Toft |
Any 7-Chromatic Graphs Has K7 Or K4, 4 As A Minor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 25(3), pp. 327-353, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C15, 05C83 |
40 | Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell |
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 146-154, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
37 | Naoki Katoh |
A Proof of the Molecular Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 2-3, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
37 | Rainer Feldmann, Marios Mavronicolas, Andreas Pieris |
Facets of the Fully Mixed Nash Equilibrium Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGT ![In: Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings, pp. 145-157, 2008, Springer, 978-3-540-79308-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
37 | Navin Goyal, Neil Olver, F. Bruce Shepherd |
The vpn conjecture is true. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 443-450, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
network design, robust optimization, oblivious routing |
37 | Shachar Lovett, Roy Meshulam, Alex Samorodnitsky |
Inverse conjecture for the gowers norm is false. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 547-556, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
gowers norm, multivariate polynomials, low degree tests |
37 | J. C. Lagarias 0001 |
Bounds for Local Density of Sphere Packings and the Kepler Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 27(2), pp. 165-193, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
37 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi |
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(2), pp. 142-180, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Bidimensionality, Wagner’s conjecture, Graph algorithms, Treewidth, Graph minors, Grid graphs |
37 | Raman Sanyal, Axel Werner, Günter M. Ziegler |
On Kalai's Conjectures Concerning Centrally Symmetric Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(2), pp. 183-198, 2009. The full citation details ...](Pics/full.jpeg) |
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 |
37 | Irit Dinur, Elchanan Mossel, Oded Regev 0001 |
Conditional hardness for approximate coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 344-353, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
graph coloring, hardness of approximation, unique games conjecture |
34 | Tero Harju, Dirk Nowotka |
Periodicity and unbordered words: A proof of the extended duval conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 54(4), pp. 20, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Duval's conjecture, unbordered words, periodicity, Combinatorics on words |
34 | Jacob Katzenelson, Shlomit S. Pinter, Eugen Schenfeld |
Type Matching, Type-Graphs, and the Schanuel Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 14(4), pp. 574-588, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
Schanuel conjecture, graph hashing, mapping graphs to numbers, type matching, compilers, types, type-graphs |
33 | T. Birsan, Dan Tiba |
One Hundred Years Since the Introduction of the Set Distance by Dimitrie Pompeiu. ![Search on Bibsonomy](Pics/bibsonomy.png) |
System Modelling and Optimization ![In: System Modeling and Optimization, Proceedings of the 22nd IFIP TC7 Conference held from July 18-22, 2005, in Turin, Italy, pp. 35-39, 2005, Springer, 0-387-32774-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Hausdorff-Pompeiu distance, Pompeiu functions, Pompeiu conjecture, Schiffer conjecture, Hausdorff distance |
33 | Tung-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](Pics/bibsonomy.png) |
ICRA ![In: 2008 IEEE International Conference on Robotics and Automation, ICRA 2008, May 19-23, 2008, Pasadena, California, USA, pp. 3636-3641, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Micah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert D. Kleinberg, April Rasala Lehman |
On the capacity of information networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 241-250, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Stefan Andrei, Manfred Kudlek, Radu Stefan Niculescu |
Some results on the Collatz problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 37(2), pp. 145-160, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
33 | Alexei P. Stolboushkin, Michael A. Taitslin |
Normalizable linear orders and generic computations in finite models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 38(4-5), pp. 257-271, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
33 | Thomas C. Hales |
Sphere Packings, I. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 17(1), pp. 1-51, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
30 | Asaf Shapira |
Green's conjecture and testing linear-invariant properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 159-166, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
hypergraphs removal lemma, boolean functions, property testing |
30 | Julia Böttcher, Mathias Schacht, Anusch Taraz |
On the bandwidth conjecture for 3-colourable graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 618-626, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
30 | Tadej Kotnik, Herman te Riele |
The Mertens Conjecture Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANTS ![In: Algorithmic Number Theory, 7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings, pp. 156-167, 2006, Springer, 3-540-36075-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Subhash Khot, Nisheeth K. Vishnoi |
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings, pp. 53-62, 2005, IEEE Computer Society, 0-7695-2468-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Christos H. Papadimitriou, David Ratajczak |
On a Conjecture Related to Geometric Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALGOSENSORS ![In: Algorithmic Aspects of Wireless Sensor Networks: First International Workshop, ALGOSENSORS 2004, Turku, Finland, July 16, 2004. Proceedings, pp. 9-17, 2004, Springer, 3-540-22476-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Sinisa T. Vrecica |
Tverberg's Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 29(4), pp. 505-510, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. Mustafa |
On a Conjecture on Wiener Indices in Combinatorial Chemistry. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, pp. 509-518, 2003, Springer, 3-540-40534-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Daniel Richardson |
The Uniformity Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCA ![In: Computability and Complexity in Analysis, 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000, Selected Papers, pp. 253-272, 2000, Springer, 3-540-42197-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
30 | Fred B. Holt, Victor Klee |
Counterexamples to the Strong d -Step Conjecture for d ge 5. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 19(1), pp. 33-46, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
30 | J. C. Lagarias 0001, Nagabhushana Prabhu, James A. Reeds |
The d-Step Conjecture and Gaussian Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 18(1), pp. 53-82, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
30 | Harry Buhrman, Montserrat Hermo |
On the Sparse Set Conjecture for Sets with Low Denisty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings, pp. 609-618, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
30 | Jamil Baddoura |
A Conjecture on Integration in Finite Terms with Elementary Functions and Polylogarithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC '94, Oxford, UK, July 20-22, 1994, pp. 158-162, 1994, ACM, 0-89791-638-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
30 | Nader H. Bshouty |
On the Direct Sum Conjecture in the Straight Line Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993, Proceedings, pp. 85-96, 1993, Springer, 3-540-57273-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
30 | Karel Culík II |
On Test Sets and the Ehrenfeucht Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 9th Colloquium, Aarhus, Denmark, July 12-16, 1982, Proceedings, pp. 128-140, 1982, Springer, 3-540-11576-5. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
30 | Scott Aaronson |
BQP and the polynomial hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 141-150, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
linial-nisan conjecture, quantum complexity classes, fourier analysis, constant-depth circuits |
30 | Avraham Trakhtman |
Some Aspects of Synchronization of DFA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 23(5), pp. 719-727, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
deterministic finite automata (DFA), aperiodic semigroup, ?erný conjecture, synchronization |
30 | Prasad Raghavendra |
Optimal algorithms and inapproximability results for every CSP? ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 245-254, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
dictatorship tests, rounding schemes, semidefinite programming, constraint satisfaction problem, unique games conjecture |
30 | Daniel Richardson |
Zero Tests for Constants in Simple Scientific Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 1(1), pp. 21-37, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Exp-Log constants, zero test, Schanuel conjecture |
30 | Takashi Matsuhisa |
Communication Leading to Nash Equilibrium Through Robust Messages - S5 -Knowledge Model Case -. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings, pp. 136-145, 2007, Springer, 978-3-540-73555-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Robust message, Non-corporative game, S5-knowledge model, Communication, Protocol, Nash equilibrium, Conjecture |
30 | S. M. Nazrul Alam, Zygmunt J. Haas |
Coverage and connectivity in three-dimensional networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiCom ![In: Proceedings of the 12th Annual International Conference on Mobile Computing and Networking, MOBICOM 2006, Los Angeles, CA, USA, September 23-29, 2006, pp. 346-357, 2006, ACM, 1-59593-286-0. The full citation details ...](Pics/full.jpeg) |
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 |
30 | Takashi Matsuhisa, Paul Strokan |
Bayesian Communication Leading to a Nash Equilibrium in Belief. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, First International Workshop, WINE 2005, Hong Kong, China, December 15-17, 2005, Proceedings, pp. 299-306, 2005, Springer, 3-540-30900-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
p-Belief system, Bayesian communication, Non-corporative game, Protocol, Nash equilibrium, Conjecture |
30 | Takashi Matsuhisa |
Communication Leading to Nash Equilibrium without Acyclic Condition (S4-Knowledge Model Case). ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science ![In: Computational Science - ICCS 2004, 4th International Conference, Kraków, Poland, June 6-9, 2004, Proceedings, Part IV, pp. 884-891, 2004, Springer, 3-540-22129-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Modal logic S4, Mutual learning, Non-corporative game, Communication, Protocol, Nash equilibrium, Knowledge, Information, Conjecture |
30 | Takashi Matsuhisa |
p-Belief Communication Leading to a Nash Equilibrium. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIS ![In: Computational and Information Science, First International Symposium, CIS 2004, Shanghai, China, December 16-18, 2004, Proceedings, pp. 1114-1120, 2004, Springer, 3-540-24127-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
p-Belief system, Non-corporative game, Communication, Protocol, Nash equilibrium, Conjecture |
30 | Josep M. Brunat, Antonio Montes |
The characteristic ideal of a finite, connected, regular graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pp. 50-57, 2004, ACM, 1-58113-827-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
characteristic ideal, galois graph, polynomial digraph, polynomial graph, strongly polynomial graph, variety of a pairing, pairing, connected component, conjecture |
30 | Olivier Baudon, Guillaume Fertin, Ivan Havel |
Routing Permutations in the Hypercube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings, pp. 179-190, 1999, Springer, 3-540-66731-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
routing permutations, Szymanski's conjecture, 2-1 routing requests, Hypercubes |
27 | Rade T. Zivaljevic |
Combinatorial Groupoids, Cubical Complexes, and the Lovász Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(1), pp. 135-161, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Combinatorial groupoids, Lovász conjecture, Discrete differential geometry, Cubical complexes |
27 | Miguel 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](Pics/bibsonomy.png) |
ISPDC ![In: Eighth International Symposium on Parallel and Distributed Computing, ISPDC 2009, Lisbon, Portugal, June 30-July 4 2009, pp. 143-150, 2009, IEEE Computer Society, 978-0-7695-3680-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Conjecture of Bateman, Recreational Mathematics, Particle Swarm Optimisation |
27 | Arnold Beckmann, Martin Goldstern, Norbert Preining |
Continuous Fraïssé Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 25(4), pp. 281-298, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Better quasi order, Gödel logic, Wellquasiorder, Fraisse conjecture, Continuous embeddings |
27 | Wolfram Koepf |
Power series, Bieberbach conjecture and the de Branges and Weinstein functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2003, Drexel University, Philadelphia, Pennsylvania, USA, August 3-6, 2003, Proceedings, pp. 169-175, 2003, ACM, 1-58113-641-2. The full citation details ...](Pics/full.jpeg) |
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 |
27 | Clifford D. Smyth |
Reimer's inequality and tardos' conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 218-221, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Reimer's inequality, certificate complexity, correlation inequalities, decision tree complexity, van den Berg-Kesten conjecture |
27 | Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer |
The Isomorphism Conjecture Fails Relative to a Random Oracle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 42(2), pp. 401-420, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
randomness, isomorphism, conjecture |
27 | Jin-yi Cai, D. Sivakumar |
The Resolution of a Hartmanis Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 362-371, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Hartmanis conjecture, sparse sets, logspace many-one reductions, sparse hard set, computational complexity |
27 | Anil Kamath, Rajeev Motwani 0001, Krishna V. Palem, Paul G. Spirakis |
Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 592-603, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
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 |
27 | Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz |
The Isomorphism Conjecture Holds Relative to an Oracle ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 30-39, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
symmetric perfect generic sets, isomorphism conjecture, NP completeness, oracle |
27 | Rajamani Sundar |
Twists, Turns, Cascades, Deque Conjecture, and Scanning Theorem ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 555-559, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
turns, deque conjecture, scanning theorem, inverse Ackerman bound, binary tree, cascades, splay tree |
27 | Ken-ichi Kawarabayashi, Bojan Mohar |
List-color-critical graphs on a fixed surface. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 1156-1165, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
critical graphs, surface, list-coloring |
27 | Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura |
The stable set polytope of quasi-line graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 28(1), pp. 45-67, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C57, 90C10 |
27 | Thomas C. Hales |
Sphere Packing, IV. Detailed Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 36(1), pp. 111-166, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
27 | Mario Szegedy |
The DLT priority sampling is essentially optimal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 150-158, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
integral formula, priority sampling, subset sum estimate, telescopic sums, network measurement, Internet traffic |
27 | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
Near-optimal algorithms for unique games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 205-214, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
unique games, approximation algorithms, semidefinite programming, constraint satisfaction problems |
27 | Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura |
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings, pp. 291-305, 2005, Springer, 3-540-26199-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
27 | Elchanan Mossel, Ryan O'Donnell, Krzysztof Oleszkiewicz |
Noise stability of functions with low in.uences invariance and optimality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings, pp. 21-30, 2005, IEEE Computer Society, 0-7695-2468-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
27 | Robert Krauthgamer, James R. Lee |
The intrinsic dimensionality of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 438-447, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
growth restricted graphs, low-dimensional, embeddings, graph decomposition, lovasz local lemma, finite metric spaces |
27 | Khaled 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](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 28(5), pp. 494-509, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
quality prediction, optimal size, software quality, quality models, object-oriented metrics, software size |
27 | Ron Aharoni, Ron Holzman, Michael Krivelevich, Roy Meshulam |
Fractional Planks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 27(4), pp. 585-602, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Miklós Ajtai |
Random Lattices and a Conjectured 0 - 1 Law about Their Polynomial Time Computable Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 733-742, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Károly J. Böröczky |
About the Error Term for Best Approximation with Respect to the Hausdorff Related Metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 25(2), pp. 293-309, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
27 | Thomas C. Hales |
Sphere packings and generative. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Seventeenth Annual Symposium on Computational Geometry, Medford, MA, USA, June 3-5, 2001, pp. 69, 2001, ACM, 1-58113-357-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
27 | Howard Straubing |
Circuit Complexity and the Expressive Power of Generalized First-Order Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 19th International Colloquium, ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings, pp. 16-27, 1992, Springer, 3-540-55719-9. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
24 | Subhas Kumar Ghosh, Koushik Sinha |
On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings, pp. 145-156, 2009, Springer, 978-3-642-03408-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Gábor Kun, Mario Szegedy |
A new line of attack on the dichotomy conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 725-734, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
term operations, computational complexity, constraint satisfaction problems, fourier analysis, NP, dichotomy |
24 | Xu Xiang |
On the Minimum Distance Conjecture for Schubert Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(1), pp. 486-488, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Maxime Crochemore, Lucian Ilie, Liviu Tinta |
Towards a Solution to the "Runs" Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings, pp. 290-302, 2008, Springer, 978-3-540-69066-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Philippe Langevin, Gregor Leander, Gary McGuire |
A Counterexample to a Conjecture of Niho. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(12), pp. 4785-4786, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Roman N. Karasev |
Tverberg's Transversal Conjecture and Analogues of Nonembeddability Theorems for Transversals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 38(3), pp. 513-525, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Giancarlo Mauri, Mario J. Pérez-Jiménez, Claudio Zandron |
On a Paun's Conjecture in Membrane Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWINAC (1) ![In: Bio-inspired Modeling of Cognitive Tasks, Second International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2007, La Manga del Mar Menor, Spain, June 18-21, 2007, Proceedings, Part I, pp. 180-192, 2007, Springer, 978-3-540-73052-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Károly Bezdek |
From the Kneser-Poulsen conjecture to ball-polyhedra via Voronoi diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISVD ![In: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2007, Pontypridd, Wales, UK, July 9-12, 2007, pp. 3-6, 2007, IEEE Computer Society, 0-7695-2869-4. The full citation details ...](Pics/full.jpeg) |
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][ >>] |
|