Anthony Widjaja Lin

Anthony Widjaja To

	2012
j5		Pablo Barceló, Leonid Libkin, Anthony Widjaja Lin, Peter T. Wood: Expressive Languages for Path Queries over Graph-Structured Data. ACM Trans. Database Syst. 37(4): 31 (2012)
c13		Matthew Hague, Anthony Widjaja Lin: Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters. CAV 2012: 260-276
c12		Anthony Widjaja Lin: Accelerating tree-automatic relations. FSTTCS 2012: 313-324
c11		Anthony Widjaja Lin: Weakly-Synchronized Ground Tree Rewriting - (with Applications to Verifying Multithreaded Programs). MFCS 2012: 630-642
c10		Stefan Göller, Anthony Widjaja Lin: Concurrency Makes Simple Theories Hard. STACS 2012: 148-159
	2011
c9		Matthew Hague, Anthony Widjaja Lin: Model Checking Recursive Programs with Numeric Data Types. CAV 2011: 743-759
c8		Stefan Göller, Anthony Widjaja Lin: Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems. CONCUR 2011: 543-558
c7		Stefan Göller, Anthony Widjaja Lin: The Complexity of Verifying Ground Tree Rewrite Systems. LICS 2011: 279-288
	2010
j4		James Bailey, Guozhu Dong, Anthony Widjaja To: Logical queries over views: Decidability and expressiveness. ACM Trans. Comput. Log. 11(2) (2010)
c6		Anthony Widjaja To, Leonid Libkin: Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems. FOSSACS 2010: 221-236
c5		Matthew Hague, Anthony Widjaja To: The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems. FSTTCS 2010: 228-239
c4		Eryk Kopczynski, Anthony Widjaja To: Parikh Images of Grammars: Complexity and Applications. LICS 2010: 80-89
i4		Anthony Widjaja To: Parikh Images of Regular Languages: Complexity and Applications. CoRR abs/1002.1464 (2010)
	2009
j3		Anthony Widjaja To: Unary finite automata vs. arithmetic progressions. Inf. Process. Lett. 109(17): 1010-1014 (2009)
c3		Anthony Widjaja To: Model Checking FO(R) over One-Counter Processes and beyond. CSL 2009: 485-499
c2		Stefan Göller, Richard Mayr, Anthony Widjaja To: On the Computational Complexity of Verifying One-Counter Processes. LICS 2009: 235-244
i3		Anthony Widjaja To, Leonid Libkin: Algorithmic metatheorems for decidable LTL model checking over infinite systems. CoRR abs/0910.4932 (2009)
	2008
c1		Anthony Widjaja To, Leonid Libkin: Recurrent Reachability Analysis in Regular Model Checking. LPAR 2008: 198-213
i2		James Bailey, Guozhu Dong, Anthony Widjaja To: Logical Queries over Views: Decidability and Expressiveness. CoRR abs/0803.2559 (2008)
i1		Anthony Widjaja To: Unary finite automata vs. arithmetic progressions. CoRR abs/0812.1291 (2008)
	2006
j2		Anthony Widjaja To: Review of "Algebraic Complexity Theory by Peter Bürgisser, Michael Clausen and Amin Shokrollahi", Springer 1997. SIGACT News 37(2): 22-27 (2006)
	2003
j1		Anthony Widjaja To: Review of Algorithms sequential & parallel: a unified approach by R. Miller & L. Boxer. Prentice Hall 2000. SIGACT News 34(2): 3-5 (2003)

Coauthor Index

Colors in the list of coauthors

Last update Tue May 21 22:03:53 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page