Fouad B. Chedid received the B.S. degree in Physics from the Lebanese University in 1982, the M.S. degree in Computer Science from the University of California, Riverside, in 1987, and the Ph.D. degree in Computer Science from the Illinois Institute of Technology, Chicago, in 1990. From 1990 to 1996, he was on the faculty of computer science at Temple University (Tokyo campus). Since 1996, he has been on the faculty of the Notre Dame University Computer Science Department in Lebanon, where he is currently a professor and chairman of the Computer Science Department. His current research interests are in distributed computing and systems and algorithmic information theory. He has served on the program committees of many international conferences and workshops. He is currently on the editorial board of International Journal of Patterns and Scientific Journals International.

Ph.D. in Computer Science, Illinois Institute of Technology, Chicago, USA, 1990.

M.Sc. in Computer Science, University of California, Riverside, USA, 1987.

B.Sc. in Physics, Lebanese University, Lebanon, 1982.

Solomonoff 85th Memorial Conference

Books

Chedid, F. Baroud, F., Haraty, R. (2002) Informatics, Secondary Education, Second Year. Beirut: National Center for Educational Research and Development (NCERD).

Chedid, F. Baroud, F., Haraty, R. (2001) Informatics, Secondary Education, First Year. Beirut: National Center for Educational Research and Development (NCERD).

Chedid, F., Baroud, F., Rabih, Y. (2001) Informatics, Normal Schools, Pre-Service Intermediate Teachers. Beirut: Educational Center for Research and Development (NECRD).

Chedid, F., Baroud, F. (2000) Informatics, Secondary Education, Third Year.  Beirut: National  Center for Educational Research and Development (NCERD).

Chedid, F., Baroud, F. (1999) Informatics, Secondary Education, Second Year. Beirut: National Center for Educational Research and Development (NCERD). 

A Chapter in an edited Book

Chedid, F. (1996) On the Hybrid Neural Network Model for Solving Optimization Problems. In M. Deza, R. Euler, Y. Manoussakis (Eds.), Combinatorics and Computer Science, Lecture Notes in Computer Science, Vol. 1120 (pp. 182-193). London: Springer-Verlag. 

Refereed Journal Articles

Chedid, F. (2008) A New Optimal Parallel Two-List Algorithm for the Subset-Sum Problem, Journal of Discrete Algorithms, Elsevier.

Chedid, F. (2008) An Optimal Parallelization of the Two-List Algorithm of Cost $O(2^{n/2})$, Parallel Computing, 34(1), pp. 63-65, Elsevier.

Chedid, F., Saito, M. (1996) A Simple Iterative Algorithm for the Towers of Hanoi Problem, IEEE Transactions on Education, 39(2), pp. 33-34, IEEE Press.

Chedid, F. (1995) On the Generalized Twisted Cube, Information Processing Letters, 55(1), pp. 49-52, Elsevier.

Chedid, F. Chedid, R. (1993) A New Variation on Hypercubes with Smaller Diameter, Information Processing Letters, 46(6), pp. 275-280, Elsevier.

Conference Proceedings

Chedid, F. (2010) On Packing Splittable Items With Cardinality Constraints, In Proc. 6th IFIP International Conference on Theoretical Computer Science (TCS 2010), Brisbane, Australia, IFIP AICT 323, pp. 101-110, Springer.

Chedid, F. (2010) Parallel Pattern Matching With Swaps on a Linear Array. In Proc. The Tenth International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP 2010), Busan, Korea, May 2010, Lecture Notes in Computer Science, Vol. 6081, pp. 44-53, Springer-Verlag Berlin Heidelberg.

Chedid, F. (2010) On Proving languages Nonregular. The Eight ACS/IEEE International Conference on
Computer Systems and Applications (AICCSA 2010), Hammamet, Tunisia, May 2010, IEEE Computer Society, DOI: 10.1109/AICCSA.2010.5586960.

Chedid, F. (2010) Sophistication and Logical Depth Revisited. The Eight ACS/IEEE International Conference on
Computer Systems and Applications (AICCSA 2010), Hammamet, Tunisia, May 2010, IEEE Computer Society, DOI: 10.1109/AICCSA.2010.5586966.

Chedid, F. (2008) A Clearer Definition of Sufficient Statistic Based on a Three-Stage Description. In Proc. Conference on Current Trends in the Theory and Applications of Computer Science (CTTACS 2008), pp. 108-118, Beirut: Notre Dame University Press.

Chedid, F. (2007) A Scalable Parallelization of the Two-List Algorithm of Optimal Cost O(2^{n/2}). In Proc. Workshop on Algorithms and Complexity in Durham (ACiD), Texts in Algorithmics, Vol. 9, pp. 35-42, King's College, London.

Chedid, F. (2007) Information Contents Versus Knowledge, In Proc.  International Conference on Computer Systems and Applications (AICCSA), Amman, Jordan, pp. 316-323, IEEE Computer Society.

Chedid, F. (2007) Quantifying Knowledge, in Conference on Logic, Computability and Randomness, Buenos Aires, Argentina, pp. 36-37.

Chedid, F. (2006) A Group Quorum System of Degree 1+\sqrt{1+ {n\over m}}. In Proc.  International Conference on Distributed Computing and Networking (ICDCN), Guwahati, India, Lecture Notes in Computer Science, Vol. 4308, pp. 70-81, Springer.

Chedid, F. (2006) Parameterized Complexity for the Database Theorist. In Proc.  Workshop on Algorithms and Complexity in Durham (ACiD), Texts in Algorithmics, Vol. 7, pp. 49-56, King's College, London.

Chedid, F. (2006) A New Group Quorum System of Large Degree, In Proc.  International Multiconference on Computer Science and Information Technology (CSIT), Amman, Jordan, pp. 334-339.

Chedid, F. (2006) Cohorts for Group Mutual Exclusion. In Proc.  International Conference on Computers and Their Applications (CATA), Seattle, Washington, pp. 295-300, ISCA.

Chedid, F. and Mouawad, P. (2006) On Compactly Encoding With Differential Compression. In Proc.  International Conference on Computer Systems and Applications (AICCSA), Dubai/Sharjah, UAE, pp. 123-129, IEEE Press.

Chedid, F. (2005) A Declustering Scheme With Guaranteed Worst-Case Additive Error O(k^{1\over {d-1}}) for d-Dimensional Range Queries. In Proc.  International Conference on Parallel and Distributed Systems (ICPADS), Fukuoka Institute of Technology, Fukuoka, Japan, pp. 625-628, IEEE Computer Society.

Chedid, F. and Mouawad, P. (2004) A Testbed for Linear Time and Constant Space Differencing Algorithms. In Proc.  International Conference on Computer Science, Software Engineering, Information Technology, e-Business, and Applications (CSITeA), Cairo, Egypt, pp. 1-5, ISCA.

Chedid, F. (2004) Optimal Parallel Block Access for Range Queries. In Proc.  International Conference on Parallel and Distributed Systems (ICPADS), Newport Beach, California, pp. 119-126, IEEE Press.

Chedid, F. (2004) On the Disk Allocation for Range Queries Problem, Proc.  GIS Research UK Conference (GISRUK), Norwich, England, pp. 5-8, Univ. of East Anglia.

Chedid, F. (2003) Preliminary Results of a Modified HITS With Better Performance. In Proc.  International conference on Information and Knowledge Engineering (IKE), Las Vegas, Nevada, pp. 622-627, CSREA Press.

Chedid, F. (2003) On Linear Time and Constant Space Differencing Algorithms for Compactly Encoding Unstructured Inputs. In Proc.  International Conference on Internet Computing (IC), Las Vegas, Nevada, pp. 285-288, CSREA Press.

Chedid, F. (2003) On Generalization in a Spatio-Temporal Setting. In Proceedings GIS Research UK (GISRUK), London, England, pp. 111-114, City University of London.

Chedid, F. (2003) The Bidding Method: A General Distributed Method for Designing Approximation Algorithms for NP-Complete Problems. In Proc.  International Conference on Computers and Their Applications (CATA), Honolulu, Hawaii, pp. 224-227, ISCA.
Chedid, F. (2002). Preliminary Observations on Identity-Based Change Primitives and Operations. In Proc. GIS Research UK (GISRUK), Sheffield, England, pp. 277-279, University of Sheffield.

Chedid, F. (2002) Artificial Economy as a Vehicle for Designing Approximation Algorithms for NP-Complete Problems, in Proceedings International Conference on Intelligent Systems (IS), Boston, Massachusetts, pp. 140-142, ISCA.

Chedid, F. (2001) A Parallel Time/processor Tradeoff $T.P = O({n^{\log M}\over M})$ for the Subset-Sum Problem. In Proc. International Conference on Parallel and Distributed Computing Systems (PDCS), Richardson, Texas, pp. 214-217, ISCA.

Chedid, F. and Abdel Massih, H. (2001) On Integrating Optimization Heurisitics and GIS for Solving the District Determination Problem for Mail Distribution Planning. In Proceedings GIS Research UK (GISRUK), Glamorgan, Wales, pp. 98-105, University of Glamorgan.

Chedid, F. and Wakim, T. (2000) On the Reconstruction of Old Versions from a Spatio-Temporal Database. In Proc. ESRI Twentieth International User Conference, San Diego, California, ESRI.

Chedid, F. and Mina, J. (1999) A Variation of Bokhari's Layered Graph Algorithm for Mapping Chains onto Chains n O(m^2n) Time Using a Reduced Layered Graph of  O(mn) Nodes. In Proc. IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS), MIT, Boston.

Chedid, F. (1999) Kolmogorov Complexity: A New Way of Formulating Proofs. In Proceedings International Conference on Scientific Computations (ICSC), Beirut: Lebanese American University, pp. 312-317.

Chedid, F. (1996) Storwick's Graphs Revisited, in Proceedings Fourteenth IASTED International Conference on Applied Informatics, Innsbruck, Austria, pp. 293-295, IASTED.

Chedid, F. (1995) On Neural Networks and Optimization Problems, in Proceedings First LAAS International Conference on Computer Simulation, Beirut, Lebanon, LAAS, pp. 241-246.

Chedid, F. (1994) Kolmogorov Complexity and the Incompressibility Method, Proc.  Seventh Franco-Japanese Days on Combinatorics, Optimization, and Computational Geometry, Tokyo, Japan, University of Tokyo, pp. 5.

Chedid, F. and Chedid, R. (1994) A Neural Network Approach for Finite Element Software. In Proceeding IASTED International Conference on Modeling, Simulation and Identification, Wakayama, Japan, pp. 232-236, IASTED.