Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2095
search results - page 27 / 419
»
Improved pebbling bounds
Sort
relevance
views
votes
recent
update
View
thumb
title
132
click to vote
COMBINATORICS
1998
81
views
more
COMBINATORICS 1998
»
An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs
15 years 5 months ago
Download
www.combinatorics.org
Michael Krivelevich
claim paper
Read More »
130
click to vote
COMBINATORICS
1999
77
views
more
COMBINATORICS 1999
»
Improved LP Lower Bounds for Difference Triangle Sets
15 years 5 months ago
Download
www.combinatorics.org
James B. Shearer
claim paper
Read More »
127
click to vote
TIT
2002
56
views
more
TIT 2002
»
Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes
15 years 5 months ago
Download
www.rmatsumoto.org
Ryutaroh Matsumoto
claim paper
Read More »
128
click to vote
CORR
2008
Springer
88
views
Education
»
more
CORR 2008
»
Improved bounds and new techniques for Davenport-Schinzel sequences and their generalizations
15 years 4 months ago
Download
kam.mff.cuni.cz
Gabriel Nivasch
claim paper
Read More »
125
click to vote
TCS
2010
106
views
Theoretical Computer Science
»
more
TCS 2010
»
Improved upper bounds for vertex cover
15 years 4 months ago
Download
facweb.cs.depaul.edu
Jianer Chen, Iyad A. Kanj, Ge Xia
claim paper
Read More »
« Prev
« First
page 27 / 419
Last »
Next »
