- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i18 |      | Paul Tarau: Tree-based Arithmetic and Compressed Representations of Giant Numbers. CoRR abs/1301.0114 (2013) |
| i17 | | |
| i16 | | |
| 2012 | ||
| j8 | | Paul Tarau: The BinProlog experience: Architecture and implementation choices for continuation passing Prolog and first-class logic engines. TPLP 12(1-2): 97-126 (2012) |
| c68 | | Paul Tarau: Deriving a Fast Inverse of the Generalized Cantor N-tupling Bijection. ICLP (Technical Communications) 2012: 312-322 |
| c67 | | Paul Tarau: A Declarative Specification of Tree-Based Symbolic Arithmetic Computations. PADL 2012: 273-288 |
| c66 | | |
| c65 | | |
| c64 | | Paul Tarau, Brenda Luderman: Boolean Evaluation with a Pairing and Unpairing Function. SYNASC 2012: 384-390 |
| 2011 | ||
| c63 | | |
| c62 | | Paul Tarau: Emulating Primality with Multiset Representations of Natural Numbers. ICTAC 2011: 218-238 |
| c61 | | Paul Tarau: Integrated symbol table, engine and heap memory management in multi-engine prolog. ISMM 2011: 129-138 |
| c60 | | Paul Tarau: Concurrent programming constructs in multi-engine prolog: parallelism just for the cores (and not more!). DAMP 2011: 55-64 |
| i15 | | Paul Tarau: The BinProlog Experience: Architecture and Implementation Choices for Continuation Passing Prolog and First-Class Logic Engines. CoRR abs/1102.1178 (2011) |
| i14 | | |
| i13 | | |
| 2010 | ||
| c59 | | Paul Tarau: A Unified Formal Description of Arithmetic and Set Theoretical Data Types. AISC/MKM/Calculemus 2010: 247-261 |
| c58 | | Paul Tarau: On Arithmetic Computations with Hereditarily Finite Sets, Functions and Types. ICTAC 2010: 367-381 |
| c57 | | |
| i12 | | Paul Tarau: A Unified Formal Description of Arithmetic and Set Theoretical Data Types. CoRR abs/1006.5768 (2010) |
| 2009 | ||
| c56 | | |
| c55 | | |
| c54 | | |
| c53 | | Paul Tarau: Isomorphisms, hylomorphisms and hereditarily finite data types in Haskell. SAC 2009: 1898-1902 |
| 2008 | ||
| c52 | | Paul Tarau, Brenda Luderman: Exact combinational logic synthesis and non-standard circuit design. Conf. Computing Frontiers 2008: 179-188 |
| c51 | | |
| c50 | | |
| i11 | | Paul Tarau, Brenda Luderman: A Logic Programming Framework for Combinational Circuit Synthesis. CoRR abs/0804.2095 (2008) |
| i10 | | |
| i9 | | Paul Tarau: Ranking and Unranking of Hereditarily Finite Functions and Permutations. CoRR abs/0808.0554 (2008) |
| i8 | | Paul Tarau: Pairing Functions, Boolean Evaluation and Binary Decision Diagrams. CoRR abs/0808.0555 (2008) |
| i7 | | |
| i6 | | Paul Tarau: Ranking Catamorphisms and Unranking Anamorphisms on Hereditarily Finite Datatypes. CoRR abs/0808.0753 (2008) |
| i5 | | Paul Tarau: A Functional Hitchhiker's Guide to Hereditarily Finite Sets, Ackermann Encodings and Pairing Functions. CoRR abs/0808.0754 (2008) |
| i4 | | Paul Tarau: Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell. CoRR abs/0808.0760 (2008) |
| i3 | | Paul Tarau: Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell. CoRR abs/0808.2953 (2008) |
| 2007 | ||
| c49 | | Paul Tarau, Brenda Luderman: A Logic Programming Framework for Combinational Circuit Synthesis. ICLP 2007: 180-194 |
| 2005 | ||
| c48 | | Andy Borman, Rada Mihalcea, Paul Tarau: PicNet: Augmenting Semantic Resources with Pictorial Representations. AAAI Spring Symposium: Knowledge Collection from Volunteer Contributors 2005: 1-7 |
| c47 | | David Hurt, Paul Tarau: An empirical evaluation of communication effectiveness in autonomous reactive multiagent systems. SAC 2005: 74-78 |
| c46 | | Paul Tarau, Rada Mihalcea, Elizabeth Figa: Semantic document engineering with WordNet and PageRank. SAC 2005: 782-786 |
| c45 | | |
| 2004 | ||
| c44 | | Rada Mihalcea, Paul Tarau, Elizabeth Figa: PageRank on Semantic Networks, with Application to Word Sense Disambiguation. COLING 2004 |
| c43 | | |
| c42 |  | Elizabeth Figa, Paul Tarau: Conversational Agents as Web Services. International Conference on Internet Computing 2004: 773-782 |
| c41 | | |
| c40 | | Paul Tarau, Elizabeth Figa: Knowledge-based conversational agents and virtual storytelling. SAC 2004: 39-44 |
| i2 | | Paul Tarau, Verónica Dahl: High-Level Networking With Mobile Code And First Order AND-Continuations. CoRR cs.PL/0405088 (2004) |
| 2003 | ||
| c39 | | Qinan Zhou, Paul Tarau: Garbage Collection Algorithms for Java-Based Prolog Engines. PADL 2003: 304-319 |
| 2001 | ||
| j7 | | Paul Tarau, Verónica Dahl: High-Level Networking with Mobile Code and First Order AND-Continuations. TPLP 1(3): 359-380 (2001) |
| c38 | | |
| c37 | | Anima Gupta, Paul Tarau: Logic Programming Techniques for Dynamic VRML Web Content Generation. PADL 2001: 93-107 |
| c36 | | Satyam Tyagi, Paul Tarau: A Most Specific Method Finding Algorithm for Reflection Based Dynamic Prolog-to-Java Interfaces. PADL 2001: 322-336 |
| 2000 | ||
| c35 | | Paul Tarau: Fluents: A Refactoring of Prolog for Uniform Reflection an Interoperation with External Objects. Computational Logic 2000: 1225-1239 |
| 1999 | ||
| j6 | | Verónica Dahl, Stephen Rochefort, Marius Scurtescu, Paul Tarau: A Spanish Interface To LogiMoo: Towards Multilingual Virtual Worlds. Informatica (Slovenia) 23(4) (1999) |
| j5 | | Paul Tarau, Koenraad De Bosschere, Verónica Dahl, Stephen Rochefort: LogiMOO: An Extensible Multi-user Virtual World with Natural Language Control. J. Log. Program. 38(3): 331-353 (1999) |
| j4 | | |
| p1 | | Paul Tarau, Verónica Dahl: Towards a Logic Programming Infrastructure for Internet Programming. Artificial Intelligence Today 1999: 431-457 |
| 1998 | ||
| c34 | | Paul Tarau, Verónica Dahl: Code Migration with First Order Continuations. APPIA-GULP-PRODE 1998: 215-226 |
| c33 | | Paul Tarau: Jinni: a Lightweight Java-based Logic Engine for Internet Programming. Implementation Technology for Programming Languages based on Logic 1998: 1-15 |
| c32 | | |
| 1997 | ||
| j3 | | Paul Tarau, Koenraad De Bosschere, Bart Demoen: On Delphi Lemmas and other Memoing Techniques for Deterministic Logic Programs. J. Log. Program. 30(2): 145-163 (1997) |
| c31 | | Paul Tarau, Verónica Dahl, Stephen Rochefort, Koenraad De Bosschere: LogiMOO: A Multi-User Virtual World with Agents and Natural Language Programming. CHI Extended Abstracts 1997: 323-324 |
| c30 | | Verónica Dahl, Paul Tarau, Renwei Li: Assumption Grammars for Processing Natural Language. ICLP 1997: 256-270 |
| c29 | | Osma R. Zaine, Andrew Fall, Stephen Rochefort, Verónica Dahl, Paul Tarau: On-Une Resource Discovery Using Natural Language. RIAO 1997: 336-356 |
| c28 | | |
| c27 | | Paul Tarau, Verónica Dahl, Koenraad De Bosschere: A Logic Programming Infrastructure for Remote Execution, Mobile Code and Agents. WETICE 1997: 106-112 |
| 1996 | ||
| j2 | | Paul Tarau, Koenraad De Bosschere, Bart Demoen: Partial Translation: Towards a Portable and Efficient Prolog Implementation Technology. J. Log. Program. 29(1-3): 65-83 (1996) |
| j1 | | Koenraad De Bosschere, Paul Tarau: Blackboard-based Extensions in Prolog. Softw., Pract. Exper. 26(1): 49-69 (1996) |
| c26 | | Paul Tarau, Verónica Dahl, Koenraad De Bosschere: Towards Logic Programming Based Coordination in Virtual Worlds. Coordination Technology for Collaborative Applications 1996: 49-62 |
| c25 | | Paul Tarau, Verónica Dahl, Andrew Fall: Backtrackable State with Linear Affine Implication and Assumption Grammars. ASIAN 1996: 53-63 |
| c24 | | Verónica Dahl, Andrew Fall, Stephen Rochefort, Paul Tarau: A Hypothetical Reasoning-based Framework for NL Processing. ICTAI 1996: 67-70 |
| c23 | | Bart Demoen, Geert Engels, Paul Tarau: Segment order preserving copying garbage collection for WAM based Prolog. SAC 1996: 380-386 |
| 1995 | ||
| c22 | | |
| c21 | | |
| c20 | | Paul Tarau, Bart Demoen, Koenraad De Bosschere: The power of partial tanslation: an experiment with the C-ification of binary Prolog. SAC 1995: 152-156 |
| c19 | | |
| c18 | | Paul Tarau, Verónica Dahl, Andrew Fall: Backtrackable State with Linear Assumptions, Continuations and Hidden Accumulator Grammars. ILPS 1995: 642 |
| i1 | | Verónica Dahl, Paul Tarau, Lidia Moreno, Manuel Palomar: Treating Coordination with Datalog Grammars. CoRR cmp-lg/9505006 (1995) |
| 1994 | ||
| c17 | | |
| c16 | | |
| c15 | | Paul Tarau: Low-level issues in implementing a high-performance continuation passing Binary Prolog engine. JFPLC 1994: 287- |
| c14 | | Paul Tarau, Verónica Dahl: Logic Programming and Logic Grammars with First-Order Continuations. LOPSTR 1994: 215-230 |
| c13 | | Paul Tarau, Ulrich Neumerkel: A Novel Term Compression Scheme and Data Representation in the BinWAM. PLILP 1994: 73-87 |
| c12 | | Koenraad De Bosschere, Paul Tarau: High performance continuation passing style Prolog-to-C mapping. SAC 1994: 383-387 |
| 1993 | ||
| c11 | | |
| c10 | | Paul Tarau, Koenraad De Bosschere: Memoing with Abstract Answers and Delphi Lemmas. LOPSTR 1993: 196-209 |
| c9 | | |
| c8 | | Paul Tarau: An Efficient Specialization of the WAM for Continuation Passing Binary Programs. ILPS 1993: 652 |
| c7 | | Koenraad De Bosschere, Paul Tarau: Blackboard-based Extensions for Parallel Programming in BinProlog. ILPS 1993: 664 |
| 1992 | ||
| c6 | | Paul Tarau: Ecological Memory Management in a Continuation Passing Prolog Engine. IWMM 1992: 344-356 |
| c5 | | |
| 1991 | ||
| c4 | | Paul Tarau, Michel Boyer: Nonstandard Answers of Elementary Logic Programs. ICLP Workshop on Construction of Logic Programs 1991: 279-300 |
| c3 | | Paul Tarau: Program Transformations and WAM-Support for the Compilation of Definite Metaprograms. RCLP 1991: 462-473 |
| 1990 | ||
| c2 | | |
| 1988 | ||
| c1 | | |
Colors in the list of coauthors
Last update Tue May 21 05:06:18 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page