default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDanny Dubé
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c25]Danny Dubé:
Entropy Coders Based on the Splitting of Lexicographic Intervals. DCC 2020: 366
2010 – 2019
- 2019
- [c24]Danny Dubé:
Lossless Compression of Grayscale and Colour Images Using Multidimensional CSE. ISPA 2019: 222-227 - [c23]Danny Dubé, Hidetoshi Yokoo:
Fast Construction of Almost Optimal Symbol Distributions for Asymmetric Numeral Systems. ISIT 2019: 1682-1686 - 2018
- [c22]Manuel Martínez
, Kai Sandfort, Danny Dubé, Joan Serra-Sagristà:
Improving Marlin's Compression Ratio with Partially Overlapping Codewords. DCC 2018: 325-334 - [c21]Danny Dubé, Fatma Haddad:
Optimal Single- and Multiple-Tree Almost Instantaneous Variable-to-Fixed Codes. DCC 2018: 405 - [c20]Danny Dubé, Fatma Haddad:
Individually Optimal Single- and Multiple-Tree Almost Instantaneous Variable-to-Fixed Codes. ISIT 2018: 2192-2196 - [c19]Danny Dubé:
Arbitrarily Low Redundancy Construction of Balanced Codes Using Realistic Resources. ISITA 2018: 595-599 - 2017
- [c18]Danny Dubé, Mounir Mechqrane:
Almost minimum-redundancy construction of balanced codes using limited-precision integers. CWIT 2017: 1-5 - 2016
- [i1]Dany Vohl, Claude-Guy Quimper, Danny Dubé:
Finding Synchronization Codes to Boost Compression by Substring Enumeration. CoRR abs/1605.08102 (2016) - 2015
- [c17]Ahmad Al-Rababa'a, Danny Dubé:
Using bit recycling to reduce the redundancy in plurally parsable dictionaries. CWIT 2015: 62-65 - [c16]Ahmad Al-Rababa'a, Danny Dubé:
A finite-precision adaptation of bit recycling to arithmetic coding. ISSPIT 2015: 472-477 - 2014
- [j5]Martin Beaudry, Danny Dubé, Maxime Dubé, Mario Latendresse, Pascal Tesson:
Conservative groupoids recognize only regular languages. Inf. Comput. 239: 13-28 (2014) - [c15]Mathieu Beliveau, Danny Dubé:
Improving Compression via Substring Enumeration by Explicit Phase Awareness. DCC 2014: 399 - 2013
- [c14]Ahmad Al-Rababa'a, Danny Dubé, Jean-Yves Chouinard:
Using bit recycling to reduce Knuth's balanced codes redundancy. CWIT 2013: 6-11 - 2012
- [c13]Danny Dubé, Mario Latendresse, Pascal Tesson:
Conservative Groupoids Recognize Only Regular Languages. LATA 2012: 216-227 - 2011
- [c12]Danny Dubé:
On the Use of Stronger Synchronization to Boost Compression by Substring Enumeration. DCC 2011: 454 - [c11]Danny Dubé, Hidetoshi Yokoo:
The universality and linearity of compression by substring enumeration. ISIT 2011: 1519-1523 - 2010
- [j4]Heidar Pirzadeh, Danny Dubé, Abdelwahab Hamou-Lhadj:
An Extended Proof-Carrying Code Framework for Security Enforcement. Trans. Comput. Sci. 11: 249-269 (2010) - [c10]Danny Dubé, Vincent Beaudoin:
Lossless Data Compression via Substring Enumeration. DCC 2010: 229-238 - [c9]Danny Dubé:
Using synchronization bits to boost compression by substring enumeration. ISITA 2010: 82-87
2000 – 2009
- 2009
- [c8]Danny Dubé, Vincent Beaudoin:
Constructing optimal whole-bit recycling codes. ITW 2009: 27-31 - 2008
- [c7]Heidar Pirzadeh, Danny Dubé:
VEP: a virtual machine for extended proof-carrying code. VMSec 2008: 9-18 - [c6]Danny Dubé, Vincent Beaudoin:
All-Match LZ77 Bit Recycling. DCC 2008: 513 - [c5]Danny Dubé, Vincent Beaudoin:
Improving LZ77 bit recycling using all matches. ISIT 2008: 985-989 - [c4]Heidar Pirzadeh, Danny Dubé:
Encoding the Program Correctness Proofs as Programs in PCC Technology. PST 2008: 121-132 - 2007
- [c3]Danny Dubé, Vincent Beaudoin:
Bit Recycling with Prefix Codes. DCC 2007: 379 - 2005
- [j3]Danny Dubé, Marc Feeley:
BIT: A Very Compact Scheme System for Microcontrollers. High. Order Symb. Comput. 18(3-4): 271-298 (2005) - 2002
- [c2]Danny Dubé, Marc Feeley:
A demand-driven adaptive type analysis. ICFP 2002: 84-97 - 2000
- [j2]Danny Dubé, Marc Feeley:
Efficiently building a parse tree from a regular expression. Acta Informatica 37(2): 121-144 (2000)
1990 – 1999
- 1996
- [j1]Jean-Yves Potvin, Danny Dubé, Christian Robillard:
A Hybrid Approach to Vehicle Routing Using Neural Networks and Genetic Algorithms. Appl. Intell. 6(3): 241-252 (1996) - 1994
- [c1]Jean-Yves Potvin, Danny Dubé:
Improving a Vehicle Routing Heuristic Through Genetic Search. International Conference on Evolutionary Computation 1994: 194-199
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-05-08 21:04 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:
