|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 25 occurrences of 22 keywords
|
|
|
Results
Found 48 publication records. Showing 48 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
51 | Mikolaj Bojanczyk, Thomas Colcombet |
Tree-walking automata do not recognize all regular languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 234-243, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
50 | Frank Neven |
On the Power of Walking for Querying Tree-Structured Data. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 3-5, Madison, Wisconsin, USA, pp. 77-84, 2002, ACM, 1-58113-507-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
46 | Balder ten Cate, Luc Segoufin |
XPath, transitive closure logic, and nested tree walking automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2008, June 9-11, 2008, Vancouver, BC, Canada, pp. 251-260, 2008, ACM, 978-1-60558-108-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
tree walking automata, xpath, xml, transitive closure |
44 | Joost Engelfriet |
The time complexity of typechecking tree-walking tree transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 46(2), pp. 139-154, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
44 | Mikolaj Bojanczyk, Thomas Colcombet |
Tree-Walking Automata Cannot Be Determinized. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 246-256, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
37 | Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz |
Random Generation of Deterministic Tree (Walking) Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009. Proceedings, pp. 115-124, 2009, Springer, 978-3-642-02978-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
35 | Owen Rambow, Giorgio Satta |
A Rank Hierarchy for Determinsitic Tree-Walking Transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: Trees in Algebra and Programming - CAAP'94, 19th International Colloquium, Edinburgh, UK, April 11-13, 1994, Proceedings, pp. 309-321, 1994, Springer, 3-540-57879-X. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
32 | Mathias Samuelides, Luc Segoufin |
Complexity of Pebble Tree-Walking Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings, pp. 458-469, 2007, Springer, 978-3-540-74239-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Leonid Bolotnyy, Gabriel Robins |
Randomized Pseudo-random Function Tree Walking Algorithm for Secure Radio-Frequency Identification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AutoID ![In: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (AutoID 2005), 16-18 October 2005, Buffalo, NY, USA, pp. 43-48, 2005, IEEE Computer Society, 0-7695-2475-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Kai Salomaa, Sheng Yu 0001, Jinfeng Zan |
Deterministic Caterpillar Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 12th International Conference, CIAA 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers, pp. 97-108, 2007, Springer, 978-3-540-76335-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
tree walking automata, decidability, regular expressions, determinism |
30 | Frank Neven, Thomas Schwentick |
On the Power of Tree-Walking Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 547-560, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
30 | Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin |
Expressive Power of Pebble Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 157-168, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Mikolaj Bojanczyk |
Tree-Walking Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers, pp. 1-2, 2008, Springer, 978-3-540-88281-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Wonjoon Choi, Byeong-Hee Roh |
Backward Channel Protection Method for RFID Security Schemes Based on Tree-Walking Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (4) ![In: Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part IV, pp. 279-287, 2006, Springer, 3-540-34077-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Harry M. Sneed, Shihong Huang |
WSDLTest - A Tool for Testing Web Services. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WSE ![In: Eighth IEEE International Workshop on Web Site Evolution (WSE 2006), 22-24 September 2006, Philadelphia, Pennsylvania, USA, pp. 14-21, 2006, IEEE Computer Society, 0-7695-2696-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
WSDL interfaces, tree walking, test result validation, Web services, SOA, XML schema, test data generation, test automation |
23 | Ari Juels, John G. Brainard |
Soft blocking: flexible blocker tags on the cheap. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WPES ![In: Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society, WPES 2004, Washington, DC, USA, October 28, 2004, pp. 1-7, 2004, ACM, 1-58113-968-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
blocker tags, tree-walking, privacy, RFID tags, ALOHA |
23 | Ari Juels, Ronald L. Rivest, Michael Szydlo |
The blocker tag: selective blocking of RFID tags for consumer privacy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCS ![In: Proceedings of the 10th ACM Conference on Computer and Communications Security, CCS 2003, Washington, DC, USA, October 27-30, 2003, pp. 103-111, 2003, ACM, 1-58113-738-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
tree walking, privacy, RFID tags, barcodes |
23 | Mikolaj Bojanczyk |
1-Bounded TWA Cannot Be Determinized. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings, pp. 62-73, 2003, Springer, 3-540-20680-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Joost Engelfriet, Kazuhiro Inaba, Sebastian Maneth |
Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 58(1-2), pp. 95-152, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
19 | Joost Engelfriet, Kazuhiro Inaba, Sebastian Maneth |
Linear Bounded Composition of Tree-Walking Tree Transducers: Linear Size Increase and Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1904.09203, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
19 | Mikolaj Bojanczyk |
It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 154(1-4), pp. 37-46, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
19 | Mikolaj Bojanczyk |
It is undecidable if two regular tree languages can be separated by a deterministic tree-walking automaton. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1703.04997, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
19 | Kaleb Lee, Colin Boyd, Juan Manuel González Nieto |
Minimizing Information Leakage of Tree-Based RFID Authentication Protocols Using Alternate Tree-Walking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy - 17th Australasian Conference, ACISP 2012, Wollongong, NSW, Australia, July 9-11, 2012. Proceedings, pp. 434-441, 2012, Springer, 978-3-642-31447-6. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Sándor Vágvölgyi |
Top-Down Tree Transducers with Two-Way Tree Walking Look-Ahead. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 93(1), pp. 43-74, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
16 | Stephen B. Peckham |
Globally Partitionable Attribute Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAGA ![In: Attribute Grammars and their Applications, International Conference WAGA, Paris, France, September 19-21, 1990, Proceedings, pp. 327-342, 1990, Springer, 3-540-53101-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
14 | Martin Kutrib, Uwe Meyer 0003 |
Deterministic Real-Time Tree-Walking-Storage Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NCMA ![In: Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications, NCMA 2023, Famagusta, North Cyprus, 18th-19th September, 2023., pp. 48-62, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Martin Kutrib, Uwe Meyer 0003 |
Tree-Walking-Storage Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DLT ![In: Developments in Language Theory - 27th International Conference, DLT 2023, Umeå, Sweden, June 12-16, 2023, Proceedings, pp. 182-194, 2023, Springer, 978-3-031-33263-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
14 | Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel |
XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 850, pp. 40-97, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
14 | Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel |
XML Navigation and Transformation by Tree-Walking Automata and Transducers with Visible and Invisible Pebbles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1809.05730, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
14 | Anya Helene Bagge |
Analysis and transformation with the nuthatch tree-walking library. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SLE ![In: Proceedings of the 2015 ACM SIGPLAN International Conference on Software Language Engineering, SLE 2015, Pittsburgh, PA, USA, October 25-27, 2015, pp. 83-88, 2015, ACM, 978-1-4503-3686-4. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
14 | Henrik Björklund, Petter Ericson |
A note on the complexity of deterministic tree-walking transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NCMA ![In: Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13 - August 14, 2013, Proceedings, pp. 69-83, 2013, Österreichische Computer Gesellschaft, 978-3-85403-294-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
14 | Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko |
Loops and overloops for Tree-Walking Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 450, pp. 43-53, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
14 | Sebastian Maneth, Sylvia Friese, Helmut Seidl |
Type Checking of Tree Walking Transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Modern Applications of Automata Theory ![In: Modern Applications of Automata Theory., pp. 325-372, 2012, World Scientific, 978-981-4271-04-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
14 | Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko |
Loops and Overloops for Tree Walking Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata - 16th International Conference, CIAA 2011, Blois, France, July 13-16, 2011. Proceedings, pp. 166-177, 2011, Springer, 978-3-642-22255-9. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
14 | Balder ten Cate, Luc Segoufin |
Transitive closure logic, nested tree walking automata, and XPath. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 57(3), pp. 18:1-18:41, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
14 | Zoltán Fülöp 0001, Lorand Muzamel |
Weighted Tree-Walking Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Cybern. ![In: Acta Cybern. 19(2), pp. 275-293, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
14 | Lorand Muzamel |
Pebble Alternating Tree-Walking Automata and Their Recognizing Power. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Cybern. ![In: Acta Cybern. 18(3), pp. 427-450, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
14 | Wonjoon Choi, Myungchul Yoon, Byeong-Hee Roh |
Backward Channel Protection Based on Randomized Tree-Walking Algorithm and Its Analysis for Securing RFID Tag Information and Privacy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Commun. ![In: IEICE Trans. Commun. 91-B(1), pp. 172-182, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
14 | Mikolaj Bojanczyk, Thomas Colcombet |
Tree-Walking Automata Do Not Recognize All Regular Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 38(2), pp. 658-701, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
14 | Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel |
XML transformation by tree-walking transducers with invisible pebbles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China, pp. 63-72, 2007, ACM, 978-1-59593-685-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
tree transducer, XML, pebble |
14 | Anca Muscholl, Mathias Samuelides, Luc Segoufin |
Complementing deterministic tree-walking automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 99(1), pp. 33-39, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
14 | Mikolaj Bojanczyk, Thomas Colcombet |
Tree-walking automata cannot be determinized. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 350(2-3), pp. 164-173, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
14 | Frank Neven, Thomas Schwentick |
On the power of tree-walking automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 183(1), pp. 86-103, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
14 | Joost Engelfriet, Hendrik Jan Hoogeboom |
Tree-Walking Pebble Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Jewels are Forever ![In: Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pp. 72-83, 1999, Springer, 3-540-65984-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP BibTeX RDF |
|
14 | David J. Weir |
Linear Context-Free Rewriting Systems and Deterministic Tree-Walking Transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACL ![In: 30th Annual Meeting of the Association for Computational Linguistics, 28 June - 2 July 1992, University of Delaware, Newark, Deleware, USA, Proceedings., pp. 136-143, 1992, ACL. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
14 | Tetsuo Moriya |
Pebble machines and tree walking machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 27(2), pp. 99-119, 1982. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
11 | Frank Neven |
Automata, Logic, and XML. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September 22-25, 2002, Proceedings, pp. 2-26, 2002, Springer, 3-540-44240-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
11 | Frank Neven, Thomas Schwentick |
Automata-and Logic-Based Pattern Languages for Tree-Structured Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Semantics in Databases ![In: Semantics in Databases, Second International Workshop, Dagstuhl Castle, Germany, January 7-12, 2001, Revised Papers, pp. 160-178, 2001, Springer, 3-540-00957-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
XML, logic, automata, formal languages, attribute grammars, query evaluation |
Displaying result #1 - #48 of 48 (100 per page; Change: )
|
|