Publications of Miklós Maróti


Manuscripts
Mathematics
Journals
  1. J. Kincses, G. Makay, M. Maróti, J. Osztényi and L. Zádori, A Special case of the Stahl conjecture, European Journal of Combinatorics 34 (2013), 502–511. (doi)

  2. P. Marković, M. Maróti and R. McKenzie, Finitely related clones and algebras with cube-terms, Order 29 Issue 2 (2012), 345–359. (doi)

  3. M. Maróti and L. Zádori, Reflexive digraphs with near-unanimity polymorphisms, Discrete Mathematics 312, Issue 15 (2012), 2316–2328. (doi)

  4. G. Czédli and M. Maróti, On the height of order ideals, Mathematica Bohemica 135 (2010), 69–80.
    • E. K. Horváth, Z. Németh and G. Pluhár, The number of triangular islands on a triangular grid, Periodica Mathematica Hungarica, 58 (2009), no 1, 25–34.

  5. L. Barto, M. Kozik, M. Maróti, R. McKenzie and T. Niven, Congruence modularity implies cyclic terms for finite algebras, Algebra Universalis 61 (2009), no. 3–4, 365–380. (doi)
    • V. Bárány, G. Gottlob and M. Otto, Querying the Guarded Fragment, in 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010), 1–10.

  6. W. Dziobiak, J. Jeľek and M. Maróti, Minimal varieties and quasivarieties of semilattices with one automorphism, Semigroup Forum 78 (2009), no. 2, 253–261. (doi)

  7. L. Barto, M. Kozik, M. Maróti and T. Niven, CSP dichotomy for special triads, Proceedings of the AMS 137 (2009), 2921–2934. (doi)
    • B. Trotta, Residual properties of pre-bipartite digraphs, Algebra Universalis (14 November 2010), pp. 1–26.
    • V. Kolmogorov and S. Zivný, The complexity of conservative finite-valued CSPs, http://arxiv.org/abs/1008.1555v1.
    • P. Hell and A. Rafiey, Duality for min-max orderings and dichotomy for min cost homomorphisms, http://arxiv.org/abs/0907.3016v1.
    • V. Kolmogorov, A dichotomy theorem for conservative general-valued CSPs, http://arxiv.org/abs/1008.4035v1.
    • D. A. Cohen‚ P. Creed‚ P. G. Jeavons and S. Zivný, An algebraic theory of complexity for valued constraints: establishing a galois connection, University of Oxford, RR-10-16.
    • A. Atserias and M. Weyer, Decidable relationships between consistency notions for constraint satisfaction problems, Lecture Notes in Computer Science, 2009, vol. 5771/2009, 102–116.

  8. W. Dziobiak, M. Maróti, R. McKenzie and A. Nurakunov, The weak extension property and finite axiomatizability for quasivarieties, Fundamenta Mathematicae 202 (2009), 199–223. (doi)

  9. J. Jeľek, T. Kepka and M. Maróti, The endomorphism semiring of a semilattice, Semigroup Forum 78 (2009), no. 1, 21–26. (doi)

  10. G. Czédli and M. Maróti, Two notes on the variety generated by planar modular lattices, Order 26 (2009), no. 2, 109–117. (doi)

  11. M. Maróti, The existence of a near-unanimity term in a finite algebra is decidable, Journal of Symbolic Logic 74 (2009), no. 3, 1001–1014. (doi)
    • B. Larose, C. Loten and C. Tardif, A characterisation of first-order constraint satisfaction problems, Proc. of the 21st IEEE Symposium on Logic in Computer Science (LICS), 2006, 201–210.
    • P. Idziak, P. Marković, R. McKenzie, M. Valeriote and R. Willard, Tractability and learnability arising from algebras with few subpowers, in Porc. 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 213–224.
    • J. Foniok and C. Tardif, Adjoint functors and tree duality, Discrete Mathematics & Theoretical Computer Science, vol. 11, no. 2 (2009), 97–110.
    • C. Loten and C. Tardif, Near-unanimity polymorphisms on structures with finite duality, preprint (2008), 10 pages.

  12. C. Carvalho, V. Dalmau, P. Marković and M. Maróti, CD(4) has bounded width, Algebra Universalis 60 (2009), no. 3, 293–307. (doi)
    • A. A. Bulatov, A. Krokhin and B. Larose, Dualities for constraint satisfaction problems, Lecture Notes in Computer Science, 2008, Volume 5250/2008, 93–124.

  13. G. Czédli, M. Maróti and E. T. Schmidt, On the scope of averaging for Frankl's conjecture, Order 26 (2009), no. 1, 31–48. (doi)
    • E. K. Horváth, Z. Németh and G. Pluhár, The number of triangular islands on a triangular grid, Periodica Mathematica Hungarica, 58 (2009), no 1, 25–34.

  14. M. Maróti and R. McKenzie, Existence theorems for weakly symmetric operations, Algebra Universalis 59 (2008), no. 3–4, 463–489. (doi)
    • L. Barto, M. Kozik and T. Niven, The CSP dichotomy holds for digraphs with no sources and no sinks (A positive answer to a conjecture of Bang-Jensen and Hell), SIAM Journal on Computing, Volume 38 Issue 5, December 2008, 1782–1802.
    • L. Barto and M. Kozik, Constraint satisfaction problems of bounded width, Foundations of Computer Science, 2009, 595–603.
    • P. Hell and J. Nesetril, Colouring, constraint satisfaction, and complexity, Computer Science Review, vol. 2, no. 3, 143–163.
    • A. A. Bulatov, A. Krokhin and B. Larose, Dualities for constraint satisfaction problems, Lecture Notes in Computer Science, 2008, Volume 5250/2008, 93–124.
    • L. Barto, M. Kozik and T. Niven, Graphs, polymorphisms and the complexity of homomorphism problems, Proceedings of the 40th annual ACM symposium on Theory of Computing, 2008, 789–796.
    • P. Jonsson, A. Krokhin and F. Kuivinen, Hard constraint satisfaction problems have hard gaps at location 1, Theoretical Computer Science, vol. 410 (2009), no. 38–40, 3856–3874.
    • L. Barto and M. Kozik, New conditions for Taylor varieties and CSP, in 25th Logic in Computer Science (LICS 2010), 100–109.
    • J. Nesetril, M. H. Siggers and L. Zádori, A combinatorial constraint satisfaction problem dichotomy classification conjecture, European Journal of Combinatorics, vol. 31 (2010), 280–296.
    • C. Carvalho, V. Dalmau and A. Krokhin, CSP duality and trees of bounded pathwidth, Theoretical Computer Science, 2010.
    • M. Karimi and A. Gupta, Minimum cost homomorphisms to oriented cycles with some loops, Fifteenth Australasian Symposium on Computing: The Australasian Theory-Volume 94, 2009, 9–20.
    • M. M. Stronkowski and D. Stanovsky, Embedding general algebras into modules, Proc. Amer. Math. Soc., vol. 138, 2010, 2687–2699.
    • L. Egri, A. Krokhin, B. Larose and P. Tesson, The complexity of the list homomorphism problem for graphs, arXiv:0912.3802, 2009.
    • P. Hell and A. Rafiey, The dichotomy of list homomorphisms for digraphs, arXiv:1004.2908, 2010.
    • L. Barto and M. Kozik, Cyclic terms for SD(v) varieties revisited, Algebra Universalis, vol. 64, no. 1-2, 137–142
    • L. Zádori, Solvability of systems of polynomial equations over finite algebras, International Journal of Algebra and Computation, vol. 17, no. 4 (2007), 821–835.
    • V. Bárány, G. Gottlob and M. Otto, Querying the Guarded Fragment, in 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010), 1–10.
    • L. Barto and D. Stanovsky, Polymorphisms of small digraphs, submitted.

  15. B. A. Davey, M. Jackson, M. Maróti and R. McKenzie, Principal and syntactic congruences in congruence-distributive and congruence-permutable varieties, J. Australian Math. Soc. 85 (2008), no. 1, 59–74. (doi)
    • A. Kelarev, J. Yearwood and P. Watters, Internet security applications of Gröbner-Shirshov bases, Asian-European Journal of Mathematics, vol. 3, no. 3 (2010), 435–442.
    • A. Kelarev, P. Watters and J. Yearwood, Rees matrix constructions for clustering of data, Journal of the Australian Mathematical Society, vol. 87, no. 3 (2009), 377–393.

  16. M. Maróti, On the (un)decidability of a near-unanimity term, Algebra Universalis 57 (2007), no. 2, 215–237. (doi)
    • B. Larose, C. Loten and L. Zádori, A polynomial-time algorithm for near-unanimity graphs, J. Algorithms 55 (2005), no. 2, 177–191.

  17. K. Adaricheva, M. Maróti, R. McKenzie, J. B. Nation and Eric R. Zenk, The Jónsson-Kiefer property, Special issue of Studia Logica in memory of Willem Johannes Blok 83 (2006), no. 1–3, 111–131. (doi)
    • J. Cirulis, Nearlattices with an overriding operation, Order, online, 1–19.
    • M. Semenova, On lattices embeddable into lattices of algebraic subsets, Algebra Universalis, vol. 61, no. 3 (2009), 399–405.

  18. J. Jeľek, M. Maróti and R. McKenzie, Quasiequational theories of flat algebras, Czechoslovak Mathematical Journal 55 (2005), no. 3, 665–675. (doi)
    • B. A. Davey, M. Jackson, J. G. Pitkethly and M. R. Talukder, Natural dualities for semilattice-based algebras, Algebra Universalis, 57 (2007), 463–490.
    • M. Jackson and T. Stokes, Identities in the algebra of partial maps, Int. J. Algebra Comput. 16 (2006), 1131–1159.
    • E. W. Graczynska, On the problem of M-hyperquasivarieties, http://arxiv.org/abs/math/0609600v3.
    • M. Jackson, Flat algebras and the translation of universal Horn logic to equational logic, Journal of Symbolic Logic, vol. 73 (2008), 90–128.

  19. M. Maróti and R. McKenzie, Finite basis problems and results for quasivarieties, Studia Logica 78 (2004) November, no. 1–2, 293–320. (doi)
    • K. A. Baker, G. F. McNulty and Ju Wang, An extension of Willard's finite basis theorem: congruence meet-semidistributive varieties of finite critical depth, Algebra Universalis 52 (2004), no. 2-3, 289–302.
    • R. Willard, An overview of modern universal algebra, Tutorial at the Logic Colloquium, Torino, 2004.
    • R. S. Madarász, From sets to universal algebras (in Serbian), Faculty of Sciences, University of Novi Sad Press, 2006.
    • M. Jackson, Residual bounds for compact totally disconnected algebras, Houston J. Math, vol. 34 (2008), 33–67.
    • D. Casperson and J. Hyndman, Primitive positive formulas preventing a finite basis of quasi-equations, International Journal of Algebra and Computation, vol. 19, no. 7 (2009), 925–935.
    • A. M. Nurakunov and M. M. Stronkowski, Quasivarieties with definable relative principal subcongruences, Studia Logica, vol. 92 (2009), 109–120.

  20. R. Freese, J. Jeľek, P. Jipsen, P. Marković, M. Maróti and R. McKenzie, The variety generated by order algebras, Algebra Universalis 47 (2002), no. 2, 103–138. (doi)
    • J. Berman and W. J. Blok, Algebras defined from ordered sets and the varieties they generate, Order 23 (2006), no. 1, 65–88.
    • C. Guido and P. Toto, Extended-order algebras, Journal of Applied Logic, vol. 6, no. 4 (2008), 609–626.
    • I. Dolinka and P. Dapic, Quasilinear varieties of semigroups, Semigroup Forum, vol. 79, no. 3 (2009), 445–450.

  21. J. Jeľek, P. Marković, M. Maróti and R. McKenzie, Equations of tournaments are not finitely based, Discrete Mathematics 211 (2000), no. 1–3, 243–248. (doi)
    • A. A. Bulatov, Combinatorial problems raised from 2-semilattices, J. Algebra 298 (2006), no. 2, 321–339.
    • J. D. Berman and G. H. Bordalo, Irreducible elements and uniquely generated algebras, Discrete Math. 245 (2002), no. 1-3, 63–79.
    • I. Boąnjak and R. Madaras, On power structures, Algebra and Discrete Mathematics 2 (2003), 14–35.
    • V. Müller, J. Nesetril and V. Rödl, Some recollections on early work with Jan Pelant, Topology and its Applications, vol. 156, no. 7 (2009), 1438–1443.

  22. J. Jeľek, P. Marković, M. Maróti and R. McKenzie, The variety generated by tournaments, Acta Univ. Carolinae 40 (1999), no. 1, 21–41.

  23. M. Maróti, Semilattices with a group of automorphisms, Algebra Universalis 38 (1997), no. 3, 238–265. (doi)

Computer
Science
Journals
  1. Á. Lédeczi and M. Maróti, Wireless sensor node localization, Phil. Trans. of the Royal Society A, 370, no. 1958, 85–99, 01/2012. (doi)

  2. I. Amundson, J. Sallai, X. Koutsoukos, Á. Lédeczi and M. Maróti, RF angle of arrival-based node localisation, Int. J. of Sensor Networks, 9 (2011), nos. 3–4, 209–224. (doi)

  3. B. Kusý, P. Dutta, P. Levis, M. Maróti, Á. Lédeczi and D. Culler, Elapsed time on arrival: a simple and versatile primitive for canonical time synchronisation services, Int. J. Ad Hoc and Ubiquitous Computing 1 (2006), no. 4, 239–251. (doi)

  4. Á. Lédeczi, A. Nádas, P. Völgyesi, Gy. Balogh, B. Kusý, J. Sallai, G. Pap, S. Dóra, K. Molnár, M. Maróti and Gy. Simon, Countersniper system for urban warfare, ACM Transactions on Sensor Networks 1 (2005), no. 2, 153–177. (doi)

  5. P. Völgyesi, M. Maróti, S. Dóra, E. Osses and Á. Lédeczi, Software composition and verification for sensor networks, Special Issue on New Software Composition Concepts of the Journal of Science of Computer Programming (Elsevier) 56 (2005), no. 1–2, 191–210. (doi)

  6. M. Maróti, Gy. Simon, Á. Lédeczi and J. Sztipánovits, Shooter localization in urban terrain, IEEE Computer 37 (2004) August, no. 8, 60–61. (doi)

  7. G. Karsai, M. Maróti, Á. Lédeczi, J. Gray and J. Sztipánovits, Composition and cloning in modeling and meta-modeling, IEEE Transactions on Control Systems Technology 12 (2004) March, no. 2, 263–278. (doi)

  8. Á. Lédeczi, Á. Bakay, M. Maróti, P. Völgyesi, G. Nordstrom, J. Sprinkle and G. Karsai, Composing domain-specific design environments, IEEE Computer 34 (2001) November, 44–51. (doi)

Book chapters
  1. Á. Lédeczi, M. Maróti and P. Völgyesi, Framework for the rapid development of modeling environments, Chapter 13 in Advanced Topics in Database Research, volume III, ISBN 978-159-14-0255-8, Idea Group Publishing, 2004, 257–271. (doi)

  2. S. Szilvási, P. Völgyesi, M. Maróti, J. Sallai, Á. Lédeczi, Interferometry in wireless sensor networks, Capter 21 in Interferometry - Research and applications in science and technology (ed. Ivan Padron), ISBN 978-953-51-0403-2, InTech Publishing, 2012, 437–462.

Conference proceedings
  1. W. Hedgecock, M. Maróti, J. Sallai, P. Völgyesi and Á. Lédeczi, High-accuracy differential tracking of low-cost GPS receivers, ACM 11th International Conference on Mobile Systems, Applications, and Services (MobiSys), Taipei, Taiwan, June 2013, 221–234. (doi)

  2. G. Simkó, T. Levendovszky, M. Maróti and J. Sztipanovits, Towards a theory for cyber-physical systems modeling, 3rd Workshop on Design, Modeling and Evaluation of Cyber Physical Systems (CyPhy), Philadelphia, USA, April 2013, 56–61. (doi)

  3. J. Sallai, Á. Lédeczi, I. Amundson, X. Koutsouks and M. Maróti, Using RF received phase for indoor tracking, 6th Workshop on Hot Topics in Embedded Networked Systems, Killarney, Ireland, June 2010, 1–6. (doi)

  4. P. Völgyesi, J. Sallai, Á Lédeczi, P. Dutta and M. Maróti, Software development for a novel WSN platform, ICSE Workshop on Software Engineering for Sensor Network Applications (SENSEA), New York, USA, February 2010, 20–25. (doi)

  5. Á. Lédeczi, P. Völgyesi, J. Sallai, B. Kusý, X. Koutsoukos and M. Maróti, Towards precise indoor RF localization, 5th Workshop on Embedded Networked Sensors (HotEmNets), Charlottesville, USA, June 2008, 1–5.

  6. B. Kusý, Gy. Balogh, Á. Lédeczi, J. Sallai and M. Maróti, inTrack: High precision tracking of mobile sensor nodes, 4th European Workshop on Wireless Sensor Networks (EWSN), Delft, The Netherlands, January 2007, in Springer-Verlag Lecture Notes in Computer Science 4373 (2007), 51–66. (doi)

  7. J. Sallai, M. Maróti and Á. Lédeczi, A concurrency abstraction for reliable sensor network applications, 12th Monterey Workshop, Laguna Beach, USA, September 2005, in Springer-Verlag Lecture Notes in Computer Science 4322 (2007), 143–160. (doi)

  8. B. Kusý, Á. Lédeczi, M. Maróti and L. Meertens, Node-density independent localization, 5th IEEE Int. Conf. on Information Processing in Sensor Networks (IPSN), Nashville, USA, April 2006, 441–448. (doi)

  9. M. Kushwaha, K. Molnár, J. Sallai, P. Völgyesi, M. Maróti and Á. Lédeczi, Sensor node localization using mobile acoustic beacons, 2nd IEEE Int. Conf. on Mobile Ad-hoc and Sensor Systems (MASS), Washington, USA, November 2005, (CD-ROM) 9 pages. (doi)

  10. M. Maróti, B. Kusý, Gy. Balogh, P. Völgyesi, A. Nádas, K. Molnár, S. Dóra and Á. Lédeczi, Radio interferometric geolocation, 3rd ACM Int. Conf. on Embedded Networked Sensor Systems (SenSys), San Diego, USA, November 2005, 1–12. (doi)

  11. Gy. Balogh, Á. Lédeczi, M. Maróti and Gy. Simon, Time of arrival data fusion for source localization, Conf. on Sensorfusion, Visegrád, Hungary, July 2005, (CD-ROM) 10 pages.

  12. Á. Lédeczi, P. Völgyesi, M. Maróti, Gy. Simon, Gy. Balogh, A. Nádas, B. Kusý, S. Dóra and G. Pap, Multiple simultaneous acoustic source localization in urban terrain, 4th IEEE Int. Conf. on Information Processing in Sensor Networks (IPSN), Los Angeles, April 2005, USA, 491–496. (doi)

  13. Á. Lédeczi, Gy. Balogh, Z. Molnár, P. Völgyesi and M. Maróti, Model integrated computing in the large, IEEE Aerospace Conference, Big Sky, USA, March 2005, 1–8. (doi)

  14. Gy. Simon, M. Maróti, Á. Lédeczi, Gy. Balogh, B. Kusý, A. Nádas, G. Pap, J. Sallai and K. Frampton, Sensor network-based countersniper system, 2nd ACM Int. Conf. on Embedded Networked Sensor Systems (SenSys), Baltimore, USA, November 2004, 1–12. (doi)

  15. M. Maróti, B. Kusý, Gy. Simon and Á. Lédeczi, The flooding time synchronization protocol, 2nd ACM Int. Conf. on Embedded Networked Sensor Systems (SenSys), Baltimore, USA, November 2004, 39–49. (doi)

  16. M. Maróti, Directed flood-routing framework for wireless sensor networks, 5th ACM Int. Middleware Conference, Toronto, Canada, October 2004, in Springer-Verlag Lecture Notes in Computer Science 3231 (2004), 99–114. (doi)

  17. J. Sallai, Gy. Balogh, M. Maróti, Á. Lédeczi and B. Kusý, Acoustic ranging in resource-constrained sensor networks, Int. Conf. on Wireless and Mobile Computing (ICWN), Las Vegas, USA, June 2004, 467–473.

  18. B. Kusý, M. Maróti, G. Simon, and Á. Lédeczi, Robust multi-hop time synchronization in sensor networks, Int. Conf. on Wireless and Mobile Computing (ICWN), Las Vegas, USA, June 2004, 454–460.

  19. B. Kusý, Á. Lédeczi, M. Maróti and P. Völgyesi, Domain independent generative modeling, 11th IEEE Int. Conf. on the Engineering of Computer Based Systems (ECBS), Brno, Czech Republic, May 2004, 29–34.

  20. S. Kogekar, S. Neema, B. Eames, X. Koutsoukos, Á. Lédeczi and M. Maróti, Constraint-guided dynamic reconfiguration in sensor networks, 3rd IEEE Int. Conf. on Information Processing in Sensor Networks (IPSN), Berkeley, USA, April 2004, 379–387. (doi)

  21. P. Völgyesi, M. Maróti and Á. Lédeczi, Model-based software synthesis for distributed control systems and sensor networks, 4th Int. Carpathian Control Conference (ICCC), High Tatras, Slovak Republic, May 2003, (CD-ROM) 4 pages.

  22. Gy. Simon, P. Völgyesi, M. Maróti and Á. Lédeczi, Simulation-based optimization of communication protocols for large-scale wireless sensor networks, IEEE Aerospace Conference, Big Sky, USA, March 2003, no. 3, 1339–1346.

  23. M. Maróti, P. Völgyesi, Gy. Simon, G. Karsai and Á. Lédeczi, Distributed middleware services composition and synthesis technology, IEEE Aerospace Conference, Big Sky, USA, March 2003, no. 6, 2855–2862.

  24. T. Levendovszky, G. Karsai, Á. Lédeczi and M. Maróti, Model reuse with metamodel-based transformations, 7th Int. Conf. on Software Reuse: Methods, Techniques and Tools (ICSR), Austin, USA, April 2002, in Springer-Verlag Lecture Notes in Computer Science 2319 (2002), 166–178. (doi)

  25. M. Maróti, K. Frampton, G. Karsai, S. Bartók and Á. Lédeczi, Experimental platform for studying distributed embedded control applications, Languages, Compilers, and Tools for Embedded Systems Conference, Berlin, Germany, June 2002, 1–8.

  26. G. Karsai, Á. Lédeczi and M. Maróti, On generators for embedded information systems, 18th IEEE Conf. on Instrumentation and Measurement Technology, Budapest, Hungary, May 2001, vol. 3, 1474–1478. (doi)

  27. Á. Lédeczi, G. Nordstrom, G. Karsai, P. Völgyesi and M. Maróti, On metamodel composition, IEEE Int. Conf. on Control Applications (CCA), Mexico City, Mexico, September 2001, 756–760. (doi)

  28. Á. Lédeczi, M. Maróti, Á. Bakay, G. Karsai, J. Garrett, C. Thomason, G. Nordstrom, J. Sprinkle and P. Völgyesi, The generic modeling environment, IEEE Int. Workshop on Intelligent Signal Processing (WISP), Budapest, Hungary, May 2001, (CD-ROM) 6 pages.

  29. Á. Lédeczi, Á. Bakay and M. Maróti, Model-integrated embedded systems, 1st Int. Workshop on Self-Adaptive Software (IWSAS), Oxford, UK, April 2000, in Springer-Verlag Lecture Notes in Computer Science 1936 (2001), 99–115. (doi)

  30. D. Deva, J. Sprinkle, M. Maróti and G. Nordstrom, Towards a standard for model specification and storage, IEEE Int. Conference on Systems, Man and Cybernetics (SMC), Nashville, USA, September 2000, 364–369. (doi)

  31. Á. Lédeczi, M. Maróti, G. Karsai and G. Nordstrom, Metaprogrammable toolkit for model-integrated computing, IEEE Int. Conference on Engineering of Computer Based Systems (ECBS), Nashville, USA, March 1999, 311–317. (doi)

Patents
  1. Á. Lédeczi, M. Maróti, Gy. Balogh, P. Völgyesi, A. Nádas, K. Molnár, S. Dóra and B. Kusý, System and methods of radio interference based localization in sensor networks, US patent 7558583, Vanderbilt University, July 7, 2009.

  2. Á. Lédeczi, M. Maróti, Gy. Simon and Gy. Balogh, Acoustic source localization system and applications of the same, US patent 7433266, Vanderbilt University, October 7, 2008.



Theses


Presentations
  1. Tutorial on the constraint satisfaction problem.* Summer School on General Algebra and Ordered Sets, Nový Smokovec, Slovakia, September 2–7, 2012.

  2. Directed graphs and Maltsev conditions. Summer School on General Algebra and Ordered Sets, Podlesí, Czech Republic, September 3–9, 2011.

  3. Beyond bounded width and few subpowers.* Workshop on Algebra and CSPs, Toronto, Canada, August 2–6, 2011.

  4. Polymorphisms of reflexive digraphs.* 2nd Int. Conf. on Order, Algebra and Logic, Krakow, Poland, June 6–10, 2011.

  5. CSP reductions. Summer School on General Algebra and Ordered Sets, Malenovice, Czech Republic, September 4–10, 2010.

  6. Minimal quasivarieties of semilattices with a group of automorphisms.* Int. Conference on Algebras and Lattices (Jardafest), Prague, Czech Republic, June 21–25, 2010.

  7. The constraint satisfaction problem for bounded width and Maltsev algebras.* BLAST Conferene, Las Cruces, USA, August 10–14, 2009.

  8. Bounded relational width and congruence distributivity.* 76th Workshop on General Algebra (AAA76), Linz, Austria, May 22–25, 2008.

  9. Gumm terms imply cyclic terms for finite algebras. Conference on Algorithmic Complexity and Universal Algebra, Szeged, Hungary, July 16–20, 2007.

  10. Existence of weakly symmetric operations.* Workshop on Universal Algebra and the Constraint Satisfaction Problem, Nashville, USA, June 17–20, 2007.

  11. Near-unanimity terms are decidable.* Int. Conference on Order, Algebra, and Logics, in conjunction with the 22nd annual Shanks Lectures, Nashville, USA, June 12–16, 2007.

  12. Radio interferometric positioning. ACM 3rd Conference on Embedded Networked Sensor Systems (SenSys), San Diego, USA, November 2–4, 2005.

  13. The existence of a near-unanimity term in a finite algebra is decidable. 1101st AMS Meeting, Special Session on Universal Algebra and Order, Lincoln, USA, October 21–23, 2005.

  14. The flooding time synchronization protocol. ACM 2nd Conference on Embedded Networked Sensor Systems (SenSys), Baltimore, USA, November 3–5, 2004.

  15. Finite axiomatizability for quasivarieties. 999th AMS Meeting, Special Session on Universal Algebra and Lattice Theory, Nashville, USA, October 16–17, 2004.

  16. Finite basis problems and results for quasivarieties.* Logic Colloquium 2004, ASL European Summer Meeting, Torino, Italy, July 25–31, 2004.

  17. Wireless sensor network based shooter localization. Center for Hybrid and Embedded Software Systems (CHESS), Berkeley, USA, April 27, 2004.

  18. Timers and Time Synchronization. TinyOS Technology Exchange, Berkeley, USA, February 26, 2004.

  19. Practical mathematical problems in embedded sensor networks. Workshop on the Fundamentals of Sensor Webs (FUSE), Berkeley, USA, May 9, 2003.

  20. Middleware design in networked embedded systems. Center for Hybrid and Embedded Software Systems (CHESS), Berkeley, USA, May 8, 2003.

  21. Distributed middleware services composition and synthesis technology. IEEE Aerospace Conference, Big Sky, USA, March 8–15, 2003.

  22. The finite quasi-equational base problem.* Conference on Universal Algebra and Lattice Theory, Szeged, Hungary, July 22–26, 2002.

  23. The variety generated by tournaments. International Conference on Modern Algebra, Nashville, USA, May 21–24, 2002.

  24. On the variety generated by tournaments. 963rd AMS Meeting, Special Session on Algebras, Lattices, Varieties, Columbia, USA, March 16–18, 2001.

  25. The equational theory of residuated lattices. Workshop on Ordered Algebraic Structures, Nashville, USA, March 9–11, 2000.

  26. Metaprogrammable toolkit for model-integrated computing. IEEE Conference and Workshop on Engineering of Computer-Based Systems, Nashville, USA, March 7–12, 1999.

  27. Some undecidable problems in universal algebra. Conference for Graduate Students in Mathematics, Szeged, Hungary, December 16–18, 1998.

  28. The variety generated by tournaments. 931st AMS Meeting, Special Session on Semigroups, Algorithms and Universal Algebra, Louisville, USA, March 20–21, 1998.

  29. Semilattices with a group of automorphisms. Workshop on General Algebra and 12th Conference of Young Algebraists, Technical University of Dresden, Germany, February 7–9, 1997.

  30. Semilattices with a commutative group of automorphisms. Universal Algebra and Lattice Theory, Szeged, Hungary, July 15–19, 1996.



Valid XHTML 1.0!

Last updated on April 11, 2009.

Visitor locations