Fouad B. Chedid

27 papers B 1C 5Misc 4Journal 6Unranked 11
YearRankTypeTitle / Venue / Authors
2019 J jnl
Kolmogorov's Algorithmic Mutual Information Is Equivalent to Bayes' Law.
CoRR
Fouad B. Chedid
2017 J jnl
A Variation of Levin Search for All Well-Defined Problems.
CoRR
Fouad B. Chedid
2017 J jnl
Kolmogorov Complexity and Information Content.
CoRR
Fouad B. Chedid
2013 C conf
On Pattern Matching With Swaps.
AICCSA
Fouad B. Chedid
2012 — conf
A Note on Developing Optimal and Scalable Parallel Two-List Algorithms.
ICA3PP (2)
Fouad B. Chedid
2012 — conf
A Regular Group Quorum System of Degree $\lceil \sqrt{n/2}\rceil$.
ICA3PP (2)
Fouad B. Chedid
2012 — conf
On Natural Representations of Objects.
Turing-100
Fouad B. Chedid
2010 — conf
On Packing Splittable Items with Cardinality Constraints.
IFIP TCS
Fouad B. Chedid
2010 C conf
On proving languages non-regular.
AICCSA
Fouad B. Chedid
2010 — conf
Parallel Pattern Matching with Swaps on a Linear Array.
ICA3PP (1)
Fouad B. Chedid
2010 C conf
Sophistication and logical depth revisited.
AICCSA
Fouad B. Chedid
2008 J jnl
An optimal parallelization of the two-list algorithm of cost O(2
Parallel Comput.
Fouad B. Chedid
2007 C conf
Knowledge Versus Information Contents.
AICCSA
Fouad B. Chedid
2006 Misc conf
A Group Quorum System of Degree 1+sqrt(1+n/m).
ICDCN
Fouad B. Chedid
2006 Misc conf
Cohorts for Group Mutual Exclusion.
CATA
Fouad B. Chedid
2006 C conf
On Compactly Encoding With Differential Compression.
AICCSA
Fouad B. Chedid, Pauline G. Mouawad
2006 — conf
Parameterized Enumerability for the Database Theorist.
ACiD
Fouad B. Chedid
2005 — conf
A Declustering Scheme With Guaranteed Worst-Case Additive Error O(k\frac{1}{{d - 1}}).
ICPADS (2)
Fouad B. Chedid
2004 B conf
Optimal Parallel Block Access for Range Queries.
ICPADS
Fouad B. Chedid
2003 — conf
On Linear Time, Constant Space Differencing Algorithms for Compactly Encoding Unstructured Inputs.
International Conference on Internet Computing
Fouad B. Chedid
2003 Misc conf
Preliminary Results of a Modified HITS with Better Performance.
IKE
Fouad B. Chedid
2003 Misc conf
The Bidding Method: A General Distributed Method for Designing Approximation Algorithms for NP-Complete Problems.
CATA
Fouad B. Chedid
2002 — conf
Artificial Economy as a Vehicle for Designing Approximation Algorithms for NP-Complete Problems.
IS
Fouad B. Chedid
2001 — conf
A Parallel Time/Processor Tradeoff T.P=O(n^(log M)/M) for the Subset-Sum Problem.
PDCS
Fouad B. Chedid
1995 J jnl
On the Generalized Twisted Cube.
Inf. Process. Lett.
Fouad B. Chedid
1995 — conf
On the Hybrid Neural Network Model for Solving Optimization Problems.
Combinatorics and Computer Science
Fouad B. Chedid
1993 J jnl
A New Variation on Hypercubes with Smaller Diameter.
Inf. Process. Lett.
Fouad B. Chedid, Riad B. Chedid