Fouad B. Chedid

According to our database1, Fouad B. Chedid authored at least 27 papers between 1993 and 2019.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Kolmogorov's Algorithmic Mutual Information Is Equivalent to Bayes' Law.
CoRR, 2019

2017
Kolmogorov Complexity and Information Content.
CoRR, 2017

A Variation of Levin Search for All Well-Defined Problems.
CoRR, 2017

2013
On Pattern Matching With Swaps.
Proceedings of the ACS International Conference on Computer Systems and Applications, 2013

2012
A Note on Developing Optimal and Scalable Parallel Two-List Algorithms.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2012

A Regular Group Quorum System of Degree $\lceil \sqrt{n/2}\rceil$.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2012

On Natural Representations of Objects.
Proceedings of the Turing-100, 2012

2010
On Packing Splittable Items with Cardinality Constraints.
Proceedings of the Theoretical Computer Science, 2010

Parallel Pattern Matching with Swaps on a Linear Array.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2010

On proving languages non-regular.
Proceedings of the 8th ACS/IEEE International Conference on Computer Systems and Applications, 2010

Sophistication and logical depth revisited.
Proceedings of the 8th ACS/IEEE International Conference on Computer Systems and Applications, 2010

2008
An optimal parallelization of the two-list algorithm of cost O(2<sup>n/2</sup>).
Parallel Comput., 2008

2007
Knowledge Versus Information Contents.
Proceedings of the 2007 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2007), 2007

2006
A Group Quorum System of Degree 1+sqrt(1+n/m).
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

On Compactly Encoding With Differential Compression.
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
Optimal Parallel Block Access for Range Queries.
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
On the Generalized Twisted Cube.
Inf. Process. Lett., 1995

On the Hybrid Neural Network Model for Solving Optimization Problems.
Proceedings of the Combinatorics and Computer Science, 1995

1993
A New Variation on Hypercubes with Smaller Diameter.
Inf. Process. Lett., 1993


  Loading...