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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicograph...
Sort
relevance
views
votes
recent
update
View
thumb
title
21
click to vote
ICTCS
2003
Springer
74
views
Theoretical Computer Science
»
more
ICTCS 2003
»
A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set
14 years 23 days ago
Download
www.ii.uib.no
Jens Gustedt, Jan Arne Telle
claim paper
Read More »
19
click to vote
IPPS
2000
IEEE
136
views
Distributed And Parallel Com...
»
more
IPPS 2000
»
Parallelizability of Some P-Complete Problems
13 years 12 months ago
Download
ipdps.cc.gatech.edu
Abstract. In this paper, we consider parallelizability of some Pcomplete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We pr...
Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuza...
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »