default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAhmed Saoudi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j23]Ahmed Saoudi
:
Two-wavelet theory in Weinstein setting. Int. J. Wavelets Multiresolution Inf. Process. 20(5): 2250020:1-2250020:17 (2022)
1990 – 1999
- 1995
- [j22]Houcine Senoussi, Ahmed Saoudi:
Quadtree Algorithms for Template Matching on Mesh Connected Computer. Int. J. Pattern Recognit. Artif. Intell. 9(2): 387-410 (1995) - 1994
- [j21]Ahmed Saoudi, Maurice Nivat:
Parallel Algorithms for Multi-Dimensional Image Template Matching. Int. J. Pattern Recognit. Artif. Intell. 8(2): 457-464 (1994) - [j20]P. Laroche, Maurice Nivat, Ahmed Saoudi:
Context-Sensitivity of Puzzle Grammars. Int. J. Pattern Recognit. Artif. Intell. 8(2): 525-542 (1994) - [j19]Maurice Nivat, G. D. S. Ramkumar, C. Pandu Rangan, Ahmed Saoudi, Ravi Sundaram:
Efficient Parallel Shuffle Recognition. Parallel Process. Lett. 4: 455-463 (1994) - [j18]Houcine Senoussi, Ahmed Saoudi:
A Quadtree Algorithm for Template Matching on a Pyramid Computer. Theor. Comput. Sci. 136(2): 387-417 (1994) - 1993
- [c11]Ahmed Saoudi, Takashi Yokomori:
Learning local and recognizable Ω-languages and monadic logic programs. EuroCOLT 1993: 157-169 - 1992
- [j17]Ahmed Saoudi:
Pushdown Automata on Infinite Trees and Nondeterministic Context-Free Programs. Int. J. Found. Comput. Sci. 3(1): 21-39 (1992) - [j16]Ahmed Saoudi, David E. Muller, Paul E. Schupp:
Finite State Processes, Z-Temporal Logic and the Monadic Theory of the Integers. Int. J. Found. Comput. Sci. 3(3): 233-244 (1992) - [j15]Maurice Nivat, Ahmed Saoudi:
Parallel Recognition of High Dimensional Images. Int. J. Pattern Recognit. Artif. Intell. 6(2&3): 285-291 (1992) - [j14]Wojciech Rytter, Ahmed Saoudi:
On Parallel Recognition of Two Classes of 2-D Array Patterns. Int. J. Pattern Recognit. Artif. Intell. 6(2&3): 293-299 (1992) - [j13]K. G. Subramanian, Rani Siromoney, V. Rajkumar Dare, Ahmed Saoudi:
Basic Puzzle Grammars and Isosceles Right Triangles. Int. J. Pattern Recognit. Artif. Intell. 6(5): 799-816 (1992) - [j12]David E. Muller, Ahmed Saoudi, Paul E. Schupp:
Alternating Automata, the Weak Monadic Theory of Trees and its Complexity. Theor. Comput. Sci. 97(2): 233-244 (1992) - [c10]David E. Muller, Paul E. Schupp, Ahmed Saoudi:
On the Decidability of the Linear Z-Temporal Logic and the Monadic Second Order Theory. ICCI 1992: 2-5 - [c9]P. Laroche, Maurice Nivat, Ahmed Saoudi:
Context-Sensitivity of Puzzle Grammars. ICPIA 1992: 195-212 - [c8]Ahmed Saoudi:
Parallel Recognition of Multidimensional Images Using Regular Tree Grammars. ICPIA 1992: 231-239 - [c7]Ahmed Saoudi, Maurice Nivat:
Optimal Parallel Algorithms for Multidimensional Image Template Matching and Pattern Matching. ICPIA 1992: 240-246 - [c6]Wojciech Rytter, Ahmed Saoudi:
Parallel algorithms for 2D-image recognition. ICPR (4) 1992: 115-118 - [c5]Ahmed Saoudi, Maurice Nivat, C. Pandu Rangan, Ravi Sundaram, G. D. S. Ramkumar:
A Parallel Algorithm for Recognizing the Shuffle of Two Strings. IPPS 1992: 112-115 - [p4]Ahmed Saoudi, Paola Bonizzoni:
Automata on infinite trees and rational control. Tree Automata and Languages 1992: 189-200 - [p3]Ahmed Saoudi:
Rational and recognizable infinite tree sets. Tree Automata and Languages 1992: 225-234 - [e1]Akira Nakamura, Maurice Nivat, Ahmed Saoudi, Patrick Shen-Pei Wang, Katsushi Inoue:
Parallel Image Analysis, Second International Conference, ICPIA '92, Ube, Japan, December 21-23, 1992, Proceedings. Lecture Notes in Computer Science 654, Springer 1992, ISBN 3-540-56346-6 [contents] - 1991
- [j11]Maurice Nivat, Ahmed Saoudi, K. G. Subramanian, Rani Siromoney, V. Rajkumar Dare:
Puzzle Grammars and Context-Free Array Grammars. Int. J. Pattern Recognit. Artif. Intell. 5(5): 663-676 (1991) - [j10]Wojciech Rytter, Ahmed Saoudi:
On the Complexity of the Recognition of Parallel 2D-Image Languages. Inf. Process. Lett. 38(5): 225-229 (1991) - [j9]Ahmed Saoudi:
Generalized Automata on Infinite Trees and Muller-McNaughton's Theorem. Theor. Comput. Sci. 84(2): 165-177 (1991) - [c4]Maurice Nivat, Ahmed Saoudi:
Parallel Recognition of Two-Dimensional Images. ICPP (3) 1991: 326-327 - 1990
- [j8]Maurice Nivat, Ahmed Saoudi, V. Rajkumar Dare:
Parallel generation of infinite images. Int. J. Comput. Math. 35(1-4): 25-42 (1990) - [j7]Ahmed Saoudi, David E. Muller, Paul E. Schupp:
On the Complexity of omega-Tree Sets and Nerode Theorem. Int. J. Found. Comput. Sci. 1(1): 11-22 (1990)
1980 – 1989
- 1989
- [j6]Maurice Nivat, Ahmed Saoudi:
Automata on Infinite Objects and Their Applications to Logic and Programming. Inf. Comput. 83(1): 41-64 (1989) - [j5]Maurice Nivat, Ahmed Saoudi, V. Rajkumar Dare:
Parallel Generation of Finite Images. Int. J. Pattern Recognit. Artif. Intell. 3(3-4): 279-294 (1989) - [j4]Ahmed Saoudi, K. Rangarajan, V. Rajkumar Dare:
Finite Images Generated by GL-Systems. Int. J. Pattern Recognit. Artif. Intell. 3(3-4): 459-468 (1989) - [c3]Ahmed Saoudi:
Pushdown Automata on Infinite Trees and Omega-Kleene closure of Context-Free Tree Sets. MFCS 1989: 445-457 - [p2]Maurice Nivat, Ahmed Saoudi, V. Rajkumar Dare:
Parallel Generation of Finite Images. Array Grammars, Patterns and Recognizers 1989: 1-16 - [p1]Ahmed Saoudi, K. Rangarajan, V. Rajkumar Dare:
Finite Images Generated by GL-Systems. Array Grammars, Patterns and Recognizers 1989: 181-190 - 1988
- [j3]Maurice Nivat, Ahmed Saoudi:
Automata on infinite trees and Kleene closure of regular tree sets. Bull. EATCS 36: 131-136 (1988) - [c2]David E. Muller, Ahmed Saoudi, Paul E. Schupp:
Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time. LICS 1988: 422-427 - 1986
- [j2]Ahmed Saoudi:
Variétés d'Automates Descendants d'Arbres Infinis. Theor. Comput. Sci. 43: 315-335 (1986) - [c1]David E. Muller, Ahmed Saoudi, Paul E. Schupp:
Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity. ICALP 1986: 275-283 - 1984
- [j1]Ahmed Saoudi:
Infinitary Tree Languages Recognized by omega-Automata. Inf. Process. Lett. 18(1): 15-19 (1984)
Coauthor Index
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 2025-01-09 13:02 CET 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:
