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
4212
search results - page 20 / 843
»
On Compressible Pairings and Their Computation
Sort
relevance
views
votes
recent
update
View
thumb
title
132
click to vote
FOCS
2006
IEEE
107
views
Theoretical Computer Science
»
more
FOCS 2006
»
Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths
16 years 4 days ago
Download
www.cse.iitk.ac.in
Surender Baswana, Telikepalli Kavitha
claim paper
Read More »
143
click to vote
WG
2004
Springer
106
views
Theoretical Computer Science
»
more
WG 2004
»
A Symbolic Approach to the All-Pairs Shortest-Paths Problem
15 years 11 months ago
Download
ls2-www.cs.uni-dortmund.de
Daniel Sawitzki
claim paper
Read More »
115
click to vote
CSR
2010
Springer
86
views
Theoretical Computer Science
»
more
CSR 2010
»
Monotone Complexity of a Pair
15 years 11 months ago
Download
www.lif.univ-mrs.fr
Pavel Karpovich
claim paper
Read More »
116
click to vote
WG
2001
Springer
93
views
Theoretical Computer Science
»
more
WG 2001
»
Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
15 years 10 months ago
Download
www.cs.kent.edu
Feodor F. Dragan
claim paper
Read More »
249
click to vote
EUC
2008
Springer
742
views
Applied Computing
»
more
EUC 2008
»
Convertible Undeniable Partially Blind Signature from Bilinear Pairings
15 years 7 months ago
Download
www.cipher.risk.tsukuba.ac.jp
Atsushi Koide, Raylin Tso, Eiji Okamoto
claim paper
Read More »
« Prev
« First
page 20 / 843
Last »
Next »
