default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaude Laflamme
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j29]Anthony Bonato, Claude Laflamme, M. Pawliuk, Norbert Sauer:
Distinguishing Number of Universal Homogeneous Urysohn Metric Spaces. Electron. J. Comb. 29(3) (2022)- 2021
- [j28]Claude Laflamme, Maurice Pouzet, Norbert Sauer, Robert E. Woodrow:
Siblings of an ℵ0-categorical relational structure. Contributions Discret. Math. 16(2): 90-127 (2021) - [j27]Andrés Aranda
, Claude Laflamme, Dániel T. Soukup, Robert E. Woodrow:
A universal partition result for infinite homogeneous Kn-free and related graphs. Discret. Math. 344(1): 112153 (2021) - [j26]Claude Laflamme, Maurice Pouzet, Norbert Sauer, Robert E. Woodrow:
The Poset of Copies for Automorphism Groups of Countable Relational Structures. J. Multiple Valued Log. Soft Comput. 36(4-5): 353-381 (2021)
2010 – 2019
- 2019
- [j25]Claude Laflamme, Andrés Aranda, Dániel T. Soukup, Robert E. Woodrow:
Balanced independent sets in graphs omitting large cliques. J. Comb. Theory B 137: 1-9 (2019) - 2017
- [j24]Claude Laflamme, Maurice Pouzet, Robert E. Woodrow:
Equimorphy: the case of chains. Arch. Math. Log. 56(7-8): 811-829 (2017) - 2016
- [j23]Natasha Dobrinen, Claude Laflamme, Norbert Sauer:
Rainbow Ramsey simple structures. Discret. Math. 339(11): 2848-2855 (2016) - 2014
- [j22]Jakub Jasinski, Claude Laflamme, Lionel Nguyen Van Thé, Robert E. Woodrow:
Ramsey Precompact Expansions of Homogeneous Directed Graphs. Electron. J. Comb. 21(4): 4 (2014) - [j21]Claude Laflamme, Maurice Pouzet, Norbert Sauer, Imed Zaguia:
Pairs of orthogonal countable ordinals. Discret. Math. 335: 35-44 (2014) - 2013
- [j20]Dwight Duffus, Claude Laflamme, Maurice Pouzet, Robert E. Woodrow:
Convex sublattices of a lattice and a fixed point property. Contributions Discret. Math. 8(1) (2013) - 2011
- [j19]Claude Laflamme, Lionel Nguyen Van Thé, Maurice Pouzet, Norbert W. Sauer:
Partitions and indivisibility properties of countable dimensional vector spaces. J. Comb. Theory A 118(1): 67-77 (2011) - 2010
- [j18]Claude Laflamme, Lionel Nguyen Van Thé, Norbert W. Sauer:
Partition properties of the dense local order and a colored version of Milliken's theorem. Comb. 30(1): 83-104 (2010) - [j17]Claude Laflamme, Lionel Nguyen Van Thé, Norbert Sauer:
Distinguishing Number of Countable Homogeneous Relational Structures. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j16]Claude Laflamme, Karen Seyffarth:
Distinguishing Chromatic Numbers of Bipartite Graphs. Electron. J. Comb. 16(1) (2009) - 2007
- [j15]Christian Delhommé, Claude Laflamme, Maurice Pouzet, Norbert Sauer:
Divisibility of countable metric spaces. Eur. J. Comb. 28(6): 1746-1769 (2007) - 2006
- [j14]Claude Laflamme, Norbert W. Sauer, Vojkan Vuksanovic:
Canonical Partitions Of Universal Structures. Comb. 26(2): 183-205 (2006) - 2004
- [c13]Milan Jelinek, Redwan Salami, Sassan Ahmadi, Bruno Bessette, Philippe Gournay, Claude Laflamme:
On the architecture of the cdma2000® variable-rate multimode wideband (VMR-WB) speech coding standard. ICASSP (1) 2004: 281-284
1990 – 1999
- 1999
- [j13]Claude Laflamme, Marion Scheepers:
Combinatorial Properties of Filters and Open Covers for Sets of Real Numbers. J. Symb. Log. 64(3): 1243-1260 (1999) - 1998
- [j12]Claude Laflamme, István Szalkai:
Counting Simplexes in R3. Electron. J. Comb. 5 (1998) - [j11]Claude Laflamme, Jian-Ping Zhu:
The Rudin-Blass Ordering of Ultrafilters. J. Symb. Log. 63(2): 584-592 (1998) - [j10]Redwan Salami, Claude Laflamme, Jean-Pierre Adoul, Akitoshi Kataoka, Shinji Hayashi, Takehiro Moriya, Claude Lamblin, Dominique Massaloux, Stéphane Proust, Peter Kroon, Yair Shoham:
Design and description of CS-ACELP: a toll quality 8 kb/s speech coder. IEEE Trans. Speech Audio Process. 6(2): 116-130 (1998) - 1997
- [j9]Redwan Salami, Claude Laflamme, Bruno Bessette, Jean-Pierre Adoul:
ITU-T G.729 Annex A: reduced complexity 8 kb/s CS-ACELP codec for digital simultaneous voice and data. IEEE Commun. Mag. 35(9): 56-63 (1997) - [c12]Roch Lefebvre, Claude Laflamme:
Spectral amplitude warping (SAW) for noise spectrum shaping in audio coding. ICASSP 1997: 335-338 - [c11]Tero Honkanen, Janne Vainio, Kari Järvinen, Petri Haavisto, Redwan Salami, Claude Laflamme, Jean-Pierre Adoul:
Enhanced full rate speech codec for IS-136 digital cellular system. ICASSP 1997: 731-734 - [c10]Kari Järvinen, Janne Vainio, Pekka Kapanen, Tero Honkanen, Petri Haavisto, Redwan Salami, Claude Laflamme, Jean-Pierre Adoul:
GSM enhanced full rate speech codec. ICASSP 1997: 771-774 - [c9]Redwan Salami, Claude Laflamme, Bruno Bessette, Jean-Pierre Adoul:
Description of ITU-T Recommendation G.729 Annex A: reduced complexity 8 kbit/s CS-ACELP codec. ICASSP 1997: 775-778 - [c8]Redwan Salami, Claude Laflamme, Jean-Pierre Adoul, Kari Järvinen, Janne Vainio, Pekka Kapanen, Tero Honkanen, Petri Haavisto:
Description of GSM Enhanced Full Rate Speech Codec. ICC (2) 1997: 725-729 - 1996
- [j8]Claude Laflamme:
A Few Special Ordinal Ultrafilters. J. Symb. Log. 61(3): 920-927 (1996) - [c7]Claude Laflamme, Redwan Salami, Ridha Matmti, Jean-Pierre Adoul:
Harmonic-stochastic excitation (HSX) speech coding below 4 kbit/s. ICASSP 1996: 204-207 - 1994
- [j7]Claude Laflamme:
Bonnding and Dominating Number of Families of Functions on ω. Math. Log. Q. 40: 207-223 (1994) - [c6]Redwan Salami, Claude Laflamme, Jean-Pierre Adoul:
8 kbit/s ACELP coding of speech with 10 ms speech-frame: a candidate for CCITT standardization. ICASSP (2) 1994: 97-100 - [c5]Roch Lefebvre, Redwan Salami, Claude Laflamme, Jean-Pierre Adoul:
High quality coding of wideband audio signals using transform coded excitation (TCX). ICASSP (1) 1994: 193-196 - 1993
- [j6]Saharon Shelah, Claude Laflamme, Bradd Hart:
Models with Second Order Properties V: A General Principle. Ann. Pure Appl. Log. 64(2): 169-194 (1993) - [c4]Roch Lefebvre, Redwan Salami, Claude Laflamme, Jean-Pierre Adoul:
8 kbit/s coding of speech with 6 ms frame-length. ICASSP (2) 1993: 612-615 - 1991
- [c3]Claude Laflamme, Jean-Pierre Adoul, Redwan Salami, Sarto Morissette, Philippe Mabilleau:
16 kbps wideband speech coding technique based on algebraic CELP. ICASSP 1991: 13-16 - 1990
- [j5]Kevin J. Compton, Claude Laflamme:
An Algebra and a Logic for NC¹. Inf. Comput. 87(1/2): 240-262 (1990) - [j4]Claude Laflamme:
Upward Directedness of the Rudin-Keisler Ordering of P-Points. J. Symb. Log. 55(2): 449-456 (1990) - [c2]Claude Laflamme, Jean-Pierre Adoul, H. Y. Su, Sarto Morissette:
On reducing computational complexity of codebook search in CELP coder through the use of algebraic codes. ICASSP 1990: 177-180
1980 – 1989
- 1989
- [j3]Claude Laflamme:
Forcing with Filters and Complete Combinatorics. Ann. Pure Appl. Log. 42(2): 125-163 (1989) - [j2]Andreas Blass, Claude Laflamme:
Consistency Results About Filters and the Number of Inequivalent Growth Types. J. Symb. Log. 54(1): 50-56 (1989) - 1988
- [c1]Kevin J. Compton, Claude Laflamme:
An Algebra and a Logic for NC¹. LICS 1988: 12-21 - 1983
- [j1]William S. Hatcher, Claude Laflamme:
On the Order Structure of the Hyperreal Line. Math. Log. Q. 29(4): 197-202 (1983)
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 2024-07-08 21:30 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:
