Fouad B. Chedid
According to our database1,
Fouad B. Chedid
authored at least 27 papers
between 1993 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2019
2017
2013
Proceedings of the ACS International Conference on Computer Systems and Applications, 2013
2012
Proceedings of the Algorithms and Architectures for Parallel Processing, 2012
Proceedings of the Algorithms and Architectures for Parallel Processing, 2012
2010
Proceedings of the Theoretical Computer Science, 2010
Proceedings of the Algorithms and Architectures for Parallel Processing, 2010
Proceedings of the 8th ACS/IEEE International Conference on Computer Systems and Applications, 2010
Proceedings of the 8th ACS/IEEE International Conference on Computer Systems and Applications, 2010
2008
Parallel Comput., 2008
2007
Proceedings of the 2007 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2007), 2007
2006
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006
Cohorts for Group Mutual Exclusion.
Proceedings of the 21st International Conference on Computers and Their Applications, 2006
Proceedings of the 2006 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2006), 2006
Parameterized Enumerability for the Database Theorist.
Proceedings of the Algorithms and Complexity in Durham 2006, 2006
2005
A Declustering Scheme With Guaranteed Worst-Case Additive Error O(k\frac{1}{{d - 1}}).
Proceedings of the 11th International Conference on Parallel and Distributed Systems, 2005
2004
Proceedings of the 10th International Conference on Parallel and Distributed Systems, 2004
2003
Preliminary Results of a Modified HITS with Better Performance.
Proceedings of the International Conference on Information and Knowledge Engineering. IKE'03, June 23, 2003
On Linear Time, Constant Space Differencing Algorithms for Compactly Encoding Unstructured Inputs.
Proceedings of the International Conference on Internet Computing, 2003
The Bidding Method: A General Distributed Method for Designing Approximation Algorithms for NP-Complete Problems.
Proceedings of the ISCA 18th International Conference Computers and Their Applications, 2003
2002
Artificial Economy as a Vehicle for Designing Approximation Algorithms for NP-Complete Problems.
Proceedings of the 11th Conference on Intelligent Systems: Emerging Technologies, 2002
2001
A Parallel Time/Processor Tradeoff T.P=O(n^(log M)/M) for the Subset-Sum Problem.
Proceedings of the ISCA 14th International Conference on Parallel and Distributed Computing Systems, 2001
1995
Proceedings of the Combinatorics and Computer Science, 1995
1993