code completion - researchr tag

researchr

You are not signed in
Sign in
Sign up

2012

Declarative Specification of Template-Based Textual EditorsTobi Vollebregt, Lennart C. L. Kats, Eelco Visser. LDTA 2012: [doi]

2011

Code completion of multiple keywords from abbreviated inputSangmok Han, David R. Wallace, Robert C. Miller. ASE, 18(3-4):363-398, 2011. [doi]

2010

Practical completion detection for 2-of-N delay-insensitive codesMarco Cannizzaro, WeiWei Jiang, Steven M. Nowick. iccd 2010: 151-158 [doi]

The Spoofax language workbench: rules for declarative specification of languages and IDEsLennart C. L. Kats, Eelco Visser. OOPSLA 2010: 444-463 [doi]

Textual modeling tools: overview and comparison of language workbenchesBernhard Merkle. In SPLASH '10: Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion. 2010: [doi]

Calcite: Completing Code Completion for Constructors Using CrowdsMathew Mooty, Andrew Faulring, Jeffrey Stylos, Brad A. Myers. vl 2010: 15-22 [doi]

Improving code completion with program historyRomain Robbes, Michele Lanza. ASE, 17(2):181-212, 2010. [doi]

A generic video coding framework based on anisotropic diffusion and spatio-temporal completionZhe Yuan, Hongkai Xiong, Yuan F. Zheng. icassp 2010: 926-929 [doi]

2009

2008

How Program History Can Improve Code CompletionRomain Robbes, Michele Lanza. ASE 2008: 317-326 [doi]

The Use of Product Measures in Tracking Code Development to Completion within Small to Medium Sized EnterprisesM. P. Ware, F. George Wilkie, Mary Shapcott, N. G. Lester. sera 2008: 263-270 [doi]

Redundant multiscale structure coding for error resilient video completionLei Yang, Hongkai Xiong. iscas 2008: 3578-3581 [doi]

2007

IMP: a meta-tooling platform for creating language-specific ides in eclipsePhilippe Charles, Robert M. Fuhrer, Stanley M. Sutton Jr.. ASE 2007: 485-488 [doi]

Finite Completions via Factorizing CodesClelia de Felice. ijac, 17(4):715-760, 2007. [doi]

2006

On the Completion of Codes in Submonoids with Finite RankJean Neraud. FUIN, 74(4):549-562, 2006. [doi]

2005

Deterministic network coding by matrix completionNicholas J. A. Harvey, David R. Karger, Kazuo Murota. soda 2005: 489-498 [doi]

2004

Finite Completion of comma-free codes. Part 2Nguyen Huong Lam. ita, 38(2):117-136, 2004. [doi]

Finite Completion of comma-free codes. Part 1Nguyen Huong Lam. ita, 38(2):91-115, 2004. [doi]

2003

Pattern completion through phase coding in population neurodynamicsAgustin Gutierrez-Galvez, Ricardo Gutierrez-Osuna. NN, 16(5-6):649-656, 2003. [doi]

Deriving tolerant grammars from a base-line grammarSteven Klusener, Ralf Lämmel. ICSM 2003: 179 [doi]

Completion of codes with finite bi-decoding delaysLiang Zhang, Kar-Ping Shum, Shou-Li Peng. TCS, 306(1-3):123-137, 2003. [doi]

2002

Finite Completion of Comma-Free Codes. Part INguyen Huong Lam. dlt 2003: 357-368 [doi]

1997

A Completion Algorithm for Codes with Bounded Synchronization DelayVéronique Bruyère. icalp 1997: 87-97

Hajós Factorizations and Completion of CodesNguyen Huong Lam. TCS, 182(1-2):245-256, 1997. [doi]

1996

On Codes Having no Finite CompletionNguyen Huong Lam. ita, 30(6):483-493, 1996.

1995

On Codes Having no Finite CompletionNguyen Huong Lam. ita, 29(2):145-155, 1995.

A Note on Codes Having no Finite CompletionsNguyen Huong Lam. ipl, 55(4):185-188, 1995. [doi]

Completion of Recognizable Bifix CodesLiang Zhang, Zhonghui Shen. TCS, 145(1&2):345-355, 1995. [doi]

1994

On Codes Having no Finite CompletionNguyen Huong Lam. STACS 1994: 691-698

1989

Completion of Finite Codes with Finite Deciphering DelayVéronique Bruyère. icalp 1989: 151-163

1988

On the finite completion of codesClelia de Felice. eatcs, 34:52-54, 1988.