On the complexity of searching in trees and partially ordered structures (bibtex)
by Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro
Reference:
On the complexity of searching in trees and partially ordered structures (Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro), In Theoretical Computer Science, volume 412, 2011.
Bibtex Entry:
@Article{laber_publication-128,
  author = 	{Cicalese, Ferdinando
		and Jacobs, Tobias
		and Laber, Eduardo Sany
		and Molinaro, Marco},
  title = 	{On the complexity of searching in trees and partially ordered structures},
  journal = 	{Theoretical Computer Science},
  year = 	{2011},
  volume = 	{412},
  pages = 	{6879--6896},
  issn = 	{03043975}
}
Powered by bibtexbrowser