default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFouad B. Chedid
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2008
[j3]Fouad B. Chedid:
An optimal parallelization of the two-list algorithm of cost O(2n/2). Parallel Comput. 34(1): 63-65 (2008)- 1995
- [j2]Fouad B. Chedid:
On the Generalized Twisted Cube. Inf. Process. Lett. 55(1): 49-52 (1995) - 1993
- [j1]Fouad B. Chedid, Riad B. Chedid:
A New Variation on Hypercubes with Smaller Diameter. Inf. Process. Lett. 46(6): 275-280 (1993)
Conference and Workshop Papers
- 2013
- [c21]Fouad B. Chedid:
On Pattern Matching With Swaps. AICCSA 2013: 1-5 - 2012
- [c20]Fouad B. Chedid:
On Natural Representations of Objects. Turing-100 2012: 34-41 - [c19]Fouad B. Chedid:
A Regular Group Quorum System of Degree $\lceil \sqrt{n/2}\rceil$. ICA3PP (2) 2012: 140-147 - [c18]Fouad B. Chedid:
A Note on Developing Optimal and Scalable Parallel Two-List Algorithms. ICA3PP (2) 2012: 148-155 - 2010
- [c17]Fouad B. Chedid:
Sophistication and logical depth revisited. AICCSA 2010: 1-4 - [c16]Fouad B. Chedid:
On proving languages non-regular. AICCSA 2010: 1-3 - [c15]Fouad B. Chedid:
Parallel Pattern Matching with Swaps on a Linear Array. ICA3PP (1) 2010: 44-53 - [c14]Fouad B. Chedid:
On Packing Splittable Items with Cardinality Constraints. IFIP TCS 2010: 101-110 - 2007
- [c13]Fouad B. Chedid:
Knowledge Versus Information Contents. AICCSA 2007: 316-323 - 2006
- [c12]Fouad B. Chedid:
Parameterized Enumerability for the Database Theorist. ACiD 2006: 49-56 - [c11]Fouad B. Chedid, Pauline G. Mouawad
:
On Compactly Encoding With Differential Compression. AICCSA 2006: 123-129 - [c10]Fouad B. Chedid:
Cohorts for Group Mutual Exclusion. CATA 2006: 295-300 - [c9]Fouad B. Chedid:
A Group Quorum System of Degree 1+sqrt(1+n/m). ICDCN 2006: 70-81 - 2005
- [c8]Fouad B. Chedid:
A Declustering Scheme With Guaranteed Worst-Case Additive Error O(k\frac{1}{{d - 1}}). ICPADS (2) 2005: 625-628 - 2004
- [c7]Fouad B. Chedid:
Optimal Parallel Block Access for Range Queries. ICPADS 2004: 119-126 - 2003
- [c6]Fouad B. Chedid:
The Bidding Method: A General Distributed Method for Designing Approximation Algorithms for NP-Complete Problems. CATA 2003: 224-227 - [c5]Fouad B. Chedid:
On Linear Time, Constant Space Differencing Algorithms for Compactly Encoding Unstructured Inputs. International Conference on Internet Computing 2003: 285-290 - [c4]Fouad B. Chedid:
Preliminary Results of a Modified HITS with Better Performance. IKE 2003: 622-627 - 2002
- [c3]Fouad B. Chedid:
Artificial Economy as a Vehicle for Designing Approximation Algorithms for NP-Complete Problems. IS 2002: 140-142 - 2001
- [c2]Fouad B. Chedid:
A Parallel Time/Processor Tradeoff T.P=O(n^(log M)/M) for the Subset-Sum Problem. PDCS 2001: 478-481 - 1995
- [c1]Fouad B. Chedid:
On the Hybrid Neural Network Model for Solving Optimization Problems. Combinatorics and Computer Science 1995: 182-193
Informal and Other Publications
- 2019
- [i3]Fouad B. Chedid:
Kolmogorov's Algorithmic Mutual Information Is Equivalent to Bayes' Law. CoRR abs/1907.02943 (2019) - 2017
- [i2]Fouad B. Chedid:
A Variation of Levin Search for All Well-Defined Problems. CoRR abs/1702.03152 (2017) - [i1]Fouad B. Chedid:
Kolmogorov Complexity and Information Content. CoRR abs/1710.06846 (2017)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
